./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 460c5a2466ddacef0b654abb4130c31f8265660c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 03:24:25,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:24:25,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:24:25,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:24:25,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:24:25,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:24:25,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:24:25,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:24:25,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:24:25,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:24:25,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:24:25,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:24:25,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:24:25,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:24:25,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:24:25,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:24:25,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:24:25,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:24:25,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:24:25,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:24:25,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:24:25,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:24:25,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:24:25,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:24:25,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:24:25,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:24:25,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:24:25,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:24:25,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:24:25,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:24:25,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:24:25,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:24:25,839 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:24:25,839 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:24:25,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:24:25,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:24:25,840 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 03:24:25,848 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:24:25,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:24:25,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:24:25,848 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:24:25,849 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:24:25,849 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:24:25,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:24:25,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:24:25,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:24:25,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:24:25,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:24:25,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:24:25,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:24:25,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:24:25,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:24:25,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 03:24:25,852 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 460c5a2466ddacef0b654abb4130c31f8265660c [2018-12-02 03:24:25,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:24:25,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:24:25,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:24:25,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:24:25,879 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:24:25,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-12-02 03:24:25,914 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/data/199e70658/8830e5e00dfe481c906cc4de45c2be6c/FLAG6f9377a76 [2018-12-02 03:24:26,338 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:24:26,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-12-02 03:24:26,344 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/data/199e70658/8830e5e00dfe481c906cc4de45c2be6c/FLAG6f9377a76 [2018-12-02 03:24:26,352 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/data/199e70658/8830e5e00dfe481c906cc4de45c2be6c [2018-12-02 03:24:26,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:24:26,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:24:26,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:24:26,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:24:26,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:24:26,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79beaaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26, skipping insertion in model container [2018-12-02 03:24:26,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:24:26,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:24:26,507 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:24:26,511 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:24:26,536 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:24:26,547 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:24:26,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26 WrapperNode [2018-12-02 03:24:26,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:24:26,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:24:26,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:24:26,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:24:26,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:24:26,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:24:26,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:24:26,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:24:26,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... [2018-12-02 03:24:26,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:24:26,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:24:26,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:24:26,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:24:26,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-02 03:24:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-02 03:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2018-12-02 03:24:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2018-12-02 03:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-02 03:24:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-02 03:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 03:24:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 03:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-02 03:24:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-02 03:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-02 03:24:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-02 03:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-02 03:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-02 03:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2018-12-02 03:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2018-12-02 03:24:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-02 03:24:26,648 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-02 03:24:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-02 03:24:26,648 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-02 03:24:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:24:26,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:24:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-02 03:24:26,648 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-02 03:24:26,929 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:24:26,929 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 03:24:26,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:24:26 BoogieIcfgContainer [2018-12-02 03:24:26,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:24:26,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:24:26,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:24:26,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:24:26,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:24:26" (1/3) ... [2018-12-02 03:24:26,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1790306b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:24:26, skipping insertion in model container [2018-12-02 03:24:26,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:24:26" (2/3) ... [2018-12-02 03:24:26,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1790306b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:24:26, skipping insertion in model container [2018-12-02 03:24:26,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:24:26" (3/3) ... [2018-12-02 03:24:26,934 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03_true-unreach-call_false-termination.cil.c [2018-12-02 03:24:26,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:24:26,945 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 03:24:26,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 03:24:26,974 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:24:26,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:24:26,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:24:26,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:24:26,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:24:26,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:24:26,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:24:26,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:24:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states. [2018-12-02 03:24:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:26,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:26,994 INFO L402 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] [2018-12-02 03:24:26,995 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:26,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash -458540871, now seen corresponding path program 1 times [2018-12-02 03:24:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:27,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:27,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:27,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:27,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:27,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:27,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:27,202 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 5 states. [2018-12-02 03:24:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:27,538 INFO L93 Difference]: Finished difference Result 424 states and 630 transitions. [2018-12-02 03:24:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:27,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:27,550 INFO L225 Difference]: With dead ends: 424 [2018-12-02 03:24:27,550 INFO L226 Difference]: Without dead ends: 229 [2018-12-02 03:24:27,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-02 03:24:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2018-12-02 03:24:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2018-12-02 03:24:27,602 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 105 [2018-12-02 03:24:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:27,603 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2018-12-02 03:24:27,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2018-12-02 03:24:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:27,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:27,606 INFO L402 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] [2018-12-02 03:24:27,606 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:27,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1108217079, now seen corresponding path program 1 times [2018-12-02 03:24:27,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:27,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:27,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:27,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:27,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:27,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:27,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:27,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:27,679 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand 5 states. [2018-12-02 03:24:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:27,957 INFO L93 Difference]: Finished difference Result 403 states and 572 transitions. [2018-12-02 03:24:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:27,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:27,958 INFO L225 Difference]: With dead ends: 403 [2018-12-02 03:24:27,959 INFO L226 Difference]: Without dead ends: 229 [2018-12-02 03:24:27,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-02 03:24:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2018-12-02 03:24:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 267 transitions. [2018-12-02 03:24:27,973 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 267 transitions. Word has length 105 [2018-12-02 03:24:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:27,974 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 267 transitions. [2018-12-02 03:24:27,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 267 transitions. [2018-12-02 03:24:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:27,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:27,975 INFO L402 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] [2018-12-02 03:24:27,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:27,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 50379001, now seen corresponding path program 1 times [2018-12-02 03:24:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:27,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:27,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:28,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:28,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:28,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:28,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:28,031 INFO L87 Difference]: Start difference. First operand 195 states and 267 transitions. Second operand 5 states. [2018-12-02 03:24:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:28,299 INFO L93 Difference]: Finished difference Result 401 states and 566 transitions. [2018-12-02 03:24:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:28,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:28,301 INFO L225 Difference]: With dead ends: 401 [2018-12-02 03:24:28,301 INFO L226 Difference]: Without dead ends: 227 [2018-12-02 03:24:28,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-02 03:24:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2018-12-02 03:24:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 266 transitions. [2018-12-02 03:24:28,320 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 266 transitions. Word has length 105 [2018-12-02 03:24:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:28,320 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 266 transitions. [2018-12-02 03:24:28,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 266 transitions. [2018-12-02 03:24:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:28,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:28,322 INFO L402 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] [2018-12-02 03:24:28,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:28,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1092123465, now seen corresponding path program 1 times [2018-12-02 03:24:28,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:28,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:28,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:28,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:28,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:28,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:28,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:28,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:28,385 INFO L87 Difference]: Start difference. First operand 195 states and 266 transitions. Second operand 5 states. [2018-12-02 03:24:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:28,610 INFO L93 Difference]: Finished difference Result 419 states and 594 transitions. [2018-12-02 03:24:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:28,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:28,612 INFO L225 Difference]: With dead ends: 419 [2018-12-02 03:24:28,612 INFO L226 Difference]: Without dead ends: 245 [2018-12-02 03:24:28,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-02 03:24:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195. [2018-12-02 03:24:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2018-12-02 03:24:28,630 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 105 [2018-12-02 03:24:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:28,630 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2018-12-02 03:24:28,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2018-12-02 03:24:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:28,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:28,631 INFO L402 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] [2018-12-02 03:24:28,632 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:28,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash -253089803, now seen corresponding path program 1 times [2018-12-02 03:24:28,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:28,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:28,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:28,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:28,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:28,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:28,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:28,696 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2018-12-02 03:24:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:28,959 INFO L93 Difference]: Finished difference Result 413 states and 583 transitions. [2018-12-02 03:24:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:28,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:28,962 INFO L225 Difference]: With dead ends: 413 [2018-12-02 03:24:28,962 INFO L226 Difference]: Without dead ends: 239 [2018-12-02 03:24:28,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-02 03:24:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2018-12-02 03:24:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2018-12-02 03:24:28,978 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 105 [2018-12-02 03:24:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:28,979 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2018-12-02 03:24:28,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2018-12-02 03:24:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:28,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:28,980 INFO L402 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] [2018-12-02 03:24:28,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:28,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:28,980 INFO L82 PathProgramCache]: Analyzing trace with hash -226024201, now seen corresponding path program 1 times [2018-12-02 03:24:28,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:28,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:28,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:29,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:29,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:29,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:29,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:29,028 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 5 states. [2018-12-02 03:24:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:29,259 INFO L93 Difference]: Finished difference Result 415 states and 582 transitions. [2018-12-02 03:24:29,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:29,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:29,261 INFO L225 Difference]: With dead ends: 415 [2018-12-02 03:24:29,261 INFO L226 Difference]: Without dead ends: 241 [2018-12-02 03:24:29,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-02 03:24:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2018-12-02 03:24:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2018-12-02 03:24:29,275 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 105 [2018-12-02 03:24:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:29,275 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2018-12-02 03:24:29,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2018-12-02 03:24:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:29,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:29,276 INFO L402 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] [2018-12-02 03:24:29,276 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:29,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1991606197, now seen corresponding path program 1 times [2018-12-02 03:24:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:29,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:29,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:29,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:29,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:29,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:29,325 INFO L87 Difference]: Start difference. First operand 195 states and 263 transitions. Second operand 5 states. [2018-12-02 03:24:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:29,562 INFO L93 Difference]: Finished difference Result 413 states and 576 transitions. [2018-12-02 03:24:29,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:29,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:29,563 INFO L225 Difference]: With dead ends: 413 [2018-12-02 03:24:29,563 INFO L226 Difference]: Without dead ends: 239 [2018-12-02 03:24:29,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-02 03:24:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2018-12-02 03:24:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-02 03:24:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2018-12-02 03:24:29,573 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 105 [2018-12-02 03:24:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:29,574 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2018-12-02 03:24:29,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2018-12-02 03:24:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:29,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:29,574 INFO L402 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] [2018-12-02 03:24:29,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:29,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash -569256649, now seen corresponding path program 1 times [2018-12-02 03:24:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:24:29,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:29,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:24:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:24:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:29,604 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand 6 states. [2018-12-02 03:24:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:29,636 INFO L93 Difference]: Finished difference Result 384 states and 534 transitions. [2018-12-02 03:24:29,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:29,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 03:24:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:29,638 INFO L225 Difference]: With dead ends: 384 [2018-12-02 03:24:29,638 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 03:24:29,639 INFO L631 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 [2018-12-02 03:24:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 03:24:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2018-12-02 03:24:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-02 03:24:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2018-12-02 03:24:29,656 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 105 [2018-12-02 03:24:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:29,656 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2018-12-02 03:24:29,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:24:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2018-12-02 03:24:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:29,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:29,658 INFO L402 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] [2018-12-02 03:24:29,658 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:29,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 110015605, now seen corresponding path program 1 times [2018-12-02 03:24:29,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:29,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:29,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:24:29,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:29,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:24:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:24:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:29,702 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand 6 states. [2018-12-02 03:24:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:29,752 INFO L93 Difference]: Finished difference Result 391 states and 539 transitions. [2018-12-02 03:24:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:29,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 03:24:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:29,753 INFO L225 Difference]: With dead ends: 391 [2018-12-02 03:24:29,754 INFO L226 Difference]: Without dead ends: 213 [2018-12-02 03:24:29,754 INFO L631 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 [2018-12-02 03:24:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-02 03:24:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2018-12-02 03:24:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-02 03:24:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2018-12-02 03:24:29,764 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 105 [2018-12-02 03:24:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:29,764 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2018-12-02 03:24:29,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:24:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2018-12-02 03:24:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:29,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:29,765 INFO L402 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] [2018-12-02 03:24:29,765 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:29,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash 553916279, now seen corresponding path program 1 times [2018-12-02 03:24:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:29,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:29,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:29,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:24:29,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:29,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:24:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:24:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:29,795 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand 6 states. [2018-12-02 03:24:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:29,830 INFO L93 Difference]: Finished difference Result 398 states and 544 transitions. [2018-12-02 03:24:29,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:29,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 03:24:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:29,831 INFO L225 Difference]: With dead ends: 398 [2018-12-02 03:24:29,831 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 03:24:29,832 INFO L631 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 [2018-12-02 03:24:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 03:24:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2018-12-02 03:24:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-02 03:24:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2018-12-02 03:24:29,841 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 105 [2018-12-02 03:24:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:29,842 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2018-12-02 03:24:29,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:24:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2018-12-02 03:24:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:29,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:29,843 INFO L402 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] [2018-12-02 03:24:29,843 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:29,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1495471563, now seen corresponding path program 1 times [2018-12-02 03:24:29,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:29,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:29,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:29,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:24:29,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:29,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:24:29,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:24:29,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:24:29,886 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 4 states. [2018-12-02 03:24:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:30,024 INFO L93 Difference]: Finished difference Result 579 states and 791 transitions. [2018-12-02 03:24:30,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:24:30,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 03:24:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:30,026 INFO L225 Difference]: With dead ends: 579 [2018-12-02 03:24:30,026 INFO L226 Difference]: Without dead ends: 391 [2018-12-02 03:24:30,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:24:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-02 03:24:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 386. [2018-12-02 03:24:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-12-02 03:24:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 508 transitions. [2018-12-02 03:24:30,058 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 508 transitions. Word has length 105 [2018-12-02 03:24:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:30,058 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 508 transitions. [2018-12-02 03:24:30,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:24:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 508 transitions. [2018-12-02 03:24:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:30,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:30,059 INFO L402 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] [2018-12-02 03:24:30,059 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:30,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1980646282, now seen corresponding path program 1 times [2018-12-02 03:24:30,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:30,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:30,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:30,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:30,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:24:30,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:30,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:24:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:24:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:24:30,086 INFO L87 Difference]: Start difference. First operand 386 states and 508 transitions. Second operand 6 states. [2018-12-02 03:24:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:30,133 INFO L93 Difference]: Finished difference Result 757 states and 1021 transitions. [2018-12-02 03:24:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:30,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 03:24:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:30,135 INFO L225 Difference]: With dead ends: 757 [2018-12-02 03:24:30,135 INFO L226 Difference]: Without dead ends: 393 [2018-12-02 03:24:30,136 INFO L631 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 [2018-12-02 03:24:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-02 03:24:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2018-12-02 03:24:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-02 03:24:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 512 transitions. [2018-12-02 03:24:30,166 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 512 transitions. Word has length 105 [2018-12-02 03:24:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:30,167 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 512 transitions. [2018-12-02 03:24:30,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:24:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 512 transitions. [2018-12-02 03:24:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:30,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:30,168 INFO L402 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] [2018-12-02 03:24:30,168 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:30,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1470315512, now seen corresponding path program 1 times [2018-12-02 03:24:30,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:30,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:30,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:30,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:30,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:30,227 INFO L87 Difference]: Start difference. First operand 391 states and 512 transitions. Second operand 5 states. [2018-12-02 03:24:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:30,511 INFO L93 Difference]: Finished difference Result 929 states and 1219 transitions. [2018-12-02 03:24:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:30,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:30,514 INFO L225 Difference]: With dead ends: 929 [2018-12-02 03:24:30,514 INFO L226 Difference]: Without dead ends: 561 [2018-12-02 03:24:30,515 INFO L631 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 [2018-12-02 03:24:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-02 03:24:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 511. [2018-12-02 03:24:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-12-02 03:24:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 648 transitions. [2018-12-02 03:24:30,551 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 648 transitions. Word has length 105 [2018-12-02 03:24:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:30,551 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 648 transitions. [2018-12-02 03:24:30,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 648 transitions. [2018-12-02 03:24:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:30,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:30,552 INFO L402 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] [2018-12-02 03:24:30,552 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:30,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2123051910, now seen corresponding path program 1 times [2018-12-02 03:24:30,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:30,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:30,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:30,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:30,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:30,605 INFO L87 Difference]: Start difference. First operand 511 states and 648 transitions. Second operand 5 states. [2018-12-02 03:24:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:30,826 INFO L93 Difference]: Finished difference Result 999 states and 1270 transitions. [2018-12-02 03:24:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:30,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:30,828 INFO L225 Difference]: With dead ends: 999 [2018-12-02 03:24:30,828 INFO L226 Difference]: Without dead ends: 511 [2018-12-02 03:24:30,829 INFO L631 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 [2018-12-02 03:24:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-02 03:24:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2018-12-02 03:24:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-12-02 03:24:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 644 transitions. [2018-12-02 03:24:30,850 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 644 transitions. Word has length 105 [2018-12-02 03:24:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:30,850 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 644 transitions. [2018-12-02 03:24:30,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 644 transitions. [2018-12-02 03:24:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:30,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:30,851 INFO L402 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] [2018-12-02 03:24:30,851 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:30,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2100419656, now seen corresponding path program 1 times [2018-12-02 03:24:30,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:30,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:30,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:30,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:30,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:30,900 INFO L87 Difference]: Start difference. First operand 511 states and 644 transitions. Second operand 5 states. [2018-12-02 03:24:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:31,113 INFO L93 Difference]: Finished difference Result 999 states and 1262 transitions. [2018-12-02 03:24:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:31,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:31,115 INFO L225 Difference]: With dead ends: 999 [2018-12-02 03:24:31,115 INFO L226 Difference]: Without dead ends: 511 [2018-12-02 03:24:31,116 INFO L631 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 [2018-12-02 03:24:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-02 03:24:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2018-12-02 03:24:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-12-02 03:24:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 640 transitions. [2018-12-02 03:24:31,137 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 640 transitions. Word has length 105 [2018-12-02 03:24:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:31,137 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 640 transitions. [2018-12-02 03:24:31,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 640 transitions. [2018-12-02 03:24:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:31,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:31,138 INFO L402 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] [2018-12-02 03:24:31,138 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:31,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash -714216262, now seen corresponding path program 1 times [2018-12-02 03:24:31,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:31,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:31,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:31,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:31,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:31,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:31,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:31,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:31,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:31,171 INFO L87 Difference]: Start difference. First operand 511 states and 640 transitions. Second operand 5 states. [2018-12-02 03:24:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:31,467 INFO L93 Difference]: Finished difference Result 1193 states and 1513 transitions. [2018-12-02 03:24:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:31,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:31,469 INFO L225 Difference]: With dead ends: 1193 [2018-12-02 03:24:31,469 INFO L226 Difference]: Without dead ends: 705 [2018-12-02 03:24:31,470 INFO L631 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 [2018-12-02 03:24:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-12-02 03:24:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 669. [2018-12-02 03:24:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-12-02 03:24:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 830 transitions. [2018-12-02 03:24:31,498 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 830 transitions. Word has length 105 [2018-12-02 03:24:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:31,498 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 830 transitions. [2018-12-02 03:24:31,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 830 transitions. [2018-12-02 03:24:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:31,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:31,499 INFO L402 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] [2018-12-02 03:24:31,499 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:31,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1223689352, now seen corresponding path program 1 times [2018-12-02 03:24:31,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:31,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:31,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:31,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:31,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:31,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:31,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:31,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:31,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:31,529 INFO L87 Difference]: Start difference. First operand 669 states and 830 transitions. Second operand 5 states. [2018-12-02 03:24:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:31,855 INFO L93 Difference]: Finished difference Result 1443 states and 1854 transitions. [2018-12-02 03:24:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:31,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:31,858 INFO L225 Difference]: With dead ends: 1443 [2018-12-02 03:24:31,858 INFO L226 Difference]: Without dead ends: 797 [2018-12-02 03:24:31,860 INFO L631 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 [2018-12-02 03:24:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-12-02 03:24:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 709. [2018-12-02 03:24:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-12-02 03:24:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 864 transitions. [2018-12-02 03:24:31,901 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 864 transitions. Word has length 105 [2018-12-02 03:24:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:31,901 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 864 transitions. [2018-12-02 03:24:31,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 864 transitions. [2018-12-02 03:24:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:31,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:31,902 INFO L402 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] [2018-12-02 03:24:31,902 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:31,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash 699538682, now seen corresponding path program 1 times [2018-12-02 03:24:31,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:31,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:31,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:31,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:31,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:31,954 INFO L87 Difference]: Start difference. First operand 709 states and 864 transitions. Second operand 5 states. [2018-12-02 03:24:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:32,276 INFO L93 Difference]: Finished difference Result 1616 states and 2067 transitions. [2018-12-02 03:24:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:32,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:32,279 INFO L225 Difference]: With dead ends: 1616 [2018-12-02 03:24:32,279 INFO L226 Difference]: Without dead ends: 930 [2018-12-02 03:24:32,281 INFO L631 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 [2018-12-02 03:24:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-12-02 03:24:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 790. [2018-12-02 03:24:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-02 03:24:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 945 transitions. [2018-12-02 03:24:32,317 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 945 transitions. Word has length 105 [2018-12-02 03:24:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:32,317 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 945 transitions. [2018-12-02 03:24:32,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 945 transitions. [2018-12-02 03:24:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:32,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:32,318 INFO L402 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] [2018-12-02 03:24:32,318 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:32,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 761578296, now seen corresponding path program 1 times [2018-12-02 03:24:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:32,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:32,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:32,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:32,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:32,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:32,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:32,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:32,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:32,352 INFO L87 Difference]: Start difference. First operand 790 states and 945 transitions. Second operand 5 states. [2018-12-02 03:24:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:32,658 INFO L93 Difference]: Finished difference Result 1715 states and 2136 transitions. [2018-12-02 03:24:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:24:32,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 03:24:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:32,661 INFO L225 Difference]: With dead ends: 1715 [2018-12-02 03:24:32,661 INFO L226 Difference]: Without dead ends: 950 [2018-12-02 03:24:32,662 INFO L631 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 [2018-12-02 03:24:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-02 03:24:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 865. [2018-12-02 03:24:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-02 03:24:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1017 transitions. [2018-12-02 03:24:32,702 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1017 transitions. Word has length 105 [2018-12-02 03:24:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:32,702 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1017 transitions. [2018-12-02 03:24:32,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1017 transitions. [2018-12-02 03:24:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 03:24:32,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:32,703 INFO L402 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] [2018-12-02 03:24:32,703 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash 627564790, now seen corresponding path program 1 times [2018-12-02 03:24:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:32,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:32,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:24:32,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:32,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:24:32,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:32,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:24:32,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:24:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:24:32,728 INFO L87 Difference]: Start difference. First operand 865 states and 1017 transitions. Second operand 3 states. [2018-12-02 03:24:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:32,829 INFO L93 Difference]: Finished difference Result 2516 states and 3052 transitions. [2018-12-02 03:24:32,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:24:32,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-02 03:24:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:32,833 INFO L225 Difference]: With dead ends: 2516 [2018-12-02 03:24:32,833 INFO L226 Difference]: Without dead ends: 1674 [2018-12-02 03:24:32,834 INFO L631 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 [2018-12-02 03:24:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2018-12-02 03:24:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1672. [2018-12-02 03:24:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-12-02 03:24:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1995 transitions. [2018-12-02 03:24:32,907 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1995 transitions. Word has length 105 [2018-12-02 03:24:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:32,907 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1995 transitions. [2018-12-02 03:24:32,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:24:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1995 transitions. [2018-12-02 03:24:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 03:24:32,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:32,909 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:24:32,909 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:32,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2054479213, now seen corresponding path program 1 times [2018-12-02 03:24:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:32,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 03:24:32,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:24:32,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:24:32,948 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-02 03:24:32,950 INFO L205 CegarAbsIntRunner]: [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [181], [183], [185], [186], [236], [238], [243], [246], [251], [254], [259], [262], [267], [269], [271], [272], [275], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [348], [353], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [468], [481], [494], [500], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:24:32,974 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:24:32,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:24:33,153 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 03:24:33,154 INFO L272 AbstractInterpreter]: Visited 114 different actions 153 times. Never merged. Never widened. Performed 1232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-12-02 03:24:33,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:33,163 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 03:24:33,353 INFO L227 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 75.17% of their original sizes. [2018-12-02 03:24:33,353 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 03:24:34,537 INFO L418 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-12-02 03:24:34,537 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 03:24:34,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:24:34,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [4] total 67 [2018-12-02 03:24:34,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:34,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-02 03:24:34,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-02 03:24:34,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=3636, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 03:24:34,539 INFO L87 Difference]: Start difference. First operand 1672 states and 1995 transitions. Second operand 65 states. [2018-12-02 03:24:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:43,581 INFO L93 Difference]: Finished difference Result 3780 states and 4568 transitions. [2018-12-02 03:24:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-02 03:24:43,581 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 170 [2018-12-02 03:24:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:43,585 INFO L225 Difference]: With dead ends: 3780 [2018-12-02 03:24:43,585 INFO L226 Difference]: Without dead ends: 2123 [2018-12-02 03:24:43,589 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1631, Invalid=14119, Unknown=0, NotChecked=0, Total=15750 [2018-12-02 03:24:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2018-12-02 03:24:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2102. [2018-12-02 03:24:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-12-02 03:24:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2476 transitions. [2018-12-02 03:24:43,711 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2476 transitions. Word has length 170 [2018-12-02 03:24:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:43,711 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2476 transitions. [2018-12-02 03:24:43,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-02 03:24:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2476 transitions. [2018-12-02 03:24:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 03:24:43,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:43,713 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:24:43,713 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:43,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash -120614005, now seen corresponding path program 1 times [2018-12-02 03:24:43,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:43,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:43,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:43,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:43,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 03:24:43,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:24:43,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:24:43,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:43,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:24:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:24:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:24:43,751 INFO L87 Difference]: Start difference. First operand 2102 states and 2476 transitions. Second operand 5 states. [2018-12-02 03:24:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:44,298 INFO L93 Difference]: Finished difference Result 4915 states and 5978 transitions. [2018-12-02 03:24:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:24:44,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2018-12-02 03:24:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:44,304 INFO L225 Difference]: With dead ends: 4915 [2018-12-02 03:24:44,304 INFO L226 Difference]: Without dead ends: 2615 [2018-12-02 03:24:44,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:24:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2018-12-02 03:24:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 2506. [2018-12-02 03:24:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-12-02 03:24:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2943 transitions. [2018-12-02 03:24:44,439 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2943 transitions. Word has length 176 [2018-12-02 03:24:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:44,439 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 2943 transitions. [2018-12-02 03:24:44,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:24:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2943 transitions. [2018-12-02 03:24:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-02 03:24:44,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:44,444 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:24:44,444 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:44,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -920601506, now seen corresponding path program 1 times [2018-12-02 03:24:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:44,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:44,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 03:24:44,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:24:44,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:24:44,502 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-12-02 03:24:44,502 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [259], [262], [267], [269], [271], [272], [275], [277], [280], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [455], [459], [465], [468], [472], [478], [481], [485], [488], [500], [503], [508], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:24:44,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:24:44,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:24:44,586 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 03:24:44,586 INFO L272 AbstractInterpreter]: Visited 133 different actions 196 times. Merged at 13 different actions 13 times. Never widened. Performed 1599 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1599 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2018-12-02 03:24:44,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:44,588 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 03:24:44,734 INFO L227 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 74.77% of their original sizes. [2018-12-02 03:24:44,735 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 03:24:45,940 INFO L418 sIntCurrentIteration]: We unified 245 AI predicates to 245 [2018-12-02 03:24:45,940 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 03:24:45,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:24:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [4] total 77 [2018-12-02 03:24:45,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:45,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-02 03:24:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-02 03:24:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=5056, Unknown=0, NotChecked=0, Total=5550 [2018-12-02 03:24:45,942 INFO L87 Difference]: Start difference. First operand 2506 states and 2943 transitions. Second operand 75 states. [2018-12-02 03:24:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:56,559 INFO L93 Difference]: Finished difference Result 4351 states and 5206 transitions. [2018-12-02 03:24:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-02 03:24:56,559 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 246 [2018-12-02 03:24:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:56,564 INFO L225 Difference]: With dead ends: 4351 [2018-12-02 03:24:56,565 INFO L226 Difference]: Without dead ends: 2468 [2018-12-02 03:24:56,573 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 320 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7770 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1845, Invalid=20505, Unknown=0, NotChecked=0, Total=22350 [2018-12-02 03:24:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2018-12-02 03:24:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2333. [2018-12-02 03:24:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2018-12-02 03:24:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 2754 transitions. [2018-12-02 03:24:56,716 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 2754 transitions. Word has length 246 [2018-12-02 03:24:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:56,716 INFO L480 AbstractCegarLoop]: Abstraction has 2333 states and 2754 transitions. [2018-12-02 03:24:56,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-02 03:24:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2754 transitions. [2018-12-02 03:24:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-02 03:24:56,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:56,720 INFO L402 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, 3, 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] [2018-12-02 03:24:56,721 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:56,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1949875438, now seen corresponding path program 1 times [2018-12-02 03:24:56,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:56,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:56,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-02 03:24:56,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:24:56,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:24:56,781 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-12-02 03:24:56,782 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [259], [262], [267], [269], [271], [272], [275], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [452], [459], [465], [468], [472], [478], [481], [485], [488], [500], [503], [508], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:24:56,785 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:24:56,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:24:56,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:24:56,915 INFO L272 AbstractInterpreter]: Visited 136 different actions 372 times. Merged at 28 different actions 62 times. Never widened. Performed 4978 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 54 variables. [2018-12-02 03:24:56,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:56,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:24:56,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:24:56,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:24:56,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:56,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:24:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:57,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:24:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 03:24:57,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:24:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:24:57,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:24:57,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-02 03:24:57,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:24:57,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:24:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:24:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:24:57,307 INFO L87 Difference]: Start difference. First operand 2333 states and 2754 transitions. Second operand 4 states. [2018-12-02 03:24:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:24:57,778 INFO L93 Difference]: Finished difference Result 4975 states and 6093 transitions. [2018-12-02 03:24:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:24:57,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-12-02 03:24:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:24:57,790 INFO L225 Difference]: With dead ends: 4975 [2018-12-02 03:24:57,790 INFO L226 Difference]: Without dead ends: 3612 [2018-12-02 03:24:57,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:24:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2018-12-02 03:24:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3609. [2018-12-02 03:24:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2018-12-02 03:24:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4400 transitions. [2018-12-02 03:24:58,023 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4400 transitions. Word has length 247 [2018-12-02 03:24:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:24:58,023 INFO L480 AbstractCegarLoop]: Abstraction has 3609 states and 4400 transitions. [2018-12-02 03:24:58,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:24:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4400 transitions. [2018-12-02 03:24:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-12-02 03:24:58,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:24:58,027 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-02 03:24:58,028 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:24:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 421346026, now seen corresponding path program 1 times [2018-12-02 03:24:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:24:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:58,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:24:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:24:58,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:24:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:24:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-12-02 03:24:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:24:58,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:24:58,137 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 478 with the following transitions: [2018-12-02 03:24:58,138 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [31], [33], [36], [47], [49], [51], [53], [57], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [259], [262], [265], [267], [269], [271], [272], [275], [277], [280], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [455], [459], [462], [468], [472], [475], [481], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:24:58,139 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:24:58,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:24:58,183 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 03:24:58,183 INFO L272 AbstractInterpreter]: Visited 134 different actions 190 times. Merged at 6 different actions 6 times. Never widened. Performed 1781 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1781 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-12-02 03:24:58,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:24:58,187 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 03:24:58,314 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 70.92% of their original sizes. [2018-12-02 03:24:58,314 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 03:25:00,164 INFO L418 sIntCurrentIteration]: We unified 476 AI predicates to 476 [2018-12-02 03:25:00,164 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 03:25:00,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:25:00,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [6] total 83 [2018-12-02 03:25:00,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:00,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-02 03:25:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-02 03:25:00,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=5680, Unknown=0, NotChecked=0, Total=6162 [2018-12-02 03:25:00,168 INFO L87 Difference]: Start difference. First operand 3609 states and 4400 transitions. Second operand 79 states. [2018-12-02 03:25:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:10,685 INFO L93 Difference]: Finished difference Result 7057 states and 8637 transitions. [2018-12-02 03:25:10,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-02 03:25:10,685 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 477 [2018-12-02 03:25:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:10,692 INFO L225 Difference]: With dead ends: 7057 [2018-12-02 03:25:10,692 INFO L226 Difference]: Without dead ends: 3656 [2018-12-02 03:25:10,698 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 534 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6494 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1572, Invalid=17060, Unknown=0, NotChecked=0, Total=18632 [2018-12-02 03:25:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2018-12-02 03:25:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3629. [2018-12-02 03:25:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2018-12-02 03:25:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4422 transitions. [2018-12-02 03:25:10,918 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 4422 transitions. Word has length 477 [2018-12-02 03:25:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:10,918 INFO L480 AbstractCegarLoop]: Abstraction has 3629 states and 4422 transitions. [2018-12-02 03:25:10,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-02 03:25:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 4422 transitions. [2018-12-02 03:25:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-12-02 03:25:10,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:10,924 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-02 03:25:10,925 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:10,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 535708336, now seen corresponding path program 1 times [2018-12-02 03:25:10,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:10,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-12-02 03:25:11,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:11,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:11,045 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 495 with the following transitions: [2018-12-02 03:25:11,045 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [277], [282], [287], [292], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [455], [459], [465], [468], [472], [475], [481], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:25:11,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:11,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:11,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:11,291 INFO L272 AbstractInterpreter]: Visited 163 different actions 855 times. Merged at 42 different actions 105 times. Never widened. Performed 10632 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10632 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 22 fixpoints after 14 different actions. Largest state had 54 variables. [2018-12-02 03:25:11,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:11,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:11,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:11,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:25:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:11,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:11,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-02 03:25:11,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2018-12-02 03:25:11,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:11,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2018-12-02 03:25:11,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:11,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:25:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:25:11,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:25:11,731 INFO L87 Difference]: Start difference. First operand 3629 states and 4422 transitions. Second operand 3 states. [2018-12-02 03:25:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:12,062 INFO L93 Difference]: Finished difference Result 9843 states and 12475 transitions. [2018-12-02 03:25:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:25:12,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 494 [2018-12-02 03:25:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:12,078 INFO L225 Difference]: With dead ends: 9843 [2018-12-02 03:25:12,078 INFO L226 Difference]: Without dead ends: 6442 [2018-12-02 03:25:12,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 988 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:25:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2018-12-02 03:25:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 6439. [2018-12-02 03:25:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6439 states. [2018-12-02 03:25:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 8084 transitions. [2018-12-02 03:25:12,418 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 8084 transitions. Word has length 494 [2018-12-02 03:25:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:12,419 INFO L480 AbstractCegarLoop]: Abstraction has 6439 states and 8084 transitions. [2018-12-02 03:25:12,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:25:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 8084 transitions. [2018-12-02 03:25:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-12-02 03:25:12,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:12,425 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:12,425 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:12,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:12,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1511047778, now seen corresponding path program 1 times [2018-12-02 03:25:12,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:12,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:12,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 65 proven. 80 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-12-02 03:25:12,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:12,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:12,534 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 493 with the following transitions: [2018-12-02 03:25:12,534 INFO L205 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [277], [280], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [455], [459], [462], [465], [468], [472], [475], [481], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:25:12,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:12,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:12,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:12,692 INFO L272 AbstractInterpreter]: Visited 166 different actions 596 times. Merged at 39 different actions 56 times. Never widened. Performed 6808 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 17 fixpoints after 13 different actions. Largest state had 54 variables. [2018-12-02 03:25:12,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:12,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:12,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:12,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:25:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:12,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:12,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2018-12-02 03:25:12,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-12-02 03:25:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2018-12-02 03:25:13,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:13,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:25:13,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:25:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:13,153 INFO L87 Difference]: Start difference. First operand 6439 states and 8084 transitions. Second operand 3 states. [2018-12-02 03:25:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:13,541 INFO L93 Difference]: Finished difference Result 13485 states and 17835 transitions. [2018-12-02 03:25:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:25:13,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2018-12-02 03:25:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:13,556 INFO L225 Difference]: With dead ends: 13485 [2018-12-02 03:25:13,556 INFO L226 Difference]: Without dead ends: 7372 [2018-12-02 03:25:13,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7372 states. [2018-12-02 03:25:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7372 to 7366. [2018-12-02 03:25:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7366 states. [2018-12-02 03:25:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7366 states to 7366 states and 9193 transitions. [2018-12-02 03:25:13,983 INFO L78 Accepts]: Start accepts. Automaton has 7366 states and 9193 transitions. Word has length 492 [2018-12-02 03:25:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:13,983 INFO L480 AbstractCegarLoop]: Abstraction has 7366 states and 9193 transitions. [2018-12-02 03:25:13,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:25:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 7366 states and 9193 transitions. [2018-12-02 03:25:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-12-02 03:25:13,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:13,991 INFO L402 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:13,991 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:13,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1451074222, now seen corresponding path program 1 times [2018-12-02 03:25:13,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:13,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 03:25:14,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:14,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:14,054 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-12-02 03:25:14,054 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [452], [459], [465], [468], [472], [475], [485], [488], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:25:14,055 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:14,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:14,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:14,175 INFO L272 AbstractInterpreter]: Visited 153 different actions 437 times. Merged at 25 different actions 34 times. Never widened. Performed 5424 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5424 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 54 variables. [2018-12-02 03:25:14,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:14,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:14,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:14,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:25:14,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:14,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:14,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-02 03:25:14,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 03:25:14,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2018-12-02 03:25:14,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:14,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:25:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:25:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:14,518 INFO L87 Difference]: Start difference. First operand 7366 states and 9193 transitions. Second operand 4 states. [2018-12-02 03:25:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:15,211 INFO L93 Difference]: Finished difference Result 15837 states and 21663 transitions. [2018-12-02 03:25:15,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:25:15,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2018-12-02 03:25:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:15,237 INFO L225 Difference]: With dead ends: 15837 [2018-12-02 03:25:15,237 INFO L226 Difference]: Without dead ends: 8901 [2018-12-02 03:25:15,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 601 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:25:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8901 states. [2018-12-02 03:25:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8901 to 8622. [2018-12-02 03:25:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8622 states. [2018-12-02 03:25:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8622 states to 8622 states and 10839 transitions. [2018-12-02 03:25:15,763 INFO L78 Accepts]: Start accepts. Automaton has 8622 states and 10839 transitions. Word has length 307 [2018-12-02 03:25:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:15,763 INFO L480 AbstractCegarLoop]: Abstraction has 8622 states and 10839 transitions. [2018-12-02 03:25:15,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:25:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8622 states and 10839 transitions. [2018-12-02 03:25:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-02 03:25:15,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:15,769 INFO L402 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:15,769 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:15,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1120816703, now seen corresponding path program 1 times [2018-12-02 03:25:15,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:15,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:15,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:15,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 41 proven. 41 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 03:25:15,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:15,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:15,825 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-12-02 03:25:15,825 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [259], [262], [265], [267], [269], [271], [272], [275], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [452], [459], [465], [468], [472], [475], [478], [485], [488], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:25:15,826 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:15,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:15,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:15,973 INFO L272 AbstractInterpreter]: Visited 148 different actions 499 times. Merged at 43 different actions 86 times. Never widened. Performed 6395 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6395 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 6 different actions. Largest state had 54 variables. [2018-12-02 03:25:15,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:15,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:15,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:15,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:25:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:15,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:16,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 155 proven. 80 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 03:25:16,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-12-02 03:25:16,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:16,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 8 [2018-12-02 03:25:16,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:16,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:25:16,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:25:16,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:16,288 INFO L87 Difference]: Start difference. First operand 8622 states and 10839 transitions. Second operand 5 states. [2018-12-02 03:25:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:17,116 INFO L93 Difference]: Finished difference Result 15762 states and 20212 transitions. [2018-12-02 03:25:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:25:17,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2018-12-02 03:25:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:17,136 INFO L225 Difference]: With dead ends: 15762 [2018-12-02 03:25:17,136 INFO L226 Difference]: Without dead ends: 9393 [2018-12-02 03:25:17,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 605 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9393 states. [2018-12-02 03:25:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9393 to 9326. [2018-12-02 03:25:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9326 states. [2018-12-02 03:25:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9326 states to 9326 states and 11889 transitions. [2018-12-02 03:25:17,725 INFO L78 Accepts]: Start accepts. Automaton has 9326 states and 11889 transitions. Word has length 303 [2018-12-02 03:25:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:17,725 INFO L480 AbstractCegarLoop]: Abstraction has 9326 states and 11889 transitions. [2018-12-02 03:25:17,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:25:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9326 states and 11889 transitions. [2018-12-02 03:25:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-12-02 03:25:17,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:17,734 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:17,734 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:17,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1395386482, now seen corresponding path program 1 times [2018-12-02 03:25:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:17,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:17,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:17,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:17,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 65 proven. 80 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2018-12-02 03:25:17,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:17,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:17,838 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 497 with the following transitions: [2018-12-02 03:25:17,838 INFO L205 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [277], [280], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [455], [459], [462], [465], [468], [472], [475], [481], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:25:17,840 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:17,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:18,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:18,053 INFO L272 AbstractInterpreter]: Visited 169 different actions 680 times. Merged at 56 different actions 97 times. Never widened. Performed 7227 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7227 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 26 fixpoints after 16 different actions. Largest state had 54 variables. [2018-12-02 03:25:18,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:18,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:18,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:18,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:25:18,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:18,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:18,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-12-02 03:25:18,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 73 proven. 62 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2018-12-02 03:25:18,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:18,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 7 [2018-12-02 03:25:18,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:18,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:25:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:25:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:25:18,489 INFO L87 Difference]: Start difference. First operand 9326 states and 11889 transitions. Second operand 3 states. [2018-12-02 03:25:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:19,123 INFO L93 Difference]: Finished difference Result 19351 states and 26116 transitions. [2018-12-02 03:25:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:25:19,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2018-12-02 03:25:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:19,143 INFO L225 Difference]: With dead ends: 19351 [2018-12-02 03:25:19,143 INFO L226 Difference]: Without dead ends: 10286 [2018-12-02 03:25:19,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 990 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:25:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2018-12-02 03:25:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10221. [2018-12-02 03:25:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10221 states. [2018-12-02 03:25:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10221 states to 10221 states and 12635 transitions. [2018-12-02 03:25:19,834 INFO L78 Accepts]: Start accepts. Automaton has 10221 states and 12635 transitions. Word has length 496 [2018-12-02 03:25:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:19,834 INFO L480 AbstractCegarLoop]: Abstraction has 10221 states and 12635 transitions. [2018-12-02 03:25:19,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:25:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 10221 states and 12635 transitions. [2018-12-02 03:25:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-12-02 03:25:19,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:19,843 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:19,844 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:19,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:19,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1717157727, now seen corresponding path program 1 times [2018-12-02 03:25:19,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:19,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:19,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2018-12-02 03:25:19,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:19,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:19,944 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 507 with the following transitions: [2018-12-02 03:25:19,944 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [249], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [277], [280], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [348], [351], [353], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [455], [459], [462], [468], [472], [475], [481], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:25:19,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:19,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:20,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:20,137 INFO L272 AbstractInterpreter]: Visited 182 different actions 793 times. Merged at 60 different actions 127 times. Never widened. Performed 7774 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7774 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 39 fixpoints after 21 different actions. Largest state had 54 variables. [2018-12-02 03:25:20,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:20,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:20,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:20,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/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 [2018-12-02 03:25:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:20,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:20,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-12-02 03:25:20,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-12-02 03:25:20,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:20,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-12-02 03:25:20,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:20,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:25:20,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:25:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:25:20,546 INFO L87 Difference]: Start difference. First operand 10221 states and 12635 transitions. Second operand 3 states. [2018-12-02 03:25:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:21,102 INFO L93 Difference]: Finished difference Result 18121 states and 22739 transitions. [2018-12-02 03:25:21,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:25:21,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2018-12-02 03:25:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:21,117 INFO L225 Difference]: With dead ends: 18121 [2018-12-02 03:25:21,117 INFO L226 Difference]: Without dead ends: 8589 [2018-12-02 03:25:21,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:25:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2018-12-02 03:25:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 8455. [2018-12-02 03:25:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8455 states. [2018-12-02 03:25:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 10222 transitions. [2018-12-02 03:25:21,633 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 10222 transitions. Word has length 506 [2018-12-02 03:25:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:21,633 INFO L480 AbstractCegarLoop]: Abstraction has 8455 states and 10222 transitions. [2018-12-02 03:25:21,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:25:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 10222 transitions. [2018-12-02 03:25:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-12-02 03:25:21,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:21,639 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:21,639 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:21,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1473448664, now seen corresponding path program 1 times [2018-12-02 03:25:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:21,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:21,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:21,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:21,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 22 proven. 103 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-12-02 03:25:21,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:21,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:21,709 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2018-12-02 03:25:21,709 INFO L205 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [249], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [348], [351], [353], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [452], [459], [462], [465], [472], [475], [485], [488], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:25:21,710 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:21,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:21,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:21,876 INFO L272 AbstractInterpreter]: Visited 164 different actions 620 times. Merged at 52 different actions 106 times. Never widened. Performed 6615 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6615 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 15 fixpoints after 9 different actions. Largest state had 54 variables. [2018-12-02 03:25:21,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:21,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:21,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:21,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:25:21,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:21,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:21,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-12-02 03:25:22,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 35 proven. 48 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2018-12-02 03:25:22,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:22,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-12-02 03:25:22,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:22,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:25:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:25:22,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:25:22,232 INFO L87 Difference]: Start difference. First operand 8455 states and 10222 transitions. Second operand 3 states. [2018-12-02 03:25:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:22,795 INFO L93 Difference]: Finished difference Result 15644 states and 18992 transitions. [2018-12-02 03:25:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:25:22,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2018-12-02 03:25:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:22,808 INFO L225 Difference]: With dead ends: 15644 [2018-12-02 03:25:22,809 INFO L226 Difference]: Without dead ends: 8455 [2018-12-02 03:25:22,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 727 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:25:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8455 states. [2018-12-02 03:25:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8455 to 8455. [2018-12-02 03:25:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8455 states. [2018-12-02 03:25:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 10164 transitions. [2018-12-02 03:25:23,317 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 10164 transitions. Word has length 368 [2018-12-02 03:25:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:23,317 INFO L480 AbstractCegarLoop]: Abstraction has 8455 states and 10164 transitions. [2018-12-02 03:25:23,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:25:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 10164 transitions. [2018-12-02 03:25:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-12-02 03:25:23,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:23,323 INFO L402 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-02 03:25:23,323 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:23,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2124169190, now seen corresponding path program 1 times [2018-12-02 03:25:23,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:23,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:23,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-12-02 03:25:23,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:23,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:23,394 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 373 with the following transitions: [2018-12-02 03:25:23,394 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [277], [280], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [348], [353], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [446], [449], [455], [459], [462], [472], [475], [485], [488], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2018-12-02 03:25:23,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:23,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:23,444 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 03:25:23,444 INFO L272 AbstractInterpreter]: Visited 149 different actions 202 times. Merged at 2 different actions 2 times. Never widened. Performed 1627 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 54 variables. [2018-12-02 03:25:23,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:23,446 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 03:25:23,577 INFO L227 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 74.33% of their original sizes. [2018-12-02 03:25:23,578 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 03:25:25,120 INFO L418 sIntCurrentIteration]: We unified 371 AI predicates to 371 [2018-12-02 03:25:25,120 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 03:25:25,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:25:25,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [85] imperfect sequences [5] total 88 [2018-12-02 03:25:25,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:25,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-02 03:25:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-02 03:25:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=6615, Unknown=0, NotChecked=0, Total=7140 [2018-12-02 03:25:25,123 INFO L87 Difference]: Start difference. First operand 8455 states and 10164 transitions. Second operand 85 states. [2018-12-02 03:25:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:42,202 INFO L93 Difference]: Finished difference Result 14723 states and 17809 transitions. [2018-12-02 03:25:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-02 03:25:42,202 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 372 [2018-12-02 03:25:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:42,215 INFO L225 Difference]: With dead ends: 14723 [2018-12-02 03:25:42,215 INFO L226 Difference]: Without dead ends: 8497 [2018-12-02 03:25:42,223 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 428 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6888 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1605, Invalid=18417, Unknown=0, NotChecked=0, Total=20022 [2018-12-02 03:25:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8497 states. [2018-12-02 03:25:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8497 to 8474. [2018-12-02 03:25:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8474 states. [2018-12-02 03:25:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8474 states to 8474 states and 10185 transitions. [2018-12-02 03:25:42,739 INFO L78 Accepts]: Start accepts. Automaton has 8474 states and 10185 transitions. Word has length 372 [2018-12-02 03:25:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:42,739 INFO L480 AbstractCegarLoop]: Abstraction has 8474 states and 10185 transitions. [2018-12-02 03:25:42,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-02 03:25:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8474 states and 10185 transitions. [2018-12-02 03:25:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-12-02 03:25:42,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:42,745 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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] [2018-12-02 03:25:42,745 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:42,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -149854649, now seen corresponding path program 1 times [2018-12-02 03:25:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:42,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:42,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 57 proven. 9 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-12-02 03:25:42,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:42,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:42,907 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 552 with the following transitions: [2018-12-02 03:25:42,907 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [249], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [348], [351], [353], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [459], [462], [472], [475], [478], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:25:42,908 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:42,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:43,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:43,399 INFO L272 AbstractInterpreter]: Visited 178 different actions 1824 times. Merged at 70 different actions 388 times. Never widened. Performed 18095 root evaluator evaluations with a maximum evaluation depth of 3. Performed 18095 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 84 fixpoints after 20 different actions. Largest state had 54 variables. [2018-12-02 03:25:43,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:43,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:43,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:43,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:25:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:43,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:43,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2018-12-02 03:25:43,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 57 proven. 9 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-12-02 03:25:43,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:43,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-02 03:25:43,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:43,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:25:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:25:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:43,867 INFO L87 Difference]: Start difference. First operand 8474 states and 10185 transitions. Second operand 4 states. [2018-12-02 03:25:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:44,336 INFO L93 Difference]: Finished difference Result 11552 states and 13809 transitions. [2018-12-02 03:25:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:25:44,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 551 [2018-12-02 03:25:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:44,341 INFO L225 Difference]: With dead ends: 11552 [2018-12-02 03:25:44,342 INFO L226 Difference]: Without dead ends: 2241 [2018-12-02 03:25:44,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1108 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:25:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-12-02 03:25:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2205. [2018-12-02 03:25:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2018-12-02 03:25:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2422 transitions. [2018-12-02 03:25:44,488 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2422 transitions. Word has length 551 [2018-12-02 03:25:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:44,488 INFO L480 AbstractCegarLoop]: Abstraction has 2205 states and 2422 transitions. [2018-12-02 03:25:44,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:25:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2422 transitions. [2018-12-02 03:25:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-12-02 03:25:44,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:44,491 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:25:44,491 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:44,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:44,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1738282577, now seen corresponding path program 1 times [2018-12-02 03:25:44,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:44,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:44,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 55 proven. 38 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2018-12-02 03:25:44,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:44,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:25:44,615 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 502 with the following transitions: [2018-12-02 03:25:44,615 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [236], [238], [241], [243], [246], [249], [251], [254], [257], [259], [262], [265], [267], [269], [271], [272], [275], [277], [280], [282], [287], [292], [294], [295], [300], [306], [312], [318], [324], [330], [336], [342], [344], [345], [348], [351], [353], [355], [357], [359], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [434], [437], [440], [442], [446], [449], [452], [455], [459], [462], [468], [472], [475], [481], [485], [488], [494], [499], [500], [503], [506], [508], [510], [512], [514], [515], [516], [530], [532], [534], [536], [541], [549], [552], [557], [562], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2018-12-02 03:25:44,616 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:25:44,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:25:46,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:25:46,201 INFO L272 AbstractInterpreter]: Visited 212 different actions 6568 times. Merged at 94 different actions 1316 times. Widened at 1 different actions 1 times. Performed 55556 root evaluator evaluations with a maximum evaluation depth of 3. Performed 55556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 431 fixpoints after 32 different actions. Largest state had 54 variables. [2018-12-02 03:25:46,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:46,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:25:46,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:25:46,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:25:46,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:46,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:25:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:46,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:25:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-02 03:25:46,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:25:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 55 proven. 38 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2018-12-02 03:25:46,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:25:46,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-12-02 03:25:46,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:46,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:25:46,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:25:46,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:25:46,589 INFO L87 Difference]: Start difference. First operand 2205 states and 2422 transitions. Second operand 3 states. [2018-12-02 03:25:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:46,707 INFO L93 Difference]: Finished difference Result 3687 states and 4064 transitions. [2018-12-02 03:25:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:25:46,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2018-12-02 03:25:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:46,710 INFO L225 Difference]: With dead ends: 3687 [2018-12-02 03:25:46,710 INFO L226 Difference]: Without dead ends: 1683 [2018-12-02 03:25:46,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 1001 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:25:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-12-02 03:25:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1663. [2018-12-02 03:25:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2018-12-02 03:25:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 1789 transitions. [2018-12-02 03:25:46,826 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 1789 transitions. Word has length 501 [2018-12-02 03:25:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:46,827 INFO L480 AbstractCegarLoop]: Abstraction has 1663 states and 1789 transitions. [2018-12-02 03:25:46,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:25:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1789 transitions. [2018-12-02 03:25:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-12-02 03:25:46,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:25:46,828 INFO L402 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] [2018-12-02 03:25:46,828 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:25:46,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:25:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash 520698818, now seen corresponding path program 1 times [2018-12-02 03:25:46,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:25:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:46,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:25:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:25:46,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:25:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:25:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2018-12-02 03:25:47,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:25:47,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:25:47,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:25:47,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:25:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:25:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:25:47,028 INFO L87 Difference]: Start difference. First operand 1663 states and 1789 transitions. Second operand 8 states. [2018-12-02 03:25:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:25:47,992 INFO L93 Difference]: Finished difference Result 1671 states and 1798 transitions. [2018-12-02 03:25:47,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 03:25:47,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 374 [2018-12-02 03:25:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:25:47,993 INFO L225 Difference]: With dead ends: 1671 [2018-12-02 03:25:47,993 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 03:25:47,995 INFO L631 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 [2018-12-02 03:25:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 03:25:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 03:25:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 03:25:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 03:25:47,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 374 [2018-12-02 03:25:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:25:47,996 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:25:47,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:25:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 03:25:47,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 03:25:47,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 03:25:49,190 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 224 [2018-12-02 03:25:50,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:54,956 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 224 [2018-12-02 03:25:55,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:55,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:55,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:56,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:57,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:58,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:25:59,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:00,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:01,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:02,062 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 218 [2018-12-02 03:26:04,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:04,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:05,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 03:26:07,102 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 1 [2018-12-02 03:26:07,707 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 170 [2018-12-02 03:26:14,511 WARN L180 SmtUtils]: Spent 6.80 s on a formula simplification. DAG size of input: 399 DAG size of output: 283 [2018-12-02 03:26:15,157 WARN L180 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 188 [2018-12-02 03:26:18,529 WARN L180 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 248 DAG size of output: 183 [2018-12-02 03:26:19,222 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 162 [2018-12-02 03:26:25,233 WARN L180 SmtUtils]: Spent 6.00 s on a formula simplification. DAG size of input: 306 DAG size of output: 162 [2018-12-02 03:26:31,503 WARN L180 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 334 DAG size of output: 174 [2018-12-02 03:26:32,481 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 158 [2018-12-02 03:26:35,656 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 307 DAG size of output: 229 [2018-12-02 03:26:35,842 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 108 [2018-12-02 03:26:36,742 WARN L180 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 140 [2018-12-02 03:26:37,121 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 1 [2018-12-02 03:26:39,622 WARN L180 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 253 DAG size of output: 173 [2018-12-02 03:26:42,315 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 275 DAG size of output: 140 [2018-12-02 03:26:43,609 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 266 DAG size of output: 170 [2018-12-02 03:26:48,689 WARN L180 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 318 DAG size of output: 237 [2018-12-02 03:26:55,138 WARN L180 SmtUtils]: Spent 6.45 s on a formula simplification. DAG size of input: 399 DAG size of output: 283 [2018-12-02 03:26:56,746 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 211 DAG size of output: 170 [2018-12-02 03:26:58,285 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 201 DAG size of output: 140 [2018-12-02 03:27:07,914 WARN L180 SmtUtils]: Spent 9.50 s on a formula simplification. DAG size of input: 323 DAG size of output: 222 [2018-12-02 03:27:08,139 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 108 [2018-12-02 03:27:13,318 WARN L180 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 313 DAG size of output: 188 [2018-12-02 03:27:13,492 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 80 [2018-12-02 03:27:14,926 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 289 DAG size of output: 215 [2018-12-02 03:27:23,232 WARN L180 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 323 DAG size of output: 217 [2018-12-02 03:27:24,483 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 235 DAG size of output: 147 [2018-12-02 03:27:29,652 WARN L180 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 316 DAG size of output: 160 [2018-12-02 03:27:32,252 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 256 DAG size of output: 181 [2018-12-02 03:27:34,273 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 224 DAG size of output: 158 [2018-12-02 03:27:37,571 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 240 DAG size of output: 164 [2018-12-02 03:27:38,615 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 312 DAG size of output: 166 [2018-12-02 03:27:39,939 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 209 DAG size of output: 146 [2018-12-02 03:27:43,433 WARN L180 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 333 DAG size of output: 162 [2018-12-02 03:27:43,796 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 1 [2018-12-02 03:27:46,722 WARN L180 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 230 DAG size of output: 160 [2018-12-02 03:27:46,907 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 108 [2018-12-02 03:27:47,070 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 95 [2018-12-02 03:27:48,463 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 209 DAG size of output: 157 [2018-12-02 03:27:52,651 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 256 DAG size of output: 196 [2018-12-02 03:27:52,822 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-12-02 03:27:53,097 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 108 [2018-12-02 03:27:53,262 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 95 [2018-12-02 03:27:54,426 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 255 DAG size of output: 146 [2018-12-02 03:28:04,570 WARN L180 SmtUtils]: Spent 10.14 s on a formula simplification. DAG size of input: 326 DAG size of output: 225 [2018-12-02 03:28:06,768 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 201 DAG size of output: 144 [2018-12-02 03:28:07,105 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 104 [2018-12-02 03:28:08,349 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 251 DAG size of output: 162 [2018-12-02 03:28:09,434 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 266 DAG size of output: 170 [2018-12-02 03:28:11,227 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 224 DAG size of output: 154 [2018-12-02 03:28:12,490 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 312 DAG size of output: 166 [2018-12-02 03:28:12,695 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 1 [2018-12-02 03:28:14,684 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 256 DAG size of output: 192 [2018-12-02 03:28:16,989 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 206 DAG size of output: 134 [2018-12-02 03:28:20,912 WARN L180 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 299 DAG size of output: 234 [2018-12-02 03:28:21,936 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 162 DAG size of output: 91 [2018-12-02 03:28:23,230 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 211 DAG size of output: 153 [2018-12-02 03:28:27,104 WARN L180 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 295 DAG size of output: 220 [2018-12-02 03:28:28,474 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 266 DAG size of output: 170 [2018-12-02 03:28:28,744 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 1 [2018-12-02 03:28:34,806 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 313 DAG size of output: 188 [2018-12-02 03:28:34,977 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 1 [2018-12-02 03:28:38,233 WARN L180 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 241 DAG size of output: 169 [2018-12-02 03:28:39,203 WARN L180 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 170 [2018-12-02 03:28:41,731 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 314 DAG size of output: 242 [2018-12-02 03:28:42,539 WARN L180 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 77 [2018-12-02 03:28:43,860 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 209 DAG size of output: 149 [2018-12-02 03:28:44,811 WARN L180 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2018-12-02 03:28:46,483 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 289 DAG size of output: 188 [2018-12-02 03:28:46,846 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 108 [2018-12-02 03:28:47,135 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 108 [2018-12-02 03:28:50,494 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 232 DAG size of output: 160 [2018-12-02 03:28:50,497 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-02 03:28:50,498 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 86 121) the Hoare annotation is: (let ((.cse52 (= 1 ~m_pc~0)) (.cse46 (= 1 ~t3_pc~0)) (.cse51 (= 0 |old(~m_st~0)|)) (.cse54 (= 0 ~m_st~0)) (.cse53 (= ~token~0 0)) (.cse55 (= 1 ~t1_pc~0)) (.cse27 (= 0 ~t2_st~0)) (.cse23 (<= ~t1_pc~0 0)) (.cse24 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse25 (= ~m_st~0 2)) (.cse26 (= |old(~E_2~0)| ~E_2~0)) (.cse56 (<= 2 ~t2_st~0)) (.cse28 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse40 (= ~t3_st~0 0)) (.cse41 (= ~t2_st~0 0)) (.cse42 (= ~E_2~0 2)) (.cse34 (not (= 2 |old(~E_2~0)|))) (.cse37 (not (= 0 |old(~t3_st~0)|))) (.cse38 (not (= 0 ~t3_pc~0))) (.cse39 (not (= 2 ~E_M~0))) (.cse44 (not (= 2 ~E_1~0))) (.cse47 (and .cse23 .cse24 .cse25 .cse26 .cse56 .cse28)) (.cse33 (and .cse55 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse21 (< 0 ~t2_pc~0)) (.cse16 (and .cse23 .cse24 .cse26 .cse56 .cse54 .cse53 .cse28)) (.cse8 (or (not (= |old(~token~0)| 0)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)))) (.cse15 (not .cse51)) (.cse20 (< 0 |old(~t1_pc~0)|)) (.cse35 (not (= |old(~t1_pc~0)| 0))) (.cse36 (not (= 2 ~E_3~0))) (.cse45 (not (= 0 ~t2_pc~0))) (.cse29 (not .cse46)) (.cse43 (= ~t1_pc~0 0)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse22 (not (= 2 |old(~m_st~0)|))) (.cse48 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 ~E_1~0)) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (= 0 ~E_3~0)) (.cse49 (< |old(~token~0)| ~local~0)) (.cse32 (not (= |old(~t1_pc~0)| 1))) (.cse50 (and .cse55 .cse24 (= ~token~0 |old(~token~0)|) .cse25 .cse26 .cse56 .cse28)) (.cse11 (< |old(~t3_st~0)| 2)) (.cse12 (= 1 ~E_M~0)) (.cse13 (not (= 1 ~t2_pc~0))) (.cse14 (= ~T1_E~0 1)) (.cse31 (not .cse52)) (.cse17 (= 0 ~E_1~0)) (.cse18 (< |old(~E_2~0)| 2)) (.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 .cse0 .cse1 .cse21 .cse10 .cse22 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse2 .cse11 .cse29 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse10 .cse22 .cse32 .cse2 .cse33 .cse11 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse30 .cse31 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse34 .cse22 .cse2 .cse3 .cse4 .cse5 .cse35 .cse36 .cse37 .cse38 .cse39 .cse14 (and .cse25 .cse40 .cse41 .cse42 .cse43 .cse28) .cse30 .cse31 .cse44 .cse45) (or .cse0 .cse9 .cse1 .cse10 .cse22 .cse2 .cse46 .cse3 .cse47 .cse4 .cse5 .cse12 .cse13 .cse14 .cse6 .cse7 .cse31 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse22 .cse48 .cse2 .cse3 .cse46 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse49 .cse32 .cse12 .cse13 .cse14 .cse50 .cse31 .cse17 .cse18 .cse19) (or (and (= ~m_st~0 |old(~m_st~0)|) .cse26) .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse17 .cse19 (= 0 |old(~E_2~0)|) .cse51 .cse52) (or (and .cse28 (= ~m_st~0 0) .cse40 .cse41 .cse53 .cse42 .cse43) .cse36 (not (= 1 ~t1_i~0)) .cse8 (or (not (= ~T2_E~0 2)) .cse34 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse37 .cse35) .cse38 .cse39 .cse15 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse30 .cse44 (not (= 1 ~t2_i~0)) .cse45 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse47 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse10 .cse22 .cse32 .cse2 .cse46 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse33 .cse7 .cse30 .cse31 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse21 (and .cse23 .cse24 .cse26 .cse27 .cse54 .cse53 .cse28) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse14 .cse15 .cse30 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse46 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 (or .cse35 (not (= 2 |old(~t3_st~0)|)) .cse36 .cse45) .cse22 .cse2 .cse3 .cse4 .cse5 .cse7 .cse29 (and (= ~t3_st~0 2) .cse43) .cse12 .cse14 .cse30 .cse31 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse22 .cse48 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse49 .cse32 .cse50 .cse11 .cse12 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19)))) [2018-12-02 03:28:50,498 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-02 03:28:50,498 INFO L444 ceAbstractionStarter]: At program point L94(lines 89 120) the Hoare annotation is: (let ((.cse40 (= 1 ~m_pc~0)) (.cse39 (= 0 |old(~m_st~0)|)) (.cse21 (= 1 ~t3_pc~0)) (.cse42 (= 1 ~t1_pc~0)) (.cse43 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse44 (= ~m_st~0 2)) (.cse38 (= |old(~E_2~0)| ~E_2~0)) (.cse45 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse28 (not (= 2 |old(~E_2~0)|))) (.cse30 (not (= |old(~t1_pc~0)| 0))) (.cse27 (not (= 2 ~E_3~0))) (.cse29 (not (= 0 |old(~t3_st~0)|))) (.cse31 (not (= 0 ~t3_pc~0))) (.cse32 (not (= 2 ~E_M~0))) (.cse33 (not (= 2 ~E_1~0))) (.cse34 (not (= 0 ~t2_pc~0))) (.cse25 (and .cse42 .cse43 .cse44 .cse38 (= 0 ~t2_st~0) .cse45)) (.cse23 (< 0 ~t2_pc~0)) (.cse8 (or (not (= |old(~token~0)| 0)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)))) (.cse41 (not .cse21)) (.cse15 (not .cse39)) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse19 (< 0 |old(~t1_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse20 (not (= 2 |old(~m_st~0)|))) (.cse35 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 ~E_1~0)) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (= 0 ~E_3~0)) (.cse36 (< |old(~token~0)| ~local~0)) (.cse24 (not (= |old(~t1_pc~0)| 1))) (.cse37 (and .cse42 .cse43 (= ~token~0 |old(~token~0)|) .cse44 .cse38 (<= 2 ~t2_st~0) .cse45)) (.cse11 (< |old(~t3_st~0)| 2)) (.cse12 (= 1 ~E_M~0)) (.cse13 (not (= 1 ~t2_pc~0))) (.cse14 (= ~T1_E~0 1)) (.cse22 (not .cse40)) (.cse16 (= 0 ~E_1~0)) (.cse17 (< |old(~E_2~0)| 2)) (.cse18 (= 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) (or .cse0 .cse9 .cse1 .cse10 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5 .cse12 .cse13 .cse14 .cse6 .cse7 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse23 .cse10 .cse20 .cse24 .cse2 .cse25 .cse11 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse26 .cse22 .cse16 .cse17 .cse18) (or .cse27 (not (= 1 ~t1_i~0)) .cse8 (or (not (= ~T2_E~0 2)) .cse28 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse29 .cse30) .cse31 .cse32 .cse15 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse26 .cse33 (not (= 1 ~t2_i~0)) .cse34 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse20 .cse35 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse36 .cse24 .cse12 .cse13 .cse14 .cse37 .cse22 .cse16 .cse17 .cse18) (or (and (= ~m_st~0 |old(~m_st~0)|) .cse38) .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse16 .cse18 (= 0 |old(~E_2~0)|) .cse39 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse9 .cse1 .cse10 .cse20 .cse2 .cse11 .cse3 .cse4 .cse5 .cse12 .cse13 .cse14 .cse6 .cse7 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse28 .cse20 .cse2 .cse3 .cse4 .cse5 .cse30 .cse27 .cse29 .cse31 .cse32 .cse14 .cse26 .cse22 .cse33 .cse34) (or .cse0 .cse1 .cse23 .cse10 .cse20 .cse2 .cse11 .cse41 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse26 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse23 .cse10 .cse20 .cse24 .cse2 .cse21 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse25 .cse7 .cse26 .cse22 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse41 .cse11 .cse12 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse35 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse36 .cse24 .cse37 .cse11 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse18)))) [2018-12-02 03:28:50,499 INFO L444 ceAbstractionStarter]: At program point L115(lines 86 121) the Hoare annotation is: (let ((.cse42 (= 1 ~m_pc~0)) (.cse41 (= 0 |old(~m_st~0)|)) (.cse26 (= 0 ~m_st~0)) (.cse27 (= ~token~0 0)) (.cse28 (<= |old(~E_2~0)| ~E_2~0)) (.cse57 (<= 2 ~t2_st~0)) (.cse22 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse58 (<= 2 ~E_2~0)) (.cse24 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= ~m_st~0 2)) (.cse25 (= 0 ~t2_st~0)) (.cse38 (= 1 ~t3_pc~0))) (let ((.cse29 (not .cse38)) (.cse36 (< ~local~0 |old(~token~0)|)) (.cse39 (and .cse22 .cse23 (<= ~token~0 (+ |old(~token~0)| 1)) .cse58 .cse24 .cse35 .cse25 (<= (+ ~local~0 1) ~token~0))) (.cse37 (and .cse22 .cse23 .cse58 .cse24 .cse35 .cse57)) (.cse40 (< |old(~token~0)| ~local~0)) (.cse8 (and .cse22 .cse23 .cse24 .cse57 .cse26 .cse27 .cse28)) (.cse12 (< |old(~t3_st~0)| 2)) (.cse46 (not (= 2 ~E_3~0))) (.cse49 (= ~t1_pc~0 1)) (.cse50 (= ~t1_st~0 2)) (.cse51 (= ~t3_st~0 0)) (.cse52 (= ~t2_st~0 0)) (.cse53 (= ~E_2~0 2)) (.cse9 (or (not (= |old(~token~0)| 0)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)))) (.cse44 (not (= 2 |old(~E_2~0)|))) (.cse47 (not (= 0 |old(~t3_st~0)|))) (.cse45 (not (= |old(~t1_pc~0)| 0))) (.cse48 (not (= 0 ~t3_pc~0))) (.cse54 (not (= 2 ~E_M~0))) (.cse16 (not .cse41)) (.cse55 (not (= 2 ~E_1~0))) (.cse56 (not (= 0 ~t2_pc~0))) (.cse21 (< 0 ~t2_pc~0)) (.cse33 (not (= |old(~t1_pc~0)| 1))) (.cse32 (and .cse22 .cse23 .cse58 .cse24 .cse35 .cse25)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse31 (not (= 2 |old(~m_st~0)|))) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse43 (and .cse22 .cse23 .cse24 .cse35 .cse57 .cse28)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 ~E_1~0)) (.cse10 (< |old(~t2_st~0)| 2)) (.cse11 (= 0 ~E_3~0)) (.cse13 (= 1 ~E_M~0)) (.cse14 (not (= 1 ~t2_pc~0))) (.cse15 (= ~T1_E~0 1)) (.cse34 (not .cse42)) (.cse17 (= 0 ~E_1~0)) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (= 0 ~E_M~0)) (.cse20 (< 0 |old(~t1_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) (or .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse29 .cse12 .cse13 .cse15 .cse16 .cse30 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse31 .cse2 .cse3 .cse32 .cse4 .cse5 .cse6 .cse7 .cse11 .cse33 .cse12 .cse13 .cse15 .cse30 .cse34 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse21 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse29 .cse13 .cse15 .cse30 .cse34 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse28) .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse31 .cse36 .cse37 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse39 .cse10 .cse11 .cse40 .cse33 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse31 .cse36 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse39 .cse37 .cse10 .cse11 .cse40 .cse33 .cse12 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse8 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse11 (and (not (= ~E_2~0 0)) (= ~m_st~0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse6 .cse7 .cse17 .cse19 (= 0 |old(~E_2~0)|) .cse41 .cse42) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse43 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse44 .cse31 .cse2 .cse3 .cse4 .cse5 .cse45 .cse46 .cse47 .cse48 (and .cse49 .cse35 .cse50 .cse51 .cse52 .cse53) .cse54 .cse15 .cse30 .cse34 .cse55 .cse56) (or .cse46 (not (= 1 ~t1_i~0)) (and (= ~m_st~0 0) .cse49 .cse50 .cse51 .cse52 .cse27 .cse53) .cse9 (or (not (= ~T2_E~0 2)) .cse44 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse47 .cse45) .cse48 .cse54 .cse16 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse30 .cse55 (not (= 1 ~t2_i~0)) .cse56 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse21 .cse11 .cse31 .cse33 .cse2 .cse38 .cse3 .cse32 .cse4 .cse5 .cse13 .cse15 .cse6 .cse7 .cse30 .cse34 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse31 .cse2 .cse38 .cse3 .cse4 .cse5 .cse43 .cse6 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse19 .cse20)))) [2018-12-02 03:28:50,499 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 86 121) no Hoare annotation was computed. [2018-12-02 03:28:50,499 INFO L444 ceAbstractionStarter]: At program point L111(line 111) the Hoare annotation is: (let ((.cse40 (= 1 ~m_pc~0)) (.cse42 (= 1 ~t1_pc~0)) (.cse43 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse38 (not (= ~E_2~0 0))) (.cse44 (= ~m_st~0 2)) (.cse45 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (= 0 |old(~m_st~0)|)) (.cse21 (= 1 ~t3_pc~0))) (let ((.cse28 (not (= 2 |old(~E_2~0)|))) (.cse30 (not (= |old(~t1_pc~0)| 0))) (.cse27 (not (= 2 ~E_3~0))) (.cse29 (not (= 0 |old(~t3_st~0)|))) (.cse31 (not (= 0 ~t3_pc~0))) (.cse32 (not (= 2 ~E_M~0))) (.cse33 (not (= 2 ~E_1~0))) (.cse34 (not (= 0 ~t2_pc~0))) (.cse8 (or (not (= |old(~token~0)| 0)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)))) (.cse41 (not .cse21)) (.cse15 (not .cse39)) (.cse19 (< 0 |old(~t1_pc~0)|)) (.cse23 (< 0 ~t2_pc~0)) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse26 (and .cse42 .cse43 .cse38 .cse44 (= 0 ~t2_st~0) .cse45)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse20 (not (= 2 |old(~m_st~0)|))) (.cse35 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_3~0)) (.cse7 (= 1 ~E_1~0)) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (= 0 ~E_3~0)) (.cse36 (< |old(~token~0)| ~local~0)) (.cse24 (not (= |old(~t1_pc~0)| 1))) (.cse11 (< |old(~t3_st~0)| 2)) (.cse12 (= 1 ~E_M~0)) (.cse13 (not (= 1 ~t2_pc~0))) (.cse14 (= ~T1_E~0 1)) (.cse22 (not .cse40)) (.cse37 (and .cse42 (<= ~token~0 (+ |old(~token~0)| 1)) .cse43 .cse38 .cse44 (<= 2 ~t2_st~0) (<= (+ ~local~0 1) ~token~0) .cse45)) (.cse16 (= 0 ~E_1~0)) (.cse17 (< |old(~E_2~0)| 2)) (.cse18 (= 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) (or .cse0 .cse9 .cse1 .cse10 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5 .cse12 .cse13 .cse14 .cse6 .cse7 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse23 .cse10 .cse20 .cse24 .cse2 .cse11 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse25 .cse26 .cse22 .cse16 .cse17 .cse18) (or .cse27 (not (= 1 ~t1_i~0)) .cse8 (or (not (= ~T2_E~0 2)) .cse28 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse29 .cse30) .cse31 .cse32 .cse15 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse25 .cse33 (not (= 1 ~t2_i~0)) .cse34 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse20 .cse35 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse36 .cse24 .cse12 .cse13 .cse14 .cse22 .cse37 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse9 .cse1 .cse10 .cse20 .cse2 .cse11 .cse3 .cse4 .cse5 .cse12 .cse13 .cse14 .cse6 .cse7 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 (and .cse38 (= ~m_st~0 |old(~m_st~0)|)) .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse16 .cse18 (= 0 |old(~E_2~0)|) .cse39 .cse40) (or .cse0 .cse1 .cse28 .cse20 .cse2 .cse3 .cse4 .cse5 .cse30 .cse27 .cse29 .cse31 .cse32 .cse14 .cse25 .cse22 .cse33 .cse34) (or .cse0 .cse1 .cse23 .cse10 .cse20 .cse2 .cse11 .cse41 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse25 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse41 .cse11 .cse12 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse23 .cse10 .cse20 .cse24 .cse2 .cse21 .cse3 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7 .cse25 .cse22 .cse16 .cse17 .cse18 .cse26) (or .cse0 .cse1 .cse20 .cse35 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse36 .cse24 .cse11 .cse12 .cse13 .cse14 .cse22 .cse37 .cse16 .cse17 .cse18)))) [2018-12-02 03:28:50,499 INFO L448 ceAbstractionStarter]: For program point L111-1(line 111) no Hoare annotation was computed. [2018-12-02 03:28:50,500 INFO L444 ceAbstractionStarter]: At program point L101-1(lines 89 120) the Hoare annotation is: (let ((.cse54 (= 1 ~m_pc~0)) (.cse56 (= 1 ~t1_pc~0)) (.cse57 (<= 2 ~E_2~0)) (.cse11 (= 0 ~t2_st~0)) (.cse28 (= 1 ~t3_pc~0)) (.cse53 (= 0 |old(~m_st~0)|)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse47 (= ~m_st~0 2)) (.cse31 (<= 2 ~t2_st~0)) (.cse14 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (<= |old(~E_2~0)| ~E_2~0))) (let ((.cse33 (and .cse9 .cse10 .cse47 .cse31 .cse14 .cse15)) (.cse12 (= 0 ~m_st~0)) (.cse48 (= ~t3_st~0 0)) (.cse49 (= ~t2_st~0 0)) (.cse13 (= ~token~0 0)) (.cse50 (= ~E_2~0 2)) (.cse51 (= ~t1_pc~0 0)) (.cse42 (not (= 2 ~E_3~0))) (.cse16 (or (not (= |old(~token~0)| 0)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)))) (.cse40 (not (= 2 |old(~E_2~0)|))) (.cse43 (not (= 0 |old(~t3_st~0)|))) (.cse41 (not (= |old(~t1_pc~0)| 0))) (.cse44 (not (= 0 ~t3_pc~0))) (.cse45 (not (= 2 ~E_M~0))) (.cse22 (not .cse53)) (.cse46 (not (= 2 ~E_1~0))) (.cse52 (not (= 0 ~t2_pc~0))) (.cse18 (not .cse28)) (.cse27 (< 0 |old(~t1_pc~0)|)) (.cse2 (< 0 ~t2_pc~0)) (.cse55 (and .cse56 .cse57 .cse10 .cse47 .cse11 .cse14)) (.cse23 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse32 (not (= 2 |old(~m_st~0)|))) (.cse35 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 1)) (.cse36 (and .cse56 (<= ~token~0 (+ |old(~token~0)| 1)) .cse57 .cse10 .cse47 .cse11 (<= (+ ~local~0 1) ~token~0) .cse14)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse17 (= 0 ~E_3~0)) (.cse37 (< |old(~token~0)| ~local~0)) (.cse38 (not (= |old(~t1_pc~0)| 1))) (.cse19 (< |old(~t3_st~0)| 2)) (.cse20 (= 1 ~E_M~0)) (.cse30 (not (= 1 ~t2_pc~0))) (.cse21 (= ~T1_E~0 1)) (.cse34 (not .cse54)) (.cse24 (= 0 ~E_1~0)) (.cse25 (< |old(~E_2~0)| 2)) (.cse26 (= 0 ~E_M~0)) (.cse39 (and .cse56 .cse57 .cse10 .cse47 .cse31 .cse14))) (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 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse28 .cse5 .cse6 .cse7 .cse8 .cse16 .cse29 .cse17 .cse20 .cse30 .cse21 .cse22 .cse24 (and .cse31 .cse12 .cse9 (<= ~token~0 ~local~0) .cse10 .cse14 (<= ~local~0 ~token~0) .cse15) .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse32 .cse3 .cse4 .cse5 .cse6 .cse7 .cse33 .cse8 .cse29 .cse17 .cse19 .cse20 .cse30 .cse21 .cse34 .cse24 .cse25 .cse26 .cse27) (or .cse33 .cse0 .cse1 .cse32 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse17 .cse20 .cse30 .cse21 .cse34 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse32 .cse35 .cse3 .cse36 .cse4 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse17 .cse37 .cse38 .cse20 .cse30 .cse21 .cse34 .cse39 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse40 .cse32 .cse3 .cse4 .cse5 .cse6 .cse41 .cse42 .cse43 .cse44 .cse45 .cse21 .cse23 .cse34 .cse46 (and .cse47 .cse48 .cse49 .cse50 .cse51 .cse14) .cse52) (or .cse0 .cse1 .cse17 (and (not (= ~E_2~0 0)) (= ~m_st~0 |old(~m_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse24 .cse26 (= 0 |old(~E_2~0)|) .cse53 .cse54) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse29 (and .cse9 .cse10 .cse31 .cse12 .cse13 .cse14 .cse15) .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27) (or (and .cse14 (= ~m_st~0 0) .cse48 .cse49 .cse13 .cse50 .cse51) .cse42 (not (= 1 ~t1_i~0)) .cse16 (or (not (= ~T2_E~0 2)) .cse40 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse43 .cse41) .cse44 .cse45 .cse22 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse23 .cse46 (not (= 1 ~t2_i~0)) .cse52 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse17 .cse32 .cse38 .cse3 .cse28 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse23 .cse34 .cse55 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse32 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse19 .cse18 .cse20 .cse21 .cse23 .cse34 .cse24 (and .cse9 .cse10 .cse47 .cse11 .cse14 .cse15) .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse55 .cse32 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse38 .cse19 .cse20 .cse21 .cse23 .cse34 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse32 .cse35 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse17 .cse37 .cse38 .cse19 .cse20 .cse30 .cse21 .cse34 .cse24 .cse25 .cse26 .cse39)))) [2018-12-02 03:28:50,500 INFO L444 ceAbstractionStarter]: At program point transmit3ENTRY(lines 158 193) the Hoare annotation is: (let ((.cse60 (not (= |old(~token~0)| 0))) (.cse61 (not (= 0 ~local~0))) (.cse62 (not (= 0 ~m_pc~0)))) (let ((.cse46 (= 0 |old(~m_st~0)|)) (.cse47 (= 1 ~m_pc~0)) (.cse12 (= ~T1_E~0 0)) (.cse13 (= ~T2_E~0 1)) (.cse31 (= 0 ~E_3~0)) (.cse16 (= ~T3_E~0 1)) (.cse17 (= ~T2_E~0 0)) (.cse19 (= 0 ~M_E~0)) (.cse20 (= 1 ~M_E~0)) (.cse33 (not (= ~t1_pc~0 1))) (.cse36 (= ~T1_E~0 1)) (.cse22 (= 1 ~E_3~0)) (.cse23 (= 1 ~E_1~0)) (.cse38 (= 0 ~E_1~0)) (.cse50 (not (= 2 ~E_2~0))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse58 (not (= ~t1_pc~0 0))) (.cse51 (not (= 2 ~E_3~0))) (.cse55 (or .cse60 .cse61 .cse62)) (.cse52 (not (= 0 |old(~t3_pc~0)|))) (.cse53 (not (= 2 |old(~E_M~0)|))) (.cse54 (not (= 2 ~E_1~0))) (.cse56 (not (= 0 ~t2_pc~0))) (.cse18 (= 1 |old(~t3_pc~0)|)) (.cse24 (not (= ~t3_pc~0 1))) (.cse6 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse25 (= |old(~E_M~0)| ~E_M~0)) (.cse27 (= ~m_st~0 2)) (.cse28 (<= 2 ~t2_st~0)) (.cse11 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse43 (< 0 ~t2_pc~0)) (.cse15 (< ~local~0 |old(~token~0)|)) (.cse32 (< |old(~token~0)| ~local~0)) (.cse48 (and .cse24 .cse6 .cse25 .cse27 .cse28 .cse11)) (.cse41 (not .cse18)) (.cse45 (= 0 ~E_2~0)) (.cse42 (= 1 ~t3_pc~0)) (.cse44 (= ~m_st~0 |old(~m_st~0)|)) (.cse0 (and (or .cse12 .cse13 .cse31 .cse16 .cse17 .cse19 .cse20 (or .cse60 .cse61 .cse33 .cse56 .cse52 .cse53) .cse36 .cse22 .cse23 .cse38 .cse62) (or .cse50 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse21 .cse58 .cse51 (not (= 1 ~t1_i~0)) .cse55 (not (= ~T2_E~0 2)) .cse52 .cse53 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse54 (not (= 1 ~t2_i~0)) .cse56 (not (= 2 ~M_E~0))))) (.cse5 (= ~t3_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse57 (= ~t2_st~0 0)) (.cse26 (= ~token~0 |old(~token~0)|)) (.cse9 (= 0 ~t2_st~0)) (.cse14 (not (= 2 |old(~m_st~0)|))) (.cse1 (< |old(~t1_st~0)| 2)) (.cse3 (not (= 0 |old(~t2_st~0)|))) (.cse37 (not .cse47)) (.cse29 (= ~t1_st~0 0)) (.cse8 (= 0 ~m_st~0)) (.cse10 (= ~token~0 0)) (.cse30 (< |old(~t2_st~0)| 2)) (.cse34 (= 1 |old(~E_M~0)|)) (.cse35 (not (= 1 ~t2_pc~0))) (.cse2 (not .cse46)) (.cse4 (< ~E_2~0 2)) (.cse39 (= 0 |old(~E_M~0)|)) (.cse49 (< 0 ~t1_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (and .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) (or .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse24 .cse6 .cse25 .cse26 .cse27 .cse28 .cse29) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse4 .cse39) (let ((.cse40 (+ ~local~0 2))) (or .cse12 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20 .cse1 .cse22 .cse23 .cse30 .cse31 (< .cse40 |old(~token~0)|) .cse33 .cse41 (and .cse42 .cse6 .cse25 .cse26 .cse27 .cse28 .cse11) .cse34 .cse35 .cse36 .cse37 .cse38 .cse4 .cse39 (< |old(~token~0)| .cse40))) (or .cse12 .cse13 .cse43 .cse31 (and .cse24 .cse6 .cse25 .cse27 .cse9 .cse11) .cse14 .cse33 .cse16 .cse18 .cse17 .cse19 .cse20 .cse34 .cse1 .cse36 .cse22 .cse23 .cse3 .cse37 .cse38 .cse4 .cse39) (or (and .cse24 .cse25 .cse44) .cse12 .cse13 .cse31 .cse16 .cse18 .cse17 .cse19 .cse20 .cse34 .cse36 .cse22 .cse23 .cse38 .cse39 .cse45 .cse46 .cse47) (or .cse12 .cse13 .cse14 .cse16 .cse18 .cse17 .cse19 .cse20 .cse1 .cse22 .cse23 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse4 .cse39 .cse48) (or .cse12 .cse13 .cse43 .cse14 .cse15 (and .cse24 .cse6 .cse25 .cse26 .cse27 .cse9 .cse29) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse31 .cse32 .cse33 .cse34 .cse36 .cse3 .cse37 .cse38 .cse4 .cse39) (or .cse12 .cse30 .cse13 .cse31 .cse14 .cse16 .cse18 .cse17 .cse48 .cse19 .cse20 .cse34 .cse35 .cse36 .cse22 .cse23 .cse37 .cse38 .cse4 .cse39 .cse49) (or .cse12 .cse13 .cse50 .cse14 .cse16 .cse17 .cse19 .cse20 (and .cse5 (= ~t1_st~0 2)) .cse51 .cse30 .cse33 .cse52 .cse53 .cse35 (not (= |old(~t1_st~0)| 2)) .cse36 .cse37 .cse54) (or .cse12 .cse13 (and .cse24 .cse6 .cse25 .cse28 .cse8 .cse10 .cse11) .cse16 .cse17 .cse18 .cse19 .cse20 .cse1 .cse22 .cse23 .cse55 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse2 .cse38 .cse4 .cse39) (or .cse12 .cse13 .cse50 .cse14 .cse16 .cse17 .cse19 .cse20 .cse1 .cse22 .cse31 .cse33 .cse52 .cse53 .cse36 .cse5 .cse3 .cse37 .cse54 .cse56) (or (or .cse12 .cse13 .cse31 .cse16 .cse41 .cse17 .cse19 .cse20 .cse34 .cse36 .cse22 .cse23 .cse38 .cse39 .cse45 .cse47) .cse46 (and .cse42 .cse25 .cse44)) (or .cse0 (and .cse5 .cse29 .cse8 .cse6 .cse7 .cse57 .cse10) .cse2 .cse3 .cse49) (or .cse12 .cse13 .cse50 .cse14 .cse16 .cse17 .cse19 .cse20 .cse51 (or .cse58 .cse21) .cse52 .cse53 .cse36 .cse3 (and .cse5 .cse6 .cse7 .cse27 .cse29 .cse57) .cse37 .cse54 .cse56) (let ((.cse59 (+ ~local~0 1))) (or .cse12 (and .cse24 .cse6 .cse25 .cse26 .cse27 .cse9 .cse11) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1 .cse22 (< |old(~token~0)| .cse59) .cse23 .cse31 .cse33 .cse34 .cse35 .cse36 .cse3 .cse37 .cse38 .cse4 (< .cse59 |old(~token~0)|) .cse39)) (or .cse12 .cse13 .cse16 .cse17 .cse18 (and .cse24 .cse6 .cse25 .cse28 .cse29 .cse8 .cse10) .cse19 .cse20 .cse21 .cse22 .cse23 .cse55 .cse30 .cse31 .cse34 .cse35 .cse36 .cse2 .cse38 .cse4 .cse39 .cse49))))) [2018-12-02 03:28:50,500 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-02 03:28:50,500 INFO L444 ceAbstractionStarter]: At program point L166(lines 161 192) the Hoare annotation is: (let ((.cse42 (not (= |old(~token~0)| 0))) (.cse43 (not (= 0 ~local~0))) (.cse45 (not (= 0 ~m_pc~0)))) (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 0 ~E_3~0)) (.cse3 (= ~T3_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse13 (not (= ~t1_pc~0 1))) (.cse16 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse11 (= 1 ~E_1~0)) (.cse18 (= 0 ~E_1~0)) (.cse33 (not (= 2 ~E_2~0))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse35 (not (= ~t1_pc~0 0))) (.cse34 (not (= 2 ~E_3~0))) (.cse22 (or .cse42 .cse43 .cse45)) (.cse36 (not (= 0 |old(~t3_pc~0)|))) (.cse37 (not (= 2 |old(~E_M~0)|))) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse38 (not (= 2 ~E_1~0))) (.cse39 (not (= 0 ~t2_pc~0))) (.cse41 (= 0 |old(~m_st~0)|))) (let ((.cse24 (< 0 ~t1_pc~0)) (.cse29 (let ((.cse44 (not .cse41))) (and (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 (or .cse42 .cse17 .cse43 .cse13 .cse39 .cse36 .cse37) .cse16 .cse44 .cse9 .cse11 .cse18 .cse45) (or .cse33 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse21 .cse35 .cse34 (not (= 1 ~t1_i~0)) .cse22 (not (= ~T2_E~0 2)) .cse36 .cse37 .cse44 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse17 .cse38 (not (= 1 ~t2_i~0)) .cse39 (not (= 2 ~M_E~0)))))) (.cse31 (< ~local~0 |old(~token~0)|)) (.cse32 (< |old(~token~0)| ~local~0)) (.cse26 (= 1 ~t3_pc~0)) (.cse27 (= |old(~E_M~0)| ~E_M~0)) (.cse30 (< 0 ~t2_pc~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse40 (= 0 ~E_2~0)) (.cse28 (= 1 ~m_pc~0)) (.cse5 (= 1 |old(~t3_pc~0)|)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse15 (not (= 1 ~t2_pc~0))) (.cse19 (< ~E_2~0 2)) (.cse20 (= 0 |old(~E_M~0)|))) (and (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse10 |old(~token~0)|) .cse20)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse11 .cse22 .cse23 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse23 .cse1 .cse12 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse11 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse23 .cse1 .cse12 .cse2 .cse13 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse15 .cse8 .cse16 .cse9 .cse11 .cse18 .cse19 .cse20) (let ((.cse25 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 (< .cse25 |old(~token~0)|) .cse13 (and .cse26 (<= |old(~t3_st~0)| ~t3_st~0) .cse27 (= ~token~0 |old(~token~0)|) (= ~m_st~0 2) (<= 2 ~t2_st~0) (<= |old(~t1_st~0)| ~t1_st~0)) .cse14 .cse15 .cse16 (not .cse28) .cse18 .cse19 .cse20 (< |old(~token~0)| .cse25))) (or .cse29 .cse24) (or .cse0 .cse1 .cse30 .cse2 .cse31 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse8 .cse29 .cse19) (or .cse0 .cse1 .cse33 .cse2 .cse3 .cse4 .cse6 .cse7 .cse34 (or .cse35 .cse21) .cse36 .cse37 .cse16 .cse17 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse31 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse11 .cse23 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 .cse14 .cse16 .cse9 .cse11 .cse18 .cse20 .cse40 .cse28) .cse41 (and .cse26 .cse27 (= ~m_st~0 |old(~m_st~0)|))) (or .cse0 .cse1 .cse30 .cse12 .cse2 .cse13 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse8 .cse16 .cse9 .cse11 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse12 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse16 .cse9 .cse11 .cse18 .cse20 .cse40 .cse41 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse22 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20))))) [2018-12-02 03:28:50,501 INFO L444 ceAbstractionStarter]: At program point L187(lines 158 193) the Hoare annotation is: (let ((.cse56 (not (= |old(~token~0)| 0))) (.cse57 (not (= 0 ~local~0))) (.cse58 (not (= 0 ~m_pc~0)))) (let ((.cse4 (= 1 ~t3_pc~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= 2 ~t3_st~0)) (.cse7 (= ~m_st~0 2)) (.cse37 (<= 2 ~t2_st~0)) (.cse9 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (= 1 ~m_pc~0)) (.cse46 (= 0 |old(~m_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= 0 ~E_3~0)) (.cse12 (= ~T3_E~0 1)) (.cse14 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse11 (not (= ~t1_pc~0 1))) (.cse19 (= ~T1_E~0 1)) (.cse20 (= 1 ~E_3~0)) (.cse21 (= 1 ~E_1~0)) (.cse24 (= 0 ~E_1~0)) (.cse27 (not (= 2 ~E_2~0))) (.cse36 (not (= |old(~t1_st~0)| 0))) (.cse49 (not (= ~t1_pc~0 0))) (.cse28 (not (= 2 ~E_3~0))) (.cse41 (or .cse56 .cse57 .cse58)) (.cse30 (not (= 0 |old(~t3_pc~0)|))) (.cse31 (not (= 2 |old(~E_M~0)|))) (.cse33 (not (= 2 ~E_1~0))) (.cse50 (not (= 0 ~t2_pc~0)))) (let ((.cse2 (< 0 ~t2_pc~0)) (.cse51 (< ~local~0 |old(~token~0)|)) (.cse35 (= ~token~0 |old(~token~0)|)) (.cse52 (< |old(~token~0)| ~local~0)) (.cse47 (not (= ~E_M~0 0))) (.cse48 (not (= ~E_M~0 1))) (.cse38 (= ~t1_st~0 0)) (.cse43 (< 0 ~t1_pc~0)) (.cse55 (and (or .cse0 .cse1 .cse3 .cse12 .cse14 .cse15 .cse16 (or .cse56 .cse57 .cse11 .cse50 .cse30 .cse31) .cse19 .cse20 .cse21 .cse24 .cse58) (or .cse27 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse36 .cse49 .cse28 (not (= 1 ~t1_i~0)) .cse41 (not (= ~T2_E~0 2)) .cse30 .cse31 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse33 (not (= 1 ~t2_i~0)) .cse50 (not (= 2 ~M_E~0))))) (.cse8 (= 0 ~t2_st~0)) (.cse39 (= 0 ~m_st~0)) (.cse40 (= ~token~0 0)) (.cse42 (not .cse46)) (.cse22 (not (= 0 |old(~t2_st~0)|))) (.cse44 (= 0 ~E_2~0)) (.cse10 (not (= 2 |old(~m_st~0)|))) (.cse13 (= 1 |old(~t3_pc~0)|)) (.cse18 (< |old(~t1_st~0)| 2)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse32 (not (= 1 ~t2_pc~0))) (.cse23 (not .cse45)) (.cse53 (and .cse4 .cse5 .cse6 .cse7 .cse37 .cse9)) (.cse25 (< ~E_2~0 2)) (.cse26 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse10 .cse12 .cse14 .cse15 .cse16 (= ~t1_st~0 2) .cse28 .cse29 .cse11 .cse30 .cse31 .cse32 (not (= |old(~t1_st~0)| 2)) .cse19 .cse23 .cse33) (let ((.cse34 (+ ~local~0 1))) (or .cse0 .cse1 .cse10 .cse12 .cse14 .cse13 .cse15 .cse16 .cse18 .cse20 (< |old(~token~0)| .cse34) .cse21 .cse3 .cse11 .cse17 .cse32 .cse19 .cse22 .cse23 .cse24 .cse25 (< .cse34 |old(~token~0)|) .cse26 (and .cse4 .cse5 .cse6 .cse35 .cse7 .cse8 .cse9))) (or .cse0 .cse1 .cse12 .cse14 .cse13 .cse15 .cse16 .cse36 .cse20 .cse21 (and .cse4 .cse5 .cse6 .cse37 .cse38 .cse39 .cse40) .cse41 .cse29 .cse3 .cse17 .cse32 .cse19 .cse42 .cse24 .cse25 .cse26 .cse43) (or (or .cse0 .cse1 .cse3 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse24 .cse26 .cse44 .cse45) .cse46 (and .cse4 .cse47 .cse48 (= ~m_st~0 |old(~m_st~0)|))) (or .cse0 .cse1 .cse27 .cse10 .cse12 .cse14 .cse15 .cse16 .cse28 (or .cse49 .cse36) .cse30 .cse31 (and .cse5 .cse7 .cse38 (= ~t2_st~0 0) (= ~t3_st~0 2) (= ~t3_pc~0 1)) .cse19 .cse22 .cse23 .cse33 .cse50) (or .cse0 .cse1 .cse10 .cse51 .cse12 .cse14 .cse13 .cse15 .cse16 .cse36 (and .cse4 .cse5 .cse6 .cse35 .cse7 .cse37 .cse38) .cse20 .cse21 .cse29 .cse3 .cse52 .cse11 .cse17 .cse32 .cse19 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse29 .cse1 .cse3 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse53 .cse43) (or .cse0 .cse1 .cse2 .cse10 .cse51 .cse12 .cse14 .cse13 .cse15 .cse16 .cse36 .cse20 .cse21 (and .cse4 .cse5 .cse6 .cse35 .cse7 .cse8 .cse38) .cse3 .cse52 .cse11 .cse17 .cse19 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse54 (+ ~local~0 2))) (or .cse0 .cse1 .cse10 .cse12 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 (and .cse4 .cse47 .cse48 .cse6 .cse7 .cse37 .cse9) .cse29 .cse3 (< .cse54 |old(~token~0)|) .cse11 .cse17 .cse32 .cse19 .cse23 .cse24 .cse25 .cse26 (and .cse4 .cse47 .cse48 .cse6 (<= ~token~0 (+ ~local~0 3)) .cse37 (<= (+ |old(~token~0)| 1) ~token~0) .cse39 .cse9) (< |old(~token~0)| .cse54))) (or .cse0 .cse1 .cse12 .cse14 .cse13 .cse15 .cse16 .cse18 .cse20 .cse21 .cse41 .cse29 .cse3 .cse11 .cse17 .cse32 .cse19 .cse42 (and .cse4 .cse5 .cse6 .cse37 .cse39 .cse40 .cse9) .cse24 .cse25 .cse26) (or (and .cse4 .cse5 .cse6 .cse8 .cse38 .cse39 .cse40) .cse55 .cse42 .cse22 .cse43) (or .cse55 (and .cse4 .cse5 .cse6 .cse8 .cse39 .cse40 .cse9) .cse18 .cse42 .cse22 .cse25) (or .cse0 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse5 .cse24 .cse26 .cse44 .cse46 .cse45) (or .cse0 .cse1 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse29 .cse3 .cse11 .cse17 .cse32 .cse19 .cse23 .cse53 .cse24 .cse25 .cse26))))) [2018-12-02 03:28:50,501 INFO L444 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (let ((.cse42 (not (= |old(~token~0)| 0))) (.cse43 (not (= 0 ~local~0))) (.cse45 (not (= 0 ~m_pc~0)))) (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 0 ~E_3~0)) (.cse3 (= ~T3_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse13 (not (= ~t1_pc~0 1))) (.cse16 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse11 (= 1 ~E_1~0)) (.cse18 (= 0 ~E_1~0)) (.cse35 (not (= 2 ~E_2~0))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse37 (not (= ~t1_pc~0 0))) (.cse36 (not (= 2 ~E_3~0))) (.cse22 (or .cse42 .cse43 .cse45)) (.cse38 (not (= 0 |old(~t3_pc~0)|))) (.cse39 (not (= 2 |old(~E_M~0)|))) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse40 (not (= 2 ~E_1~0))) (.cse41 (not (= 0 ~t2_pc~0))) (.cse29 (= 0 |old(~m_st~0)|))) (let ((.cse24 (< 0 ~t1_pc~0)) (.cse25 (= 1 ~t3_pc~0)) (.cse26 (not (= ~E_M~0 0))) (.cse30 (let ((.cse44 (not .cse29))) (and (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 (or .cse42 .cse17 .cse43 .cse13 .cse41 .cse38 .cse39) .cse16 .cse44 .cse9 .cse11 .cse18 .cse45) (or .cse35 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse21 .cse37 .cse36 (not (= 1 ~t1_i~0)) .cse22 (not (= ~T2_E~0 2)) .cse38 .cse39 .cse44 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse17 .cse40 (not (= 1 ~t2_i~0)) .cse41 (not (= 2 ~M_E~0)))))) (.cse33 (< ~local~0 |old(~token~0)|)) (.cse34 (< |old(~token~0)| ~local~0)) (.cse32 (< 0 ~t2_pc~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse27 (= 0 ~E_2~0)) (.cse28 (= 1 ~m_pc~0)) (.cse5 (= 1 |old(~t3_pc~0)|)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse15 (not (= 1 ~t2_pc~0))) (.cse19 (< ~E_2~0 2)) (.cse20 (= 0 |old(~E_M~0)|))) (and (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse10 |old(~token~0)|) .cse20)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse11 .cse22 .cse23 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse23 .cse1 .cse12 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse11 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse23 .cse1 .cse12 .cse2 .cse13 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse15 .cse8 .cse16 .cse9 .cse11 .cse18 .cse19 .cse20) (or (and (= ~m_st~0 |old(~m_st~0)|) .cse25 .cse26) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 .cse14 .cse16 .cse9 .cse11 .cse18 .cse20 .cse27 .cse28) .cse29) (or .cse30 .cse24) (let ((.cse31 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 (< .cse31 |old(~token~0)|) .cse13 .cse14 .cse15 (and .cse25 .cse26 (<= |old(~t3_st~0)| ~t3_st~0) (<= ~token~0 (+ ~local~0 3)) (= ~m_st~0 2) (<= 2 ~t2_st~0) (<= (+ |old(~token~0)| 1) ~token~0) (<= |old(~t1_st~0)| ~t1_st~0)) .cse16 (not .cse28) .cse18 .cse19 .cse20 (< |old(~token~0)| .cse31))) (or .cse0 .cse1 .cse32 .cse2 .cse33 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse34 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse8 .cse30 .cse19) (or .cse0 .cse1 .cse35 .cse2 .cse3 .cse4 .cse6 .cse7 .cse36 (or .cse37 .cse21) .cse38 .cse39 .cse16 .cse17 .cse40 .cse41) (or .cse0 .cse1 .cse2 .cse33 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse11 .cse23 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse32 .cse12 .cse2 .cse13 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse8 .cse16 .cse9 .cse11 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse12 .cse3 .cse5 .cse4 .cse6 .cse7 .cse14 .cse16 .cse9 .cse11 .cse18 .cse20 .cse27 .cse29 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse22 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20))))) [2018-12-02 03:28:50,501 INFO L448 ceAbstractionStarter]: For program point L183-1(line 183) no Hoare annotation was computed. [2018-12-02 03:28:50,501 INFO L448 ceAbstractionStarter]: For program point transmit3EXIT(lines 158 193) no Hoare annotation was computed. [2018-12-02 03:28:50,502 INFO L444 ceAbstractionStarter]: At program point L173-1(lines 161 192) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T3_E~0 1)) (.cse18 (= ~T1_E~0 1))) (let ((.cse22 (= ~m_st~0 2)) (.cse66 (not .cse18)) (.cse67 (not .cse4)) (.cse68 (not .cse1)) (.cse69 (not (= ~E_3~0 1))) (.cse70 (not (= ~E_1~0 1))) (.cse65 (= ~m_pc~0 1)) (.cse71 (not (= ~M_E~0 1))) (.cse53 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_3~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse20 (= |old(~E_M~0)| ~E_M~0)) (.cse54 (not (= ~E_M~0 1))) (.cse62 (not (= |old(~token~0)| 0))) (.cse63 (not (= 0 ~local~0))) (.cse64 (not (= 0 ~m_pc~0)))) (let ((.cse50 (= 1 ~m_pc~0)) (.cse51 (= 0 |old(~m_st~0)|)) (.cse13 (= 0 ~E_3~0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse15 (not (= ~t1_pc~0 1))) (.cse10 (= 1 ~E_3~0)) (.cse11 (= 1 ~E_1~0)) (.cse26 (= 0 ~E_1~0)) (.cse31 (not (= 2 ~E_2~0))) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse57 (not (= ~t1_pc~0 0))) (.cse32 (not (= 2 ~E_3~0))) (.cse37 (or .cse62 .cse63 .cse64)) (.cse34 (not (= 0 |old(~t3_pc~0)|))) (.cse35 (not (= 2 |old(~E_M~0)|))) (.cse36 (not (= 2 ~E_1~0))) (.cse58 (not (= 0 ~t2_pc~0))) (.cse23 (<= 2 ~t2_st~0)) (.cse44 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse52 (= ~m_st~0 |old(~m_st~0)|)) (.cse43 (= 0 ~t2_st~0)) (.cse60 (and .cse66 .cse67 .cse68 .cse69 .cse70 (not .cse65) .cse71 .cse53 .cse20 .cse54)) (.cse61 (or (and .cse65 .cse22) (and (= ~m_st~0 0) (= ~m_pc~0 0)))) (.cse19 (<= |old(~t3_st~0)| ~t3_st~0))) (let ((.cse42 (and (and .cse60 .cse61) .cse19)) (.cse47 (< 0 ~t2_pc~0)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse48 (and .cse65 (= 1 ~t1_pc~0) .cse66 .cse67 .cse52 .cse68 .cse22 .cse69 (<= ~t2_pc~0 0) .cse70 .cse43 .cse71 .cse19 .cse53 .cse20 .cse54)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse30 (and .cse19 .cse20 .cse22 .cse23 .cse44)) (.cse45 (and (or .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 (or .cse62 .cse63 .cse15 .cse58 .cse34 .cse35) .cse18 .cse10 .cse11 .cse26 .cse64) (or .cse31 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse9 .cse57 .cse32 (not (= 1 ~t1_i~0)) .cse37 (not (= ~T2_E~0 2)) .cse34 .cse35 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse36 (not (= 1 ~t2_i~0)) .cse58 (not (= 2 ~M_E~0))))) (.cse38 (not .cse51)) (.cse40 (= ~token~0 0)) (.cse39 (and (and .cse60 .cse52 .cse61) .cse19)) (.cse41 (< 0 ~t1_pc~0)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse49 (= 0 ~E_2~0)) (.cse33 (= ~t3_pc~0 0)) (.cse24 (= ~t1_st~0 0)) (.cse55 (= ~t2_st~0 0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse6 (= 1 |old(~t3_pc~0)|)) (.cse29 (< |old(~t1_st~0)| 2)) (.cse21 (= ~token~0 |old(~token~0)|)) (.cse16 (= 1 |old(~E_M~0)|)) (.cse17 (not (= 1 ~t2_pc~0))) (.cse46 (not (= 0 |old(~t2_st~0)|))) (.cse25 (not .cse50)) (.cse27 (< ~E_2~0 2)) (.cse28 (= 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 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse5 .cse7 .cse8 .cse29 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse30 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse7 .cse8 .cse32 .cse12 .cse15 (and .cse33 (= ~t1_st~0 2)) .cse34 .cse35 .cse17 (not (= |old(~t1_st~0)| 2)) .cse18 .cse25 .cse36) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13 .cse16 .cse17 .cse18 .cse38 (and .cse39 .cse23 .cse24 .cse40) .cse26 .cse27 .cse28 .cse41) (or (and .cse42 .cse43 .cse40 .cse44) .cse45 .cse29 .cse38 .cse46 .cse27) (or .cse0 .cse1 .cse47 .cse13 .cse2 .cse15 .cse4 .cse6 .cse5 .cse7 .cse8 .cse16 .cse29 .cse18 .cse10 .cse11 .cse46 .cse25 (and .cse48 .cse44) .cse26 .cse27 .cse28) (or .cse0 .cse1 (and .cse42 .cse23 .cse40 .cse44) .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse10 .cse11 .cse37 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse38 .cse26 .cse27 .cse28) (or (or .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse16 .cse18 .cse10 .cse11 .cse26 .cse28 .cse49 .cse50) .cse51 (and .cse52 .cse53 .cse54)) (or .cse0 .cse1 .cse47 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse24 (<= ~token~0 ~local~0) .cse48 (<= ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 .cse18 .cse46 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse12 .cse1 .cse13 .cse2 .cse30 .cse4 .cse6 .cse5 .cse7 .cse8 .cse16 .cse17 .cse18 .cse10 .cse11 .cse25 .cse26 .cse27 .cse28 .cse41) (or .cse45 .cse38 (and .cse33 .cse24 .cse55 .cse40 .cse39) .cse46 .cse41) (let ((.cse56 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse29 .cse10 .cse11 (and .cse19 .cse53 .cse54 .cse22 .cse23 .cse44) .cse12 .cse13 (< .cse56 |old(~token~0)|) .cse15 (and .cse19 .cse53 .cse54 (<= ~token~0 (+ ~local~0 3)) .cse23 (<= (+ |old(~token~0)| 1) ~token~0) (= 0 ~m_st~0) .cse44) .cse16 .cse17 .cse18 .cse25 .cse26 .cse27 .cse28 (< |old(~token~0)| .cse56))) (or .cse0 .cse1 .cse13 .cse4 .cse6 .cse5 .cse7 .cse8 .cse16 .cse20 .cse18 .cse10 .cse11 .cse26 .cse28 .cse49 .cse51 .cse50) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse7 .cse8 .cse32 (or .cse57 .cse9) .cse34 .cse35 .cse18 .cse46 .cse25 .cse36 (and .cse33 .cse19 (= ~E_M~0 2) .cse22 .cse24 .cse55) .cse58) (let ((.cse59 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse10 (< |old(~token~0)| .cse59) .cse11 (and .cse19 .cse20 .cse21 .cse22 .cse43 .cse44) .cse13 .cse15 .cse16 .cse17 .cse18 .cse46 .cse25 .cse26 .cse27 (< .cse59 |old(~token~0)|) .cse28))))))) [2018-12-02 03:28:50,502 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2018-12-02 03:28:50,502 INFO L444 ceAbstractionStarter]: At program point L151(lines 122 157) the Hoare annotation is: (let ((.cse54 (= 0 |old(~m_st~0)|)) (.cse60 (not (= |old(~token~0)| 0))) (.cse61 (not (= 0 ~local~0))) (.cse62 (not (= 0 ~m_pc~0)))) (let ((.cse24 (= 0 |old(~E_3~0)|)) (.cse21 (= 1 |old(~E_3~0)|)) (.cse18 (not (= 0 |old(~t3_st~0)|))) (.cse41 (not (= |old(~t1_st~0)| 2))) (.cse25 (not (= ~t1_pc~0 1))) (.cse40 (not (= 2 ~E_2~0))) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse14 (not (= 2 |old(~E_3~0)|))) (.cse23 (or .cse60 .cse61 .cse62)) (.cse17 (not (= 0 ~t3_pc~0))) (.cse9 (not (= 2 ~E_M~0))) (.cse30 (not .cse54)) (.cse11 (not (= 2 ~E_1~0))) (.cse16 (not (= 0 |old(~t2_pc~0)|))) (.cse52 (= 0 ~m_st~0)) (.cse53 (= ~token~0 0)) (.cse35 (= 1 ~t3_pc~0)) (.cse55 (= 1 ~m_pc~0)) (.cse48 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (not (= ~E_3~0 1))) (.cse51 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse44 (= 1 ~t2_pc~0)) (.cse45 (= ~m_st~0 2)) (.cse46 (<= 2 ~t2_st~0)) (.cse38 (= ~t1_st~0 0)) (.cse47 (not (= ~E_3~0 0)))) (let ((.cse33 (< ~local~0 |old(~token~0)|)) (.cse34 (and .cse42 .cse51 .cse44 (= ~token~0 |old(~token~0)|) .cse45 .cse46 .cse38 .cse47)) (.cse36 (< |old(~token~0)| ~local~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse20 (< |old(~t1_st~0)| 2)) (.cse8 (and .cse42 .cse51 .cse44 .cse45 .cse46 .cse47 .cse48)) (.cse50 (not (= 1 |old(~t2_pc~0)|))) (.cse15 (not .cse55)) (.cse19 (< 0 |old(~t2_pc~0)|)) (.cse26 (not .cse35)) (.cse27 (< |old(~t3_st~0)| 2)) (.cse12 (< ~E_2~0 2)) (.cse39 (< 0 ~t1_pc~0)) (.cse28 (and .cse42 .cse51 .cse44 .cse46 .cse52 .cse53 .cse47 .cse48)) (.cse37 (let ((.cse57 (not (= ~T3_E~0 2))) (.cse58 (not (= ~T1_E~0 2))) (.cse56 (not (= ~T2_E~0 2))) (.cse59 (not (= 2 ~M_E~0)))) (and (or .cse24 .cse21 (or .cse56 .cse40 .cse57 .cse58 .cse18 .cse41 .cse30 .cse11 .cse59) (or .cse60 .cse61 .cse25 .cse16 .cse17 .cse9) .cse62) (or .cse40 .cse57 .cse58 .cse7 .cse13 .cse14 (not (= 1 ~t1_i~0)) .cse23 .cse56 .cse17 .cse9 .cse30 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse11 (not (= 1 ~t2_i~0)) .cse16 .cse59)))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse29 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse22 (= 1 ~E_1~0)) (.cse31 (= 0 ~E_1~0)) (.cse32 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse10 .cse30 .cse31 .cse12 .cse32) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse24 .cse25 .cse27 .cse29 .cse10 .cse15 .cse31 .cse12 .cse32) (or .cse0 .cse1 .cse19 .cse33 .cse2 .cse34 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse21 .cse22 .cse24 .cse25 .cse36 .cse29 .cse10 .cse15 .cse31 .cse12 .cse32) (or .cse37 .cse38 .cse39) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse25 .cse18 .cse17 .cse9 .cse41 .cse10 (and (= ~E_3~0 2) (= ~t1_st~0 2) (= ~t3_st~0 0)) .cse15 .cse11 .cse16) (let ((.cse49 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 (let ((.cse43 (+ ~local~0 2))) (and .cse42 (<= ~token~0 .cse43) .cse44 .cse45 .cse46 .cse47 (<= .cse43 ~token~0) .cse48)) (< |old(~token~0)| .cse49) .cse22 .cse8 .cse24 .cse25 .cse27 .cse29 .cse50 .cse10 .cse15 .cse31 .cse12 (< .cse49 |old(~token~0)|) .cse32)) (or .cse0 .cse1 .cse19 .cse24 .cse2 .cse3 .cse27 .cse26 .cse8 .cse4 .cse5 .cse6 .cse29 .cse10 .cse21 .cse22 (not (= ~m_pc~0 1)) .cse31 .cse12 .cse32 .cse39) (or .cse0 .cse1 .cse19 .cse2 .cse33 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse22 .cse34 .cse24 .cse36 .cse25 .cse27 .cse29 .cse10 .cse15 .cse31 .cse12 .cse32) (or .cse0 .cse1 .cse19 .cse24 .cse2 .cse25 .cse3 .cse35 .cse4 .cse5 .cse6 .cse29 .cse20 .cse10 .cse21 .cse22 .cse15 .cse31 .cse12 .cse32 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse24 .cse25 .cse8 .cse29 .cse50 .cse10 .cse15 .cse31 .cse12 .cse32) (or .cse0 (and .cse42 .cse51 .cse44 .cse46 .cse38 .cse52 .cse53 .cse47) .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27 .cse29 .cse10 .cse30 .cse31 .cse12 .cse32 .cse39) (or .cse28 .cse37) (or .cse0 .cse1 .cse24 .cse3 .cse4 (and .cse42 (= ~m_st~0 |old(~m_st~0)|) .cse47) .cse5 .cse6 .cse29 .cse10 .cse21 .cse22 .cse31 .cse32 (= 0 ~E_2~0) .cse54 .cse55))))) [2018-12-02 03:28:50,503 INFO L444 ceAbstractionStarter]: At program point L147(line 147) the Hoare annotation is: (let ((.cse51 (= 0 |old(~m_st~0)|)) (.cse44 (= 1 ~t3_pc~0)) (.cse10 (not (= |old(~token~0)| 0))) (.cse11 (not (= 0 ~local~0))) (.cse16 (not (= 0 ~m_pc~0))) (.cse52 (= 1 ~m_pc~0))) (let ((.cse3 (not (= 2 ~E_2~0))) (.cse4 (not (= ~T3_E~0 2))) (.cse5 (not (= ~T1_E~0 2))) (.cse2 (not (= ~T2_E~0 2))) (.cse9 (not (= 2 ~M_E~0))) (.cse38 (< 0 ~t1_pc~0)) (.cse15 (not (= 2 ~E_M~0))) (.cse8 (not (= 2 ~E_1~0))) (.cse18 (not (= ~t1_pc~0 0))) (.cse19 (not (= 2 |old(~E_3~0)|))) (.cse13 (not (= 0 |old(~t2_pc~0)|))) (.cse14 (not (= 0 ~t3_pc~0))) (.cse6 (not (= 0 |old(~t3_st~0)|))) (.cse39 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse40 (= 1 ~t2_pc~0)) (.cse41 (= ~m_st~0 2)) (.cse43 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (not (= 1 |old(~t2_pc~0)|))) (.cse47 (< ~local~0 |old(~token~0)|)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse48 (< |old(~token~0)| ~local~0)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse34 (not .cse52)) (.cse42 (not (= ~E_3~0 0))) (.cse21 (= ~T1_E~0 0)) (.cse22 (= ~T2_E~0 1)) (.cse23 (< 0 |old(~t2_pc~0)|)) (.cse25 (= ~T3_E~0 1)) (.cse28 (= ~T2_E~0 0)) (.cse29 (= 0 ~M_E~0)) (.cse30 (= 1 ~M_E~0)) (.cse46 (< |old(~t1_st~0)| 2)) (.cse1 (= 1 |old(~E_3~0)|)) (.cse33 (= 1 ~E_1~0)) (.cse20 (or .cse10 .cse11 .cse16)) (.cse0 (= 0 |old(~E_3~0)|)) (.cse12 (not (= ~t1_pc~0 1))) (.cse27 (not .cse44)) (.cse26 (< |old(~t3_st~0)| 2)) (.cse31 (= 1 ~E_M~0)) (.cse32 (= ~T1_E~0 1)) (.cse7 (not .cse51)) (.cse35 (= 0 ~E_1~0)) (.cse36 (< ~E_2~0 2)) (.cse37 (= 0 ~E_M~0))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) (or .cse3 .cse4 .cse5 .cse17 .cse18 .cse19 (not (= 1 ~t1_i~0)) .cse20 .cse2 .cse14 .cse15 .cse7 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse8 (not (= 1 ~t2_i~0)) .cse13 .cse9) (or .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (or .cse21 .cse22 .cse23 .cse25 .cse28 .cse29 .cse30 .cse17 .cse1 .cse33 .cse20 .cse0 .cse27 .cse26 .cse31 .cse32 .cse7 .cse35 .cse36 .cse37 .cse38) (or .cse21 (and .cse39 .cse40 .cse41 .cse42 .cse43) .cse22 .cse0 .cse24 .cse12 .cse25 .cse44 .cse28 .cse29 .cse30 .cse31 .cse45 .cse46 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse23 .cse0 .cse24 .cse12 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse46 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse23 .cse0 .cse24 .cse12 .cse25 .cse44 .cse28 .cse29 .cse30 .cse31 .cse46 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse24 .cse25 .cse28 .cse29 .cse30 .cse17 .cse15 .cse32 .cse8 .cse36 (or .cse18 .cse19 .cse34 .cse13 .cse14 .cse6)) (or .cse21 .cse22 .cse23 .cse24 .cse47 .cse25 .cse28 .cse29 .cse30 .cse17 .cse1 .cse33 .cse0 .cse48 .cse12 .cse26 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37) (let ((.cse50 (+ ~local~0 1))) (or (let ((.cse49 (+ ~local~0 2))) (and .cse39 (<= ~token~0 .cse49) .cse40 .cse41 .cse42 (<= .cse49 ~token~0) .cse43)) .cse21 .cse22 .cse24 .cse25 .cse28 .cse29 .cse30 .cse46 .cse1 (< |old(~token~0)| .cse50) .cse33 .cse0 .cse12 .cse27 .cse26 .cse31 .cse45 .cse32 .cse34 .cse35 .cse36 (< .cse50 |old(~token~0)|) .cse37)) (or .cse21 .cse22 .cse23 .cse0 .cse47 .cse24 .cse12 .cse48 .cse25 .cse44 .cse28 .cse29 .cse30 .cse17 .cse31 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or (and (= ~m_st~0 |old(~m_st~0)|) .cse42) .cse21 .cse22 .cse0 .cse25 .cse28 .cse29 .cse30 .cse31 .cse32 .cse1 .cse33 .cse35 .cse37 (= 0 ~E_2~0) .cse51 .cse52) (or .cse21 .cse22 .cse23 .cse25 .cse28 .cse29 .cse30 .cse46 .cse1 .cse33 .cse20 .cse0 .cse12 .cse27 .cse26 .cse31 .cse32 .cse7 .cse35 .cse36 .cse37)))) [2018-12-02 03:28:50,503 INFO L448 ceAbstractionStarter]: For program point L147-1(line 147) no Hoare annotation was computed. [2018-12-02 03:28:50,503 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 122 157) no Hoare annotation was computed. [2018-12-02 03:28:50,503 INFO L444 ceAbstractionStarter]: At program point L137-1(lines 125 156) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T3_E~0 1)) (.cse1 (= ~T2_E~0 1)) (.cse7 (= ~T2_E~0 0))) (let ((.cse60 (= 0 |old(~m_st~0)|)) (.cse76 (not (= |old(~token~0)| 0))) (.cse77 (not (= 0 ~local~0))) (.cse78 (not (= 0 ~m_pc~0))) (.cse62 (not .cse7)) (.cse63 (not .cse1)) (.cse27 (not (= ~E_3~0 1))) (.cse28 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse69 (not .cse5)) (.cse59 (= ~m_st~0 |old(~m_st~0)|)) (.cse71 (not .cse0)) (.cse31 (not (= ~E_3~0 0))) (.cse22 (= ~T1_E~0 1))) (let ((.cse61 (= 1 ~m_pc~0)) (.cse64 (not (= ~M_E~0 0))) (.cse67 (= ~m_pc~0 1)) (.cse65 (not (= ~M_E~0 1))) (.cse66 (not (= ~E_M~0 1))) (.cse68 (not .cse22)) (.cse70 (not (= ~E_1~0 1))) (.cse6 (= 1 ~t3_pc~0)) (.cse58 (and .cse62 .cse63 .cse27 .cse28 .cse69 .cse59 .cse71 .cse31)) (.cse15 (<= ~t2_pc~0 0)) (.cse29 (= 0 ~m_st~0)) (.cse30 (= ~token~0 0)) (.cse42 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= 0 |old(~E_3~0)|)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse51 (not (= 0 |old(~t3_st~0)|))) (.cse54 (not (= |old(~t1_st~0)| 2))) (.cse19 (not (= ~t1_pc~0 1))) (.cse49 (not (= 2 ~E_2~0))) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse57 (not (= ~t1_pc~0 0))) (.cse50 (not (= 2 |old(~E_3~0)|))) (.cse32 (or .cse76 .cse77 .cse78)) (.cse52 (not (= 0 ~t3_pc~0))) (.cse53 (not (= 2 ~E_M~0))) (.cse35 (not .cse60)) (.cse55 (not (= 2 ~E_1~0))) (.cse56 (not (= 0 |old(~t2_pc~0)|)))) (let ((.cse45 (let ((.cse73 (not (= ~T3_E~0 2))) (.cse74 (not (= ~T1_E~0 2))) (.cse72 (not (= ~T2_E~0 2))) (.cse75 (not (= 2 ~M_E~0)))) (and (or .cse18 .cse11 (or .cse72 .cse49 .cse73 .cse74 .cse51 .cse54 .cse35 .cse55 .cse75) (or .cse76 .cse77 .cse19 .cse56 .cse52 .cse53) .cse78) (or .cse49 .cse73 .cse74 .cse10 .cse57 .cse50 (not (= 1 ~t1_i~0)) .cse32 .cse72 .cse52 .cse53 .cse35 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse55 (not (= 1 ~t2_i~0)) .cse56 .cse75)))) (.cse46 (and .cse27 .cse15 .cse28 .cse29 .cse30 .cse31 .cse42)) (.cse43 (not (= 1 |old(~t2_pc~0)|))) (.cse48 (= ~E_3~0 2)) (.cse47 (= ~t2_pc~0 0)) (.cse41 (= ~m_st~0 2)) (.cse37 (and .cse58 .cse15 .cse42)) (.cse33 (not .cse6)) (.cse44 (and .cse62 .cse6 .cse63 .cse64 .cse27 (not .cse67) .cse65 .cse66 .cse68 .cse69 .cse59 .cse70 .cse71 .cse31)) (.cse36 (< 0 ~t1_pc~0)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse13 (= ~t1_st~0 0)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse20 (< |old(~token~0)| ~local~0)) (.cse34 (< |old(~t3_st~0)| 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse21 (= 1 ~E_M~0)) (.cse38 (< |old(~t1_st~0)| 2)) (.cse12 (= 1 ~E_1~0)) (.cse16 (and .cse62 .cse63 .cse64 (not (= ~t3_pc~0 1)) .cse27 .cse65 .cse28 .cse66 .cse67 .cse68 .cse69 .cse59 .cse70 .cse71 .cse31)) (.cse23 (not .cse61)) (.cse24 (= 0 ~E_1~0)) (.cse25 (< ~E_2~0 2)) (.cse26 (= 0 ~E_M~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 (and .cse27 .cse15 .cse28 .cse13 .cse29 .cse30 .cse31) .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse18 .cse33 .cse34 .cse21 .cse22 .cse35 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse37 .cse8 .cse9 .cse38 .cse11 .cse12 .cse18 .cse19 .cse34 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse39 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse38 .cse11 (< |old(~token~0)| .cse39) .cse12 .cse18 .cse19 (let ((.cse40 (+ ~local~0 2))) (and .cse27 (<= ~token~0 .cse40) (= 1 ~t2_pc~0) .cse41 .cse31 (<= .cse40 ~token~0) .cse42)) .cse33 .cse34 .cse21 .cse43 .cse22 .cse44 .cse24 .cse25 (< .cse39 |old(~token~0)|) .cse26 (and (and .cse27 .cse28 .cse41 .cse31) .cse42))) (or .cse45 .cse46) (or .cse45 (and .cse47 .cse13 .cse48) .cse36) (or .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse38 .cse11 .cse12 .cse32 .cse18 .cse19 .cse33 .cse34 .cse21 .cse22 .cse35 .cse24 .cse25 .cse26 .cse46) (or .cse0 .cse1 .cse49 .cse4 .cse5 .cse7 .cse8 .cse9 (and .cse48 (= ~t1_st~0 2) (= ~t3_st~0 0) .cse47) .cse50 .cse19 .cse51 .cse52 .cse53 .cse54 .cse22 .cse23 .cse55 .cse56) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse38 .cse11 .cse12 .cse18 .cse19 .cse21 .cse43 .cse22 .cse23 (and .cse16 .cse42) .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse52 .cse53 .cse22 .cse55 (and .cse48 .cse47 .cse13 (and .cse28 .cse41)) .cse25 (or .cse57 .cse50 .cse23 .cse56 .cse51)) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse37 .cse34 .cse33 .cse7 .cse8 .cse9 .cse21 .cse22 .cse11 .cse12 .cse44 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse7 (and .cse13 .cse14 .cse58 .cse15 .cse17) .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse20 .cse19 .cse34 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse18 .cse5 .cse7 (and .cse27 .cse59 .cse31) .cse8 .cse9 .cse21 .cse22 .cse11 .cse12 .cse24 .cse26 (= 0 ~E_2~0) .cse60 .cse61) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse38 .cse22 .cse11 .cse12 (and .cse15 .cse16 .cse42) .cse23 .cse24 .cse25 .cse26)))))) [2018-12-02 03:28:50,503 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 133) no Hoare annotation was computed. [2018-12-02 03:28:50,504 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 122 157) the Hoare annotation is: (let ((.cse47 (= 1 ~t3_pc~0)) (.cse31 (= 1 ~m_pc~0)) (.cse30 (= 0 |old(~m_st~0)|)) (.cse61 (not (= |old(~token~0)| 0))) (.cse62 (not (= 0 ~local~0))) (.cse63 (not (= 0 ~m_pc~0)))) (let ((.cse50 (= ~token~0 |old(~token~0)|)) (.cse41 (= ~t1_st~0 0)) (.cse33 (<= ~t2_pc~0 0)) (.cse34 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= ~m_st~0 2)) (.cse29 (= |old(~E_3~0)| ~E_3~0)) (.cse37 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= 0 |old(~E_3~0)|)) (.cse22 (= 1 |old(~E_3~0)|)) (.cse55 (not (= |old(~t1_st~0)| 2))) (.cse19 (not (= ~t1_pc~0 1))) (.cse52 (not (= 2 ~E_2~0))) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse32 (or .cse61 .cse62 .cse63)) (.cse43 (not (= 2 ~E_M~0))) (.cse38 (not .cse30)) (.cse44 (not (= 2 ~E_1~0))) (.cse42 (not (= 0 ~t3_pc~0))) (.cse54 (not (= 0 |old(~t3_st~0)|))) (.cse64 (not (= ~t1_pc~0 0))) (.cse53 (not (= 2 |old(~E_3~0)|))) (.cse23 (not .cse31)) (.cse4 (not .cse47)) (.cse56 (not (= 0 |old(~t2_pc~0)|)))) (let ((.cse14 (and (or .cse64 .cse53 .cse23 .cse56 .cse42 .cse54) (or .cse64 (not (= 2 |old(~t3_st~0)|)) .cse53 .cse23 .cse4 .cse56))) (.cse45 (let ((.cse58 (not (= ~T3_E~0 2))) (.cse59 (not (= ~T1_E~0 2))) (.cse57 (not (= ~T2_E~0 2))) (.cse60 (not (= 2 ~M_E~0)))) (and (or .cse17 .cse22 (or .cse57 .cse52 .cse58 .cse59 .cse54 .cse55 .cse38 .cse44 .cse60) (or .cse61 .cse62 .cse19 .cse56 .cse42 .cse43) .cse63) (or .cse52 .cse58 .cse59 .cse26 .cse64 .cse53 (not (= 1 ~t1_i~0)) .cse32 .cse57 .cse42 .cse43 .cse38 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse44 (not (= 1 ~t2_i~0)) .cse56 .cse60)))) (.cse18 (and .cse33 .cse34 .cse39 .cse29 .cse37)) (.cse35 (= 0 ~m_st~0)) (.cse36 (= ~token~0 0)) (.cse24 (< 0 ~t1_pc~0)) (.cse20 (< |old(~t3_st~0)| 2)) (.cse46 (= ~t1_st~0 2)) (.cse40 (= ~t3_st~0 0)) (.cse11 (= ~t2_pc~0 0)) (.cse16 (< 0 |old(~t2_pc~0)|)) (.cse25 (< ~local~0 |old(~token~0)|)) (.cse28 (and .cse33 .cse34 .cse50 .cse39 .cse29 .cse41)) (.cse27 (< |old(~token~0)| ~local~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse49 (= 1 ~t2_pc~0)) (.cse3 (= ~T3_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse51 (not (= 1 |old(~t2_pc~0)|))) (.cse21 (< |old(~t1_st~0)| 2)) (.cse9 (= ~T1_E~0 1)) (.cse10 (= 1 ~E_1~0)) (.cse12 (= 0 ~E_1~0)) (.cse13 (< ~E_2~0 2)) (.cse15 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (= ~t3_st~0 2)) .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse16 .cse17 .cse2 .cse18 .cse19 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse23 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse18 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse23 .cse12 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse16 .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse26 .cse22 .cse10 .cse17 .cse27 .cse19 .cse20 .cse8 .cse9 .cse28 .cse23 .cse12 .cse13 .cse15) (or (and (= ~m_st~0 |old(~m_st~0)|) .cse29) .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse12 .cse15 (= 0 ~E_2~0) .cse30 .cse31) (or .cse0 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse21 .cse22 .cse10 .cse32 (and .cse33 .cse34 .cse29 .cse35 .cse36 .cse37) .cse17 .cse19 .cse4 .cse20 .cse8 .cse9 .cse38 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse26 (and .cse39 .cse29 .cse40 .cse11 .cse41) .cse42 .cse43 .cse9 .cse44 .cse13 .cse14) (or .cse19 .cse45 (and .cse36 (and .cse29 .cse46 .cse40 .cse11 .cse35))) (or (and .cse11 .cse41 .cse35 (= ~E_3~0 2) .cse34 .cse36) .cse45 .cse24) (or .cse0 .cse1 .cse16 .cse17 .cse2 .cse19 .cse3 .cse47 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse18 .cse10 .cse23 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse26 .cse22 .cse10 .cse32 .cse17 (and .cse33 .cse34 .cse29 .cse41 .cse35 .cse36) .cse4 .cse20 .cse8 .cse9 .cse38 .cse12 .cse13 .cse15 .cse24) (let ((.cse48 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse22 (< |old(~token~0)| .cse48) .cse10 .cse17 .cse19 .cse4 .cse20 (and .cse34 .cse49 .cse50 .cse39 .cse29 .cse37) .cse8 .cse51 .cse9 .cse23 .cse12 .cse13 (< .cse48 |old(~token~0)|) .cse15)) (or .cse0 (and .cse46 .cse40 .cse11) .cse1 .cse52 .cse2 .cse3 .cse5 .cse6 .cse7 .cse53 .cse19 .cse54 .cse42 .cse43 .cse55 .cse9 .cse23 .cse44 .cse56) (or .cse0 .cse1 .cse16 .cse25 .cse2 .cse3 .cse47 .cse5 .cse6 .cse7 .cse26 .cse22 .cse10 .cse17 .cse28 .cse19 .cse27 .cse8 .cse9 .cse23 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse17 .cse2 (and .cse34 .cse49 .cse39 .cse29 .cse37) .cse19 .cse3 .cse47 .cse5 .cse6 .cse7 .cse8 .cse51 .cse21 .cse9 .cse22 .cse10 .cse23 .cse12 .cse13 .cse15))))) [2018-12-02 03:28:50,504 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-02 03:28:50,506 INFO L444 ceAbstractionStarter]: At program point L130(lines 125 156) the Hoare annotation is: (let ((.cse43 (= 1 ~m_pc~0)) (.cse40 (= 1 ~t3_pc~0)) (.cse42 (= 0 |old(~m_st~0)|)) (.cse10 (not (= |old(~token~0)| 0))) (.cse11 (not (= 0 ~local~0))) (.cse16 (not (= 0 ~m_pc~0)))) (let ((.cse3 (not (= 2 ~E_2~0))) (.cse4 (not (= ~T3_E~0 2))) (.cse5 (not (= ~T1_E~0 2))) (.cse2 (not (= ~T2_E~0 2))) (.cse9 (not (= 2 ~M_E~0))) (.cse38 (< 0 ~t1_pc~0)) (.cse15 (not (= 2 ~E_M~0))) (.cse8 (not (= 2 ~E_1~0))) (.cse18 (not (= ~t1_pc~0 0))) (.cse19 (not (= 2 |old(~E_3~0)|))) (.cse13 (not (= 0 |old(~t2_pc~0)|))) (.cse14 (not (= 0 ~t3_pc~0))) (.cse6 (not (= 0 |old(~t3_st~0)|))) (.cse44 (< ~local~0 |old(~token~0)|)) (.cse45 (< |old(~token~0)| ~local~0)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse23 (< 0 |old(~t2_pc~0)|)) (.cse20 (or .cse10 .cse11 .cse16)) (.cse7 (not .cse42)) (.cse47 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse48 (= 1 ~t2_pc~0)) (.cse49 (= ~m_st~0 2)) (.cse41 (= |old(~E_3~0)| ~E_3~0)) (.cse50 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~T1_E~0 0)) (.cse22 (= ~T2_E~0 1)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse25 (= ~T3_E~0 1)) (.cse28 (= ~T2_E~0 0)) (.cse29 (= 0 ~M_E~0)) (.cse30 (= 1 ~M_E~0)) (.cse39 (< |old(~t1_st~0)| 2)) (.cse1 (= 1 |old(~E_3~0)|)) (.cse33 (= 1 ~E_1~0)) (.cse0 (= 0 |old(~E_3~0)|)) (.cse12 (not (= ~t1_pc~0 1))) (.cse27 (not .cse40)) (.cse26 (< |old(~t3_st~0)| 2)) (.cse31 (= 1 ~E_M~0)) (.cse46 (not (= 1 |old(~t2_pc~0)|))) (.cse32 (= ~T1_E~0 1)) (.cse34 (not .cse43)) (.cse35 (= 0 ~E_1~0)) (.cse36 (< ~E_2~0 2)) (.cse37 (= 0 ~E_M~0))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) (or .cse3 .cse4 .cse5 .cse17 .cse18 .cse19 (not (= 1 ~t1_i~0)) .cse20 .cse2 .cse14 .cse15 .cse7 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse8 (not (= 1 ~t2_i~0)) .cse13 .cse9) (or .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (or .cse21 .cse22 .cse23 .cse25 .cse28 .cse29 .cse30 .cse17 .cse1 .cse33 .cse20 .cse0 .cse27 .cse26 .cse31 .cse32 .cse7 .cse35 .cse36 .cse37 .cse38) (or .cse21 .cse22 .cse23 .cse0 .cse24 .cse12 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse39 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse23 .cse0 .cse24 .cse12 .cse25 .cse40 .cse28 .cse29 .cse30 .cse31 .cse39 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or (and (= ~m_st~0 |old(~m_st~0)|) .cse41) .cse21 .cse22 .cse0 .cse25 .cse28 .cse29 .cse30 .cse31 .cse32 .cse1 .cse33 .cse35 .cse37 (= 0 ~E_2~0) .cse42 .cse43) (or .cse21 .cse22 .cse24 .cse25 .cse28 .cse29 .cse30 .cse17 .cse15 .cse32 .cse8 .cse36 (or .cse18 .cse19 .cse34 .cse13 .cse14 .cse6)) (or .cse21 .cse22 .cse23 .cse24 .cse44 .cse25 .cse28 .cse29 .cse30 .cse17 .cse1 .cse33 .cse0 .cse45 .cse12 .cse26 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse23 .cse0 .cse44 .cse24 .cse12 .cse45 .cse25 .cse40 .cse28 .cse29 .cse30 .cse17 .cse31 .cse32 .cse1 .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse0 .cse24 .cse12 .cse25 .cse40 .cse28 .cse29 .cse30 .cse31 .cse46 .cse39 .cse32 .cse1 .cse33 .cse34 (and .cse47 .cse48 .cse49 .cse41 .cse50) .cse35 .cse36 .cse37) (or .cse21 .cse22 .cse23 .cse25 .cse28 .cse29 .cse30 .cse39 .cse1 .cse33 .cse20 .cse0 .cse12 .cse27 .cse26 .cse31 .cse32 .cse7 .cse35 .cse36 .cse37) (let ((.cse51 (+ ~local~0 1))) (or (and .cse47 .cse48 (= ~token~0 |old(~token~0)|) .cse49 .cse41 .cse50) .cse21 .cse22 .cse24 .cse25 .cse28 .cse29 .cse30 .cse39 .cse1 (< |old(~token~0)| .cse51) .cse33 .cse0 .cse12 .cse27 .cse26 .cse31 .cse46 .cse32 .cse34 .cse35 .cse36 (< .cse51 |old(~token~0)|) .cse37))))) [2018-12-02 03:28:50,506 INFO L448 ceAbstractionStarter]: For program point L718(line 718) no Hoare annotation was computed. [2018-12-02 03:28:50,507 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 712 723) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-02 03:28:50,511 INFO L444 ceAbstractionStarter]: At program point L717(line 717) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 712 723) no Hoare annotation was computed. [2018-12-02 03:28:50,511 INFO L444 ceAbstractionStarter]: At program point L717-1(line 717) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~m_i~0 1) (= ~t3_pc~0 0) (= ~t2_i~0 1) (= ~t1_i~0 1) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t3_i~0 1) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0))) [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 712 723) no Hoare annotation was computed. [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-02 03:28:50,511 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-02 03:28:50,511 INFO L451 ceAbstractionStarter]: At program point L640(line 640) the Hoare annotation is: true [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point L640-1(line 640) no Hoare annotation was computed. [2018-12-02 03:28:50,511 INFO L451 ceAbstractionStarter]: At program point L649(lines 638 651) the Hoare annotation is: true [2018-12-02 03:28:50,511 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 634 652) no Hoare annotation was computed. [2018-12-02 03:28:50,512 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 634 652) the Hoare annotation is: true [2018-12-02 03:28:50,512 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2018-12-02 03:28:50,512 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 634 652) no Hoare annotation was computed. [2018-12-02 03:28:50,513 INFO L444 ceAbstractionStarter]: At program point L247(lines 235 249) the Hoare annotation is: (let ((.cse28 (= 1 ~t3_pc~0))) (let ((.cse44 (not .cse28)) (.cse8 (= ~T1_E~0 0)) (.cse9 (= ~T2_E~0 1)) (.cse17 (= 0 ~E_3~0)) (.cse26 (= ~T3_E~0 1)) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse19 (= 1 ~E_M~0)) (.cse21 (= ~T1_E~0 1)) (.cse23 (= 0 ~E_1~0)) (.cse24 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0))) (let ((.cse38 (or .cse8 .cse9 .cse17 .cse26 .cse28 .cse11 .cse12 .cse13 .cse19 .cse21 .cse23 .cse24 .cse27)) (.cse49 (= 1 ~m_pc~0)) (.cse51 (+ ~local~0 3)) (.cse14 (= 1 ~E_3~0)) (.cse36 (= 0 ~m_st~0)) (.cse50 (or .cse8 .cse9 .cse17 .cse26 .cse44 .cse11 .cse12 .cse13 .cse19 .cse21 .cse23 .cse24)) (.cse52 (+ ~local~0 2))) (let ((.cse34 (not (= ~t1_pc~0 0))) (.cse35 (not (= 2 ~E_3~0))) (.cse39 (not (= 0 ~m_pc~0))) (.cse30 (not (= 0 ~t3_st~0))) (.cse31 (not (= 0 ~t3_pc~0))) (.cse32 (not (= 2 ~E_M~0))) (.cse37 (not (= 0 ~t2_pc~0))) (.cse18 (< .cse52 ~token~0)) (.cse25 (< ~token~0 .cse52)) (.cse46 (or .cse21 .cse8 .cse9 .cse17 .cse23 .cse24 .cse27 .cse26 .cse44 .cse11 .cse12 .cse13)) (.cse29 (< 0 ~t1_pc~0)) (.cse42 (or .cse14 .cse36 .cse50)) (.cse43 (< .cse51 ~token~0)) (.cse41 (not .cse36)) (.cse45 (< ~token~0 .cse51)) (.cse10 (not (= 2 ~m_st~0))) (.cse15 (= 1 ~E_1~0)) (.cse22 (not .cse49)) (.cse0 (or .cse14 .cse36 .cse50 .cse49)) (.cse3 (not (= 0 ~t2_st~0))) (.cse4 (< 0 ~t2_pc~0)) (.cse47 (< ~local~0 ~token~0)) (.cse48 (< ~token~0 ~local~0)) (.cse7 (< ~t3_st~0 2)) (.cse33 (not (= ~t1_st~0 0))) (.cse20 (not (= 1 ~t2_pc~0))) (.cse2 (< ~t1_st~0 2)) (.cse16 (< ~t2_st~0 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (< ~E_2~0 2)) (.cse1 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse40 (or .cse14 .cse36 .cse38 .cse49))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse14 .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse20 .cse21 .cse22 .cse23 .cse6 .cse24 .cse1 .cse25) (or .cse1 .cse8 .cse9 .cse4 .cse17 .cse10 .cse5 .cse26 .cse7 .cse11 .cse12 .cse13 .cse19 .cse21 .cse14 .cse15 .cse3 .cse22 .cse23 .cse24 .cse27) (or .cse8 .cse9 .cse17 .cse10 .cse5 .cse26 .cse28 .cse11 .cse12 .cse13 .cse19 .cse20 .cse2 .cse21 .cse15 .cse22 .cse23 .cse1 .cse6 .cse24) (or .cse8 .cse16 .cse9 .cse17 .cse10 .cse1 .cse26 .cse28 .cse11 .cse12 .cse19 .cse20 .cse21 .cse14 .cse15 .cse22 .cse23 .cse6 .cse24 .cse29) (or .cse30 .cse31 .cse32 .cse33 .cse34 (not .cse15) .cse3 .cse35 .cse1 .cse6 .cse36 .cse37 .cse38 .cse39) (or .cse20 .cse16 .cse6 .cse1 .cse29 .cse40) (or .cse8 .cse16 .cse9 .cse17 .cse10 .cse28 .cse11 .cse12 .cse13 .cse19 .cse20 .cse21 .cse14 .cse15 .cse22 .cse23 .cse6 .cse24 .cse1 .cse29) (or .cse8 .cse16 .cse9 .cse17 .cse10 .cse1 .cse7 .cse11 .cse12 .cse13 .cse19 .cse20 .cse21 .cse14 .cse15 .cse22 .cse23 .cse6 .cse24 .cse29) (or .cse20 .cse0 .cse16 .cse6 .cse7 .cse1 .cse29) (or .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse2 .cse15 .cse17 .cse18 .cse5 .cse7 .cse19 .cse20 .cse21 .cse22 .cse1 .cse23 .cse6 .cse24 .cse25) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse34 .cse35 (not (= 0 ~local~0)) .cse33) (not (= 1 ~t1_i~0)) .cse39 (not (= ~T2_E~0 2)) .cse30 .cse31 .cse32 .cse41 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse3 .cse1 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse37 (not (= 2 ~M_E~0))) (or .cse8 .cse16 .cse9 .cse17 .cse10 .cse5 .cse26 .cse28 .cse11 .cse12 .cse19 .cse20 .cse2 .cse21 .cse14 .cse15 .cse22 .cse23 .cse6 .cse24 .cse1) (or .cse20 .cse2 .cse42 .cse16 .cse5 .cse6 .cse1 .cse7) (or .cse8 .cse1 .cse9 .cse10 .cse26 .cse11 .cse12 .cse2 .cse14 .cse15 .cse16 .cse17 .cse5 .cse7 .cse19 .cse20 .cse21 .cse22 .cse23 .cse6 .cse24) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse14 .cse15 .cse1 .cse16 .cse17 .cse5 .cse7 .cse19 .cse20 .cse21 .cse22 .cse23 .cse6 .cse24) (or .cse8 .cse9 .cse11 .cse12 .cse13 .cse43 .cse2 .cse14 .cse15 .cse1 .cse16 .cse17 .cse5 .cse7 .cse44 .cse19 .cse20 .cse21 .cse41 .cse23 .cse6 .cse24 .cse45) (or .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse2 .cse14 .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse20 .cse21 .cse22 .cse23 .cse6 .cse24 .cse1 .cse25) (or .cse16 .cse5 .cse1 .cse43 .cse20 .cse2 .cse41 .cse14 .cse15 .cse6 .cse46 .cse45) (or .cse20 .cse16 .cse47 .cse5 .cse48 .cse6 .cse1 .cse40 .cse33) (or .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse40) (or .cse16 .cse10 .cse5 .cse20 .cse2 .cse14 .cse15 .cse22 .cse6 .cse1 .cse46) (or .cse8 .cse16 .cse1 .cse9 .cse17 .cse10 .cse5 .cse28 .cse11 .cse12 .cse13 .cse19 .cse20 .cse2 .cse21 .cse14 .cse15 .cse22 .cse23 .cse6 .cse24) (or .cse8 .cse16 .cse9 .cse17 .cse10 .cse26 .cse7 .cse11 .cse1 .cse12 .cse19 .cse20 .cse21 .cse14 .cse15 .cse22 .cse23 .cse6 .cse24 .cse29) (or .cse0 .cse3 .cse4 .cse6 .cse7 .cse29 .cse1) (or .cse20 .cse42 .cse16 .cse47 .cse5 .cse48 .cse6 .cse1 .cse7 .cse33) (or .cse8 .cse9 .cse26 .cse11 .cse12 .cse43 .cse2 .cse14 .cse15 .cse16 .cse1 .cse17 .cse5 .cse7 .cse44 .cse19 .cse20 .cse21 .cse41 .cse23 .cse6 .cse24 .cse45) (or .cse3 .cse4 .cse1 .cse47 .cse5 .cse48 .cse6 .cse40 .cse33) (or .cse8 .cse9 .cse4 .cse17 .cse1 .cse10 .cse5 .cse26 .cse28 .cse11 .cse12 .cse13 .cse19 .cse21 .cse14 .cse15 .cse3 .cse22 .cse23 .cse24 .cse27) (or .cse0 .cse3 .cse4 .cse47 .cse5 .cse48 .cse6 .cse7 .cse1 .cse33) (or .cse20 .cse2 .cse16 .cse5 .cse6 .cse1 .cse40)))))) [2018-12-02 03:28:50,514 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 232 250) no Hoare annotation was computed. [2018-12-02 03:28:50,515 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2018-12-02 03:28:50,515 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 245) no Hoare annotation was computed. [2018-12-02 03:28:50,515 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 245) no Hoare annotation was computed. [2018-12-02 03:28:50,515 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 232 250) the Hoare annotation is: true [2018-12-02 03:28:50,516 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 232 250) no Hoare annotation was computed. [2018-12-02 03:28:50,516 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 415 462) the Hoare annotation is: (let ((.cse24 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse19 (< 0 ~t1_pc~0)) (.cse2 (not (= 2 ~m_st~0))) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse3 (= |old(~T3_E~0)| 1)) (.cse4 (= |old(~T2_E~0)| 0)) (.cse5 (= 0 |old(~M_E~0)|)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse9 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) .cse24 .cse25)) (.cse21 (< ~t1_st~0 2)) (.cse7 (= 1 |old(~E_3~0)|)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse10 (< ~t2_st~0 2)) (.cse11 (= 0 |old(~E_3~0)|)) (.cse22 (not (= ~t1_pc~0 1))) (.cse20 (= 1 ~t3_pc~0)) (.cse12 (< ~t3_st~0 2)) (.cse13 (= 1 |old(~E_M~0)|)) (.cse14 (not (= 1 ~t2_pc~0))) (.cse15 (= |old(~T1_E~0)| 1)) (.cse26 (= 0 ~m_st~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (< |old(~E_2~0)| 2)) (.cse18 (= 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 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse2 .cse3 .cse20 .cse4 .cse9 .cse5 .cse6 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse23 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 (< .cse23 ~token~0) .cse22 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~token~0 .cse23))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 ~local~0)) (not (= ~t1_st~0 0))) (not (= 1 ~t1_i~0)) (not (= 0 ~m_pc~0)) (not (= |old(~T2_E~0)| 2)) (not (= 0 ~t3_st~0)) (not (= 0 ~t3_pc~0)) (not (= 2 |old(~E_M~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|)) (and (= ~T2_E~0 2) .cse24 (= ~E_3~0 2) (= ~E_1~0 2) (= ~E_M~0 2) (= ~T3_E~0 2) (= ~E_2~0 2) .cse25)) (or .cse9 .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8 .cse16 .cse18 (= 0 |old(~E_2~0)|) .cse26 (= 1 ~m_pc~0)) (let ((.cse27 (+ ~local~0 3))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (< .cse27 ~token~0) .cse9 .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 (not .cse20) .cse12 .cse13 .cse14 .cse15 (not .cse26) .cse16 .cse17 .cse18 (< ~token~0 .cse27)))))) [2018-12-02 03:28:50,516 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,516 INFO L448 ceAbstractionStarter]: For program point L434-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,516 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,516 INFO L448 ceAbstractionStarter]: For program point L449-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,517 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,517 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 415 462) no Hoare annotation was computed. [2018-12-02 03:28:50,518 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,518 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 415 462) no Hoare annotation was computed. [2018-12-02 03:28:50,518 INFO L448 ceAbstractionStarter]: For program point L419-1(lines 418 461) no Hoare annotation was computed. [2018-12-02 03:28:50,518 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 194 212) no Hoare annotation was computed. [2018-12-02 03:28:50,518 INFO L444 ceAbstractionStarter]: At program point L209(lines 197 211) the Hoare annotation is: (let ((.cse20 (= 1 ~t3_pc~0)) (.cse17 (= 0 ~m_st~0)) (.cse46 (+ ~local~0 3)) (.cse47 (+ ~local~0 2)) (.cse48 (+ ~local~0 1))) (let ((.cse7 (not (= ~t1_pc~0 0))) (.cse8 (not (= 2 ~E_3~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse9 (not (= 0 ~m_pc~0))) (.cse10 (not (= 0 ~t3_st~0))) (.cse11 (not (= 0 ~t3_pc~0))) (.cse12 (not (= 2 ~E_M~0))) (.cse18 (not (= 0 ~t2_pc~0))) (.cse36 (< ~token~0 .cse48)) (.cse38 (< .cse48 ~token~0)) (.cse44 (< .cse47 ~token~0)) (.cse45 (< ~token~0 .cse47)) (.cse40 (< .cse46 ~token~0)) (.cse42 (not .cse17)) (.cse43 (< ~token~0 .cse46)) (.cse32 (< 0 ~t1_pc~0)) (.cse35 (= 1 ~m_pc~0)) (.cse39 (< 0 ~t2_pc~0)) (.cse19 (not (= 2 ~m_st~0))) (.cse13 (= 1 ~E_1~0)) (.cse15 (not (= 0 ~t2_st~0))) (.cse37 (= 0 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse23 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (= ~T2_E~0 1)) (.cse33 (< ~local~0 ~token~0)) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse21 (< ~t1_st~0 2)) (.cse22 (= 1 ~E_3~0)) (.cse24 (< ~t2_st~0 2)) (.cse25 (= 0 ~E_3~0)) (.cse26 (not (= ~t1_pc~0 1))) (.cse34 (< ~token~0 ~local~0)) (.cse31 (< ~t3_st~0 2)) (.cse41 (not .cse20)) (.cse27 (= 1 ~E_M~0)) (.cse28 (not (= 1 ~t2_pc~0))) (.cse14 (= ~T1_E~0 1)) (.cse29 (= 0 ~E_1~0)) (.cse16 (< ~E_2~0 2)) (.cse30 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15 (= is_master_triggered_~__retres1~0 0) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse2 .cse20 .cse3 .cse4 .cse21 .cse22 .cse13 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30) (or .cse0 .cse1 .cse19 .cse20 .cse3 .cse4 .cse5 .cse23 .cse21 .cse22 .cse13 .cse24 .cse25 .cse26 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse21 .cse22 .cse13 .cse24 .cse25 .cse26 .cse31 .cse23 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse22 .cse13 .cse24 .cse25 .cse31 .cse27 .cse28 .cse14 .cse23 .cse29 .cse16 .cse30 .cse32) (or .cse0 .cse1 .cse33 .cse2 .cse20 .cse3 .cse4 .cse5 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse34 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30 .cse17 .cse35) (or .cse0 .cse1 .cse19 .cse2 .cse20 .cse3 .cse4 .cse5 .cse22 .cse36 .cse13 .cse37 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse14 .cse29 .cse38 .cse30) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse21 .cse22 .cse13 .cse24 .cse25 .cse26 .cse23 .cse31 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse7 .cse8 (not (= 0 ~local~0)) .cse6) (not (= 1 ~t1_i~0)) .cse9 (not (= ~T2_E~0 2)) .cse10 .cse11 .cse12 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse15 .cse23 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse18 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse39 .cse33 .cse23 .cse2 .cse3 .cse4 .cse5 .cse21 .cse22 .cse25 .cse26 .cse34 .cse31 .cse27 .cse14 .cse15 .cse29 .cse16 .cse30 .cse17 .cse35) (or .cse0 .cse1 .cse39 .cse25 .cse33 .cse26 .cse34 .cse2 .cse20 .cse3 .cse4 .cse5 .cse27 .cse21 .cse14 .cse22 .cse15 .cse29 .cse16 .cse30 .cse17 .cse23 .cse35) (or .cse0 .cse1 .cse23 .cse3 .cse4 .cse5 .cse40 .cse21 .cse22 .cse13 .cse24 .cse25 .cse26 .cse31 .cse41 .cse27 .cse28 .cse14 .cse42 .cse29 .cse16 .cse30 .cse43) (or .cse0 .cse1 .cse25 .cse19 .cse26 .cse2 .cse20 .cse3 .cse23 .cse4 .cse5 .cse27 .cse28 .cse21 .cse14 .cse13 .cse29 .cse16 .cse30) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse21 .cse22 .cse13 .cse24 .cse25 .cse44 .cse26 .cse23 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30 .cse45) (or .cse23 .cse0 .cse1 .cse39 .cse25 .cse2 .cse31 .cse41 .cse3 .cse4 .cse5 .cse27 .cse14 .cse22 .cse15 .cse29 .cse16 .cse30 .cse17 .cse32 .cse35) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse40 .cse21 .cse22 .cse13 .cse24 .cse25 .cse26 .cse23 .cse28 .cse14 .cse29 .cse16 .cse30 .cse27 .cse43) (or .cse0 .cse24 .cse1 .cse25 .cse19 .cse2 .cse20 .cse3 .cse4 .cse27 .cse28 .cse14 .cse22 .cse13 .cse29 .cse16 .cse30 .cse23 .cse32) (or .cse23 .cse0 .cse1 .cse39 .cse25 .cse19 .cse26 .cse2 .cse20 .cse3 .cse4 .cse5 .cse27 .cse14 .cse22 .cse13 .cse15 .cse29 .cse30 .cse37) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse22 .cse13 .cse23 .cse24 .cse25 .cse31 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30 .cse32) (or .cse0 .cse24 .cse1 .cse25 .cse19 .cse20 .cse3 .cse4 .cse5 .cse27 .cse28 .cse14 .cse22 .cse13 .cse23 .cse29 .cse16 .cse30 .cse32) (or .cse0 .cse1 .cse23 .cse19 .cse2 .cse3 .cse4 .cse5 .cse21 .cse13 .cse25 .cse44 .cse26 .cse31 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30 .cse45) (or .cse0 .cse1 .cse25 .cse2 .cse23 .cse3 .cse4 .cse27 .cse14 .cse22 .cse13 .cse29 .cse30 .cse37 .cse17 .cse35) (or .cse0 .cse1 .cse19 .cse23 .cse2 .cse3 .cse4 .cse5 .cse22 .cse36 .cse13 .cse37 .cse24 .cse25 .cse26 .cse31 .cse27 .cse28 .cse14 .cse29 .cse38 .cse30) (or .cse0 .cse1 .cse25 .cse2 .cse41 .cse3 .cse4 .cse5 .cse14 .cse22 .cse13 .cse29 .cse30 .cse37 .cse23 .cse17 .cse35) (or .cse0 .cse23 .cse1 .cse25 .cse3 .cse4 .cse5 .cse27 .cse14 .cse22 .cse13 .cse29 .cse30 .cse37 .cse17 .cse35) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse23 .cse21 .cse22 .cse13 .cse24 .cse25 .cse44 .cse26 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30 .cse45) (or .cse0 .cse1 .cse25 .cse2 .cse23 .cse3 .cse4 .cse5 .cse27 .cse14 .cse13 .cse29 .cse30 .cse37 .cse17 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse40 .cse21 .cse22 .cse13 .cse24 .cse25 .cse26 .cse31 .cse41 .cse27 .cse28 .cse14 .cse42 .cse29 .cse16 .cse30 .cse23 .cse43) (or .cse0 .cse24 .cse1 .cse25 .cse2 .cse31 .cse23 .cse3 .cse4 .cse5 .cse27 .cse28 .cse14 .cse22 .cse29 .cse16 .cse30 .cse17 .cse32 .cse35) (or .cse0 .cse24 .cse1 .cse25 .cse2 .cse20 .cse3 .cse4 .cse5 .cse27 .cse28 .cse14 .cse22 .cse29 .cse16 .cse30 .cse17 .cse32 .cse35 .cse23) (or .cse0 .cse1 .cse39 .cse25 .cse19 .cse26 .cse23 .cse2 .cse31 .cse3 .cse4 .cse5 .cse27 .cse14 .cse22 .cse13 .cse15 .cse29 .cse30 .cse37) (or .cse0 .cse23 .cse1 .cse33 .cse2 .cse3 .cse4 .cse5 .cse21 .cse22 .cse24 .cse25 .cse26 .cse34 .cse31 .cse41 .cse27 .cse28 .cse14 .cse29 .cse16 .cse30 .cse17)))) [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 194 212) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 204) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 207) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 194 212) the Hoare annotation is: true [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L198-2(lines 198 207) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 574 621) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L603-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L593-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L583-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L608-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L598-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,520 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 574 621) the Hoare annotation is: (let ((.cse24 (= 0 ~m_st~0)) (.cse21 (< ~t3_st~0 2)) (.cse18 (< 0 ~t1_pc~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (= 0 |old(~E_3~0)|)) (.cse4 (not (= 2 ~m_st~0))) (.cse8 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse20 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T3_E~0)| 1)) (.cse6 (= 1 ~t3_pc~0)) (.cse7 (= |old(~T2_E~0)| 0)) (.cse9 (= 0 |old(~M_E~0)|)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse11 (not (= 1 ~t2_pc~0))) (.cse19 (< ~t1_st~0 2)) (.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 (< |old(~E_2~0)| 2)) (.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 .cse2 .cse4 .cse5 .cse7 .cse9 .cse19 .cse13 .cse14 .cse1 .cse3 .cse20 .cse21 .cse10 .cse11 .cse12 .cse8 .cse15 .cse16 .cse17) (let ((.cse22 (+ ~local~0 2))) (or .cse0 .cse2 .cse4 .cse5 .cse7 .cse9 .cse19 .cse13 .cse14 .cse8 .cse1 .cse3 (< .cse22 ~token~0) .cse20 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 (< ~token~0 .cse22))) (let ((.cse23 (+ ~local~0 3))) (or .cse0 .cse2 .cse5 .cse7 .cse9 (< .cse23 ~token~0) .cse19 .cse13 .cse14 .cse8 .cse1 .cse3 .cse20 .cse21 (not .cse6) .cse10 .cse11 .cse12 (not .cse24) .cse15 .cse16 .cse17 (< ~token~0 .cse23))) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 (= 0 |old(~E_2~0)|) .cse24 (= 1 ~m_pc~0)) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-02 03:28:50,520 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 577 620) no Hoare annotation was computed. [2018-12-02 03:28:50,521 INFO L448 ceAbstractionStarter]: For program point L613-1(lines 574 621) no Hoare annotation was computed. [2018-12-02 03:28:50,521 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2018-12-02 03:28:50,523 INFO L448 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-12-02 03:28:50,523 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 511 553) no Hoare annotation was computed. [2018-12-02 03:28:50,523 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 541) no Hoare annotation was computed. [2018-12-02 03:28:50,523 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-12-02 03:28:50,524 INFO L444 ceAbstractionStarter]: At program point L537-2(lines 537 541) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse12 (= ~T1_E~0 1)) (.cse3 (= ~T2_E~0 1)) (.cse8 (= ~T2_E~0 0))) (let ((.cse6 (= ~T3_E~0 1)) (.cse7 (= 1 ~t3_pc~0)) (.cse28 (= 1 ~m_pc~0)) (.cse80 (+ ~local~0 3)) (.cse82 (+ ~local~0 1)) (.cse68 (<= 2 ~t2_st~0)) (.cse84 (+ ~local~0 2)) (.cse81 (= ~m_st~0 2)) (.cse49 (= ~t1_st~0 0)) (.cse67 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse83 (= 0 ~t2_st~0)) (.cse69 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse27 (= 0 |old(~m_st~0)|)) (.cse70 (not .cse8)) (.cse71 (not .cse3)) (.cse72 (not (= ~M_E~0 0))) (.cse73 (not (= ~E_3~0 1))) (.cse46 (not (= ~m_pc~0 1))) (.cse74 (not (= ~M_E~0 1))) (.cse75 (not .cse12)) (.cse40 (= ~m_st~0 |old(~m_st~0)|)) (.cse76 (not (= ~E_1~0 1))) (.cse77 (not .cse1)) (.cse78 (not (= ~E_3~0 0))) (.cse79 (not (= ~E_1~0 0)))) (let ((.cse22 (and .cse70 .cse71 .cse72 (not (= ~t3_pc~0 1)) .cse73 .cse46 .cse74 (not (= ~E_M~0 1)) .cse75 .cse40 .cse76 .cse77 .cse78 .cse79)) (.cse36 (not .cse27)) (.cse23 (and .cse67 .cse40 .cse83 .cse69)) (.cse44 (and .cse67 .cse40 .cse83 .cse49)) (.cse24 (< 0 ~t2_pc~0)) (.cse39 (and .cse67 .cse81 .cse69)) (.cse42 (< .cse84 ~token~0)) (.cse43 (< ~token~0 .cse84)) (.cse29 (< ~local~0 ~token~0)) (.cse31 (and .cse67 .cse40 .cse68 .cse49)) (.cse33 (< ~token~0 ~local~0)) (.cse64 (< ~token~0 .cse82)) (.cse45 (and .cse67 .cse81 .cse83 .cse69)) (.cse65 (< .cse82 ~token~0)) (.cse35 (< .cse80 ~token~0)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse37 (and .cse67 .cse68 (= 0 ~m_st~0) .cse69)) (.cse0 (and .cse67 .cse81 .cse68 .cse69)) (.cse38 (< ~token~0 .cse80)) (.cse5 (not (= 2 |old(~m_st~0)|))) (.cse62 (= ~t1_st~0 2)) (.cse32 (not (= ~t1_pc~0 1))) (.cse63 (not (= |old(~t1_st~0)| 2))) (.cse15 (not .cse28)) (.cse60 (not (= 2 ~E_1~0))) (.cse55 (not (= |old(~t1_st~0)| 0))) (.cse53 (not (= ~t1_pc~0 0))) (.cse54 (not (= 2 ~E_3~0))) (.cse56 (not (= 0 ~m_pc~0))) (.cse57 (not (= 0 |old(~t3_st~0)|))) (.cse58 (not (= 0 ~t3_pc~0))) (.cse59 (not (= 2 ~E_M~0))) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse47 (= activate_threads_~tmp___0~0 0)) (.cse50 (= ~t3_st~0 0)) (.cse48 (= activate_threads_~tmp~1 0)) (.cse51 (= ~t2_st~0 0)) (.cse52 (= activate_threads_~tmp___1~0 0)) (.cse61 (not (= 0 ~t2_pc~0))) (.cse21 (< |old(~t3_st~0)| 2)) (.cse25 (not .cse7)) (.cse14 (= 1 ~E_1~0)) (.cse41 (= 0 ~E_2~0)) (.cse66 (and .cse70 .cse7 .cse71 .cse72 (not (= ~E_M~0 0)) .cse73 .cse46 .cse74 (not (= ~E_2~0 0)) .cse75 (not .cse6) .cse40 .cse76 .cse77 .cse78 .cse79)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse4 (= 0 ~E_3~0)) (.cse9 (= 0 ~M_E~0)) (.cse20 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse11 (not (= 1 ~t2_pc~0))) (.cse13 (= 1 ~E_3~0)) (.cse34 (and .cse67 .cse40 .cse68 .cse69)) (.cse16 (= 0 ~E_1~0)) (.cse17 (< ~E_2~0 2)) (.cse18 (= 0 ~E_M~0)) (.cse19 (< 0 ~t1_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 .cse1 .cse3 .cse5 .cse8 .cse9 .cse20 .cse13 .cse14 .cse2 .cse4 .cse21 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse0) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse0 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse22 .cse17 .cse18 .cse19) (or .cse23 .cse1 .cse3 .cse24 .cse4 .cse6 .cse21 .cse25 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse26 .cse16 .cse17 .cse18 .cse27 .cse19 .cse28) (or .cse1 .cse3 .cse29 .cse6 .cse8 .cse9 .cse20 .cse30 .cse13 .cse2 .cse4 .cse31 .cse32 .cse33 .cse21 .cse25 .cse34 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18 .cse27) (or .cse1 .cse3 .cse8 .cse9 .cse20 .cse35 .cse30 .cse13 .cse14 .cse2 .cse4 .cse32 .cse21 .cse25 .cse10 .cse11 .cse12 .cse36 .cse16 .cse17 .cse18 .cse37 .cse38) (or .cse1 .cse3 .cse4 .cse5 .cse32 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse30 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39) (or .cse1 .cse40 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse18 .cse41 .cse27 .cse28) (or .cse1 .cse3 .cse5 .cse8 .cse0 .cse9 .cse20 .cse30 .cse13 .cse14 .cse2 .cse4 .cse42 .cse32 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse43) (or .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse20 .cse10 .cse12 .cse40 .cse14 .cse16 .cse18 .cse41 .cse27 .cse28) (or .cse1 .cse37 .cse3 .cse6 .cse8 .cse9 .cse35 .cse30 .cse13 .cse14 .cse2 .cse4 .cse32 .cse21 .cse25 .cse10 .cse11 .cse12 .cse36 .cse16 .cse17 .cse18 .cse38) (or .cse1 .cse3 .cse5 .cse6 .cse8 .cse9 .cse30 .cse13 .cse14 .cse2 .cse4 .cse32 .cse21 .cse0 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18) (or .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse20 .cse30 .cse13 .cse14 .cse2 .cse4 .cse32 .cse10 .cse11 .cse12 .cse16 .cse0 .cse22 .cse17 .cse18) (or .cse1 .cse3 .cse0 .cse5 .cse6 .cse8 .cse9 .cse13 .cse14 .cse2 .cse4 .cse21 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse3 .cse24 .cse29 .cse6 .cse8 .cse9 .cse20 .cse30 .cse13 .cse44 .cse4 .cse32 .cse33 .cse21 .cse10 .cse23 .cse12 .cse26 .cse16 .cse17 .cse18 .cse27 .cse28) (or .cse1 .cse3 .cse24 .cse4 .cse5 .cse32 .cse6 .cse7 .cse8 .cse45 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse26 .cse16 .cse46 .cse18 .cse41) (or (and .cse47 .cse48 .cse49 (= ~m_st~0 0) .cse50 .cse51 .cse52) (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse53 .cse54 (not (= 0 ~local~0)) .cse55) (not (= 1 ~t1_i~0)) .cse56 (not (= ~T2_E~0 2)) .cse57 .cse58 .cse59 .cse36 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse26 .cse60 (not (= 1 ~t2_i~0)) .cse61 (not (= 2 ~M_E~0))) (or .cse1 .cse23 .cse3 .cse24 .cse29 .cse6 .cse7 .cse8 .cse9 .cse20 .cse30 .cse13 .cse44 .cse4 .cse32 .cse33 .cse10 .cse12 .cse26 .cse16 .cse17 .cse18 .cse27 .cse28) (or .cse1 .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse13 .cse14 .cse2 .cse4 .cse32 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18) (or .cse1 .cse3 .cse5 .cse0 .cse6 .cse8 .cse9 .cse30 .cse13 .cse14 .cse2 .cse4 .cse42 .cse32 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse43) (or .cse1 .cse3 .cse5 .cse6 .cse8 .cse9 .cse62 .cse54 .cse2 .cse32 .cse25 .cse21 .cse59 .cse11 .cse63 .cse12 .cse15 .cse60 .cse17) (or .cse1 .cse3 .cse4 .cse8 .cse9 .cse20 .cse40 .cse10 .cse12 .cse13 .cse14 .cse16 .cse18 .cse41 .cse27 .cse28) (or .cse1 .cse3 .cse24 .cse4 .cse5 .cse32 .cse6 .cse21 .cse8 .cse9 .cse20 .cse45 .cse10 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse18 .cse41) (or .cse1 .cse3 .cse5 .cse8 .cse9 .cse20 .cse30 .cse13 .cse0 .cse14 .cse2 .cse4 .cse32 .cse21 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18) (or .cse1 .cse3 .cse5 .cse0 .cse6 .cse8 .cse9 .cse20 .cse13 .cse64 .cse14 .cse41 .cse2 .cse4 .cse32 .cse21 .cse10 .cse11 .cse12 .cse15 .cse45 .cse16 .cse65 .cse18) (or .cse1 .cse3 .cse5 .cse6 .cse8 .cse9 .cse20 .cse30 .cse14 .cse39 .cse4 .cse42 .cse32 .cse21 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse43) (or .cse1 .cse3 .cse29 .cse6 .cse31 .cse7 .cse8 .cse9 .cse20 .cse30 .cse34 .cse13 .cse2 .cse4 .cse32 .cse33 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18 .cse27 .cse28) (or .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse13 .cse64 .cse14 .cse41 .cse45 .cse2 .cse4 .cse0 .cse32 .cse10 .cse11 .cse12 .cse15 .cse16 .cse65 .cse18) (or .cse1 .cse3 .cse5 .cse6 .cse8 .cse9 .cse20 .cse35 .cse30 .cse13 .cse14 .cse37 .cse0 .cse2 .cse4 .cse32 .cse25 .cse11 .cse12 .cse16 .cse17 .cse18 .cse66 .cse38) (or .cse1 .cse3 .cse5 .cse8 .cse9 .cse20 .cse54 .cse2 .cse62 .cse32 .cse25 .cse21 .cse59 .cse11 .cse63 .cse12 .cse15 .cse60 .cse17) (or .cse1 .cse3 .cse6 .cse8 .cse9 .cse20 .cse55 .cse53 .cse54 .cse56 .cse57 .cse58 .cse59 (not .cse14) .cse12 .cse26 .cse17 (and .cse47 .cse40 .cse50 .cse48 .cse49 .cse51 .cse52) .cse27 .cse61) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse21 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse34 .cse16 .cse17 .cse18 .cse27 .cse19 .cse28) (or .cse1 .cse3 .cse4 .cse6 .cse25 .cse8 .cse9 .cse20 .cse12 .cse13 .cse14 .cse16 .cse18 .cse41 .cse66 .cse27 .cse28) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse34 .cse16 .cse17 .cse18 .cse27 .cse19 .cse28))))) [2018-12-02 03:28:50,527 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2018-12-02 03:28:50,527 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-02 03:28:50,529 INFO L444 ceAbstractionStarter]: At program point L529-2(lines 529 533) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse18 (= 0 |old(~m_st~0)|)) (.cse8 (= ~T2_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse51 (not (= ~m_pc~0 1))) (.cse12 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse37 (= 1 ~t3_pc~0)) (.cse69 (+ ~local~0 3)) (.cse70 (+ ~local~0 2)) (.cse66 (= ~m_st~0 2)) (.cse67 (<= 2 ~t2_st~0)) (.cse68 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse65 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse71 (= 0 ~t2_st~0)) (.cse62 (= ~t1_st~0 0)) (.cse72 (+ ~local~0 1))) (let ((.cse22 (< ~token~0 .cse72)) (.cse29 (< .cse72 ~token~0)) (.cse48 (= ~t1_st~0 2)) (.cse47 (not (= |old(~t1_st~0)| 2))) (.cse50 (and .cse65 .cse38 .cse71 .cse62)) (.cse0 (and .cse65 .cse38 .cse71 .cse68)) (.cse42 (< ~local~0 ~token~0)) (.cse44 (and .cse65 .cse38 .cse67 .cse62)) (.cse43 (< ~token~0 ~local~0)) (.cse36 (and .cse65 .cse38 .cse67 .cse68)) (.cse3 (< 0 ~t2_pc~0)) (.cse52 (and .cse65 .cse66 .cse71 .cse68)) (.cse24 (= 0 ~E_2~0)) (.cse41 (and .cse65 .cse66 .cse68)) (.cse39 (< .cse70 ~token~0)) (.cse40 (< ~token~0 .cse70)) (.cse31 (< .cse69 ~token~0)) (.cse34 (and .cse65 .cse67 (= 0 ~m_st~0) .cse68)) (.cse7 (not .cse37)) (.cse35 (< ~token~0 .cse69)) (.cse10 (= 1 ~M_E~0)) (.cse32 (< |old(~t1_st~0)| 2)) (.cse26 (not (= ~t1_pc~0 1))) (.cse53 (and (not .cse8) (not .cse2) (not (= ~M_E~0 0)) (not (= ~t3_pc~0 1)) (not (= ~E_3~0 1)) .cse51 (not (= ~M_E~0 1)) (not (= ~E_M~0 1)) (not .cse12) .cse38 (not (= ~E_1~0 1)) (not .cse1) (not (= ~E_3~0 0)) (not (= ~E_1~0 0)))) (.cse59 (= activate_threads_~tmp___0~0 0)) (.cse61 (= activate_threads_~tmp~1 0)) (.cse60 (= ~t3_st~0 0)) (.cse63 (= ~t2_st~0 0)) (.cse55 (not (= ~t1_pc~0 0))) (.cse45 (not (= 2 ~E_3~0))) (.cse54 (not (= |old(~t1_st~0)| 0))) (.cse56 (not (= 0 ~m_pc~0))) (.cse57 (not (= 0 |old(~t3_st~0)|))) (.cse58 (not (= 0 ~t3_pc~0))) (.cse46 (not (= 2 ~E_M~0))) (.cse33 (not .cse18)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse49 (not (= 2 ~E_1~0))) (.cse64 (not (= 0 ~t2_pc~0))) (.cse6 (< |old(~t3_st~0)| 2)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse4 (= 0 ~E_3~0)) (.cse21 (not (= 2 |old(~m_st~0)|))) (.cse5 (= ~T3_E~0 1)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse27 (not (= 1 ~t2_pc~0))) (.cse13 (= 1 ~E_3~0)) (.cse23 (= 1 ~E_1~0)) (.cse28 (not .cse20)) (.cse15 (= 0 ~E_1~0)) (.cse16 (< ~E_2~0 2)) (.cse30 (and .cse65 .cse66 .cse67 .cse68)) (.cse17 (= 0 ~E_M~0)) (.cse19 (< 0 ~t1_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) (or .cse1 .cse2 .cse21 .cse5 .cse8 .cse9 .cse10 .cse13 .cse22 .cse23 .cse24 .cse25 .cse4 .cse26 .cse6 .cse11 .cse27 .cse12 .cse28 .cse15 .cse29 .cse17 .cse30) (or .cse1 .cse2 .cse8 .cse9 .cse10 .cse31 .cse32 .cse13 .cse23 .cse25 .cse4 .cse26 .cse6 .cse7 .cse11 .cse27 .cse12 .cse33 .cse15 .cse16 .cse17 .cse34 .cse35) (or .cse30 .cse1 .cse2 .cse21 .cse5 .cse8 .cse9 .cse10 .cse31 .cse32 .cse13 .cse23 .cse25 .cse34 .cse4 .cse26 .cse7 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17 .cse35) (or .cse1 .cse25 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse36 .cse19 .cse20) (or .cse1 .cse2 .cse30 .cse21 .cse8 .cse9 .cse10 .cse13 .cse23 .cse25 .cse4 .cse6 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17 .cse19) (or .cse1 .cse2 .cse21 .cse5 .cse37 .cse8 .cse9 .cse30 .cse10 .cse13 .cse22 .cse23 .cse24 .cse25 .cse4 .cse26 .cse11 .cse27 .cse12 .cse28 .cse15 .cse29 .cse17) (or .cse1 .cse38 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse23 .cse15 .cse17 .cse24 .cse18 .cse20) (or .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse38 .cse23 .cse15 .cse17 .cse24 .cse18 .cse20) (or .cse1 .cse2 .cse21 .cse5 .cse37 .cse8 .cse9 .cse32 .cse13 .cse23 .cse25 .cse4 .cse26 .cse30 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse21 .cse5 .cse8 .cse30 .cse9 .cse32 .cse13 .cse23 .cse25 .cse4 .cse39 .cse26 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17 .cse40) (or .cse1 .cse2 .cse21 .cse5 .cse8 .cse9 .cse32 .cse13 .cse23 .cse30 .cse25 .cse4 .cse26 .cse6 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse4 .cse38 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse23 .cse15 .cse17 .cse24 .cse18 .cse20) (or .cse1 .cse25 .cse2 .cse4 .cse5 .cse37 .cse8 .cse9 .cse10 .cse11 .cse27 .cse36 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse21 .cse8 .cse30 .cse9 .cse10 .cse32 .cse13 .cse23 .cse25 .cse4 .cse26 .cse6 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse4 .cse21 .cse41 .cse26 .cse5 .cse37 .cse8 .cse9 .cse10 .cse11 .cse27 .cse32 .cse12 .cse23 .cse28 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse42 .cse5 .cse8 .cse36 .cse9 .cse10 .cse32 .cse13 .cse25 .cse4 .cse26 .cse43 .cse6 .cse7 .cse11 .cse27 .cse12 .cse44 .cse15 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse21 .cse8 .cse9 .cse10 .cse45 .cse25 .cse26 .cse7 .cse6 .cse46 .cse27 .cse47 .cse12 .cse28 .cse48 .cse49 .cse16) (or .cse1 .cse0 .cse2 .cse3 .cse42 .cse5 .cse37 .cse8 .cse9 .cse10 .cse32 .cse13 .cse50 .cse4 .cse26 .cse43 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse1 .cse2 .cse21 .cse8 .cse9 .cse30 .cse10 .cse32 .cse13 .cse23 .cse25 .cse4 .cse39 .cse26 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17 .cse40) (or .cse1 .cse2 .cse3 .cse4 .cse21 .cse26 .cse5 .cse37 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse51 .cse17 .cse24 .cse52) (or .cse1 .cse2 .cse21 .cse5 .cse8 .cse9 .cse48 .cse45 .cse25 .cse26 .cse7 .cse6 .cse46 .cse27 .cse47 .cse12 .cse28 .cse49 .cse16) (or .cse1 .cse2 .cse4 .cse8 .cse9 .cse10 .cse38 .cse11 .cse12 .cse13 .cse23 .cse15 .cse17 .cse24 .cse18 .cse20) (or .cse1 .cse25 .cse2 .cse4 .cse21 .cse37 .cse8 .cse30 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse23 .cse53 .cse15 .cse16 .cse17 .cse19) (or .cse1 .cse2 .cse3 .cse42 .cse5 .cse8 .cse9 .cse10 .cse32 .cse13 .cse50 .cse4 .cse26 .cse43 .cse6 .cse0 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse1 .cse2 .cse42 .cse5 .cse37 .cse8 .cse9 .cse10 .cse44 .cse32 .cse13 .cse25 .cse4 .cse26 .cse43 .cse11 .cse27 .cse12 .cse15 .cse16 .cse17 .cse18 .cse36 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse21 .cse26 .cse5 .cse6 .cse8 .cse52 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse28 .cse15 .cse17 .cse24) (or .cse1 .cse2 .cse5 .cse8 .cse9 .cse10 .cse54 .cse55 .cse45 .cse56 .cse57 .cse58 .cse46 (not .cse23) .cse12 .cse14 (and .cse59 .cse38 .cse60 .cse61 .cse62 .cse63) .cse16 .cse18 .cse64) (or .cse1 .cse2 .cse21 .cse5 .cse8 .cse9 .cse10 .cse32 .cse23 .cse41 .cse4 .cse39 .cse26 .cse6 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17 .cse40) (or .cse1 .cse2 .cse5 .cse8 .cse9 .cse31 .cse32 .cse13 .cse23 .cse25 .cse34 .cse4 .cse26 .cse6 .cse7 .cse11 .cse27 .cse12 .cse33 .cse15 .cse16 .cse17 .cse35) (or .cse1 .cse2 .cse21 .cse37 .cse8 .cse30 .cse9 .cse10 .cse32 .cse13 .cse23 .cse25 .cse4 .cse26 .cse11 .cse27 .cse12 .cse15 .cse53 .cse16 .cse17) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (and .cse59 .cse61 .cse62 (= ~m_st~0 0) .cse60 .cse63) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse55 .cse45 (not (= 0 ~local~0)) .cse54) (not (= 1 ~t1_i~0)) .cse56 (not (= ~T2_E~0 2)) .cse57 .cse58 .cse46 .cse33 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse14 .cse49 (not (= 1 ~t2_i~0)) .cse64 (not (= 2 ~M_E~0))) (or .cse1 .cse2 .cse21 .cse5 .cse8 .cse9 .cse13 .cse23 .cse25 .cse4 .cse6 .cse11 .cse27 .cse12 .cse28 .cse15 .cse16 .cse17 .cse30 .cse19) (or .cse1 .cse25 .cse2 .cse4 .cse21 .cse5 .cse37 .cse8 .cse9 .cse11 .cse27 .cse12 .cse13 .cse23 .cse28 .cse15 .cse16 .cse30 .cse17 .cse19)))) [2018-12-02 03:28:50,531 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 525) no Hoare annotation was computed. [2018-12-02 03:28:50,533 INFO L444 ceAbstractionStarter]: At program point L519(line 519) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t3_pc~0)) (.cse64 (+ ~local~0 2)) (.cse60 (= ~m_st~0 2)) (.cse45 (= ~m_st~0 |old(~m_st~0)|)) (.cse61 (= 0 ~t2_st~0)) (.cse59 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse63 (<= 2 ~t2_st~0)) (.cse62 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (= 0 |old(~m_st~0)|)) (.cse65 (+ ~local~0 3)) (.cse66 (+ ~local~0 1))) (let ((.cse43 (< ~token~0 .cse66)) (.cse44 (< .cse66 ~token~0)) (.cse57 (= ~t3_st~0 0)) (.cse56 (= ~t1_st~0 0)) (.cse58 (= ~t2_st~0 0)) (.cse51 (not (= |old(~t1_st~0)| 0))) (.cse50 (not (= ~t1_pc~0 0))) (.cse52 (not (= 0 ~m_pc~0))) (.cse53 (not (= 0 |old(~t3_st~0)|))) (.cse54 (not (= 0 ~t3_pc~0))) (.cse55 (not (= 0 ~t2_pc~0))) (.cse21 (< .cse65 ~token~0)) (.cse42 (not .cse30)) (.cse41 (and .cse59 .cse63 (= 0 ~m_st~0) .cse62)) (.cse25 (< ~token~0 .cse65)) (.cse31 (< 0 ~t1_pc~0)) (.cse26 (and .cse59 .cse45 .cse61 .cse62)) (.cse46 (< ~local~0 ~token~0)) (.cse33 (and .cse59 .cse45 .cse63 .cse62)) (.cse47 (< ~token~0 ~local~0)) (.cse6 (and .cse59 .cse60 .cse62)) (.cse48 (< .cse64 ~token~0)) (.cse49 (< ~token~0 .cse64)) (.cse34 (not (= 2 ~E_3~0))) (.cse24 (not .cse7)) (.cse35 (not (= 2 ~E_M~0))) (.cse37 (= ~t1_st~0 2)) (.cse36 (not (= |old(~t1_st~0)| 2))) (.cse38 (not (= 2 ~E_1~0))) (.cse13 (< |old(~t1_st~0)| 2)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse28 (< |old(~t3_st~0)| 2)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse20 (and .cse59 .cse60 .cse63 .cse62)) (.cse18 (< ~E_2~0 2)) (.cse27 (< 0 ~t2_pc~0)) (.cse40 (and .cse59 .cse60 .cse61 .cse62)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T3_E~0 1)) (.cse29 (not (= 0 |old(~t2_st~0)|))) (.cse16 (not .cse32)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse14 (= ~T1_E~0 1)) (.cse22 (= 1 ~E_3~0)) (.cse15 (= 1 ~E_1~0)) (.cse17 (= 0 ~E_1~0)) (.cse19 (= 0 ~E_M~0)) (.cse39 (= 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) (or .cse0 .cse20 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse21 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse24 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25) (or .cse26 .cse0 .cse1 .cse27 .cse2 .cse5 .cse28 .cse24 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse29 .cse17 .cse18 .cse19 .cse30 .cse31 .cse32) (or .cse0 .cse23 .cse33 .cse1 .cse2 .cse5 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse17 .cse18 .cse19 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse28 .cse11 .cse12 .cse20 .cse14 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse34 .cse23 .cse4 .cse24 .cse28 .cse35 .cse12 .cse36 .cse14 .cse37 .cse16 .cse38 .cse18) (or .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse28 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse29 .cse16 .cse17 .cse19 .cse39 .cse40) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse0 .cse1 .cse5 .cse8 .cse9 .cse21 .cse13 .cse22 .cse15 .cse41 .cse23 .cse2 .cse4 .cse28 .cse24 .cse11 .cse12 .cse14 .cse42 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse23 .cse20 .cse1 .cse2 .cse3 .cse5 .cse28 .cse8 .cse9 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse22 .cse43 .cse15 .cse39 .cse20 .cse23 .cse2 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse44 .cse19) (or .cse0 .cse1 .cse2 .cse45 .cse5 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse19 .cse39 .cse30 .cse32) (or .cse0 .cse1 .cse27 .cse46 .cse5 .cse8 .cse9 .cse10 .cse13 .cse22 .cse26 .cse2 .cse4 .cse47 .cse28 .cse11 .cse14 .cse29 .cse17 .cse18 .cse19 .cse30 .cse32) (or .cse0 .cse23 .cse33 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse17 .cse18 .cse19 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse13 .cse22 .cse15 .cse23 .cse2 .cse20 .cse48 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49) (or .cse20 .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse22 .cse43 .cse15 .cse39 .cse23 .cse2 .cse4 .cse28 .cse11 .cse12 .cse14 .cse16 .cse17 .cse44 .cse19) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse20 .cse16 .cse17 .cse18 .cse19) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse50 .cse34 (not (= 0 ~local~0)) .cse51) (not (= 1 ~t1_i~0)) .cse52 (not (= ~T2_E~0 2)) .cse53 .cse54 .cse35 .cse42 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse29 .cse38 (not (= 1 ~t2_i~0)) .cse55 (not (= 2 ~M_E~0)) (and .cse56 (= ~m_st~0 0) .cse57 .cse58)) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse20 .cse9 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse0 .cse1 (and .cse45 .cse57 .cse56 .cse58) .cse5 .cse8 .cse9 .cse10 .cse51 .cse50 .cse34 .cse52 .cse53 .cse54 .cse35 (not .cse15) .cse14 .cse29 .cse18 .cse30 .cse55) (or .cse0 .cse33 .cse1 .cse46 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13 .cse22 .cse23 .cse2 .cse4 .cse47 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse30 .cse32) (or .cse0 .cse1 .cse8 .cse9 .cse10 .cse21 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse28 .cse24 .cse11 .cse12 .cse14 .cse42 .cse41 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse26 .cse0 .cse1 .cse27 .cse2 .cse46 .cse4 .cse47 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse29 .cse17 .cse18 .cse19 .cse30 .cse32) (or .cse0 .cse1 .cse46 .cse5 .cse8 .cse33 .cse9 .cse10 .cse13 .cse22 .cse23 .cse2 .cse4 .cse47 .cse28 .cse24 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse30) (or .cse0 .cse1 .cse2 .cse5 .cse8 .cse9 .cse11 .cse14 .cse22 .cse15 .cse17 .cse45 .cse19 .cse39 .cse30 .cse32) (or .cse0 .cse1 .cse2 .cse5 .cse24 .cse8 .cse9 .cse10 .cse14 .cse22 .cse45 .cse15 .cse17 .cse19 .cse39 .cse30 .cse32) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse13 .cse15 .cse2 .cse48 .cse4 .cse28 .cse11 .cse12 .cse6 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse13 .cse22 .cse15 .cse20 .cse23 .cse2 .cse48 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse34 .cse23 .cse4 .cse24 .cse28 .cse35 .cse37 .cse12 .cse36 .cse14 .cse16 .cse38 .cse18) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse28 .cse11 .cse12 .cse14 .cse16 .cse20 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse2 .cse40 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse29 .cse16 .cse17 .cse19 .cse39) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse45 .cse17 .cse19 .cse39 .cse30 .cse32)))) [2018-12-02 03:28:50,535 INFO L444 ceAbstractionStarter]: At program point L521-2(lines 521 525) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse17 (= ~T1_E~0 1)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0))) (let ((.cse39 (= 1 ~m_pc~0)) (.cse30 (= 1 ~t3_pc~0)) (.cse38 (= 0 |old(~m_st~0)|)) (.cse64 (<= 2 ~t2_st~0)) (.cse67 (= 0 ~m_st~0)) (.cse81 (+ ~local~0 3)) (.cse82 (+ ~local~0 2)) (.cse63 (= ~m_st~0 2)) (.cse65 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse80 (= 0 ~t2_st~0)) (.cse66 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse69 (not .cse4)) (.cse70 (not .cse1)) (.cse71 (not (= ~M_E~0 0))) (.cse72 (not (= ~E_3~0 1))) (.cse68 (= ~m_st~0 0)) (.cse54 (not (= ~m_pc~0 1))) (.cse73 (not (= ~M_E~0 1))) (.cse74 (not (= ~E_2~0 0))) (.cse75 (not (= ~E_M~0 1))) (.cse76 (not .cse17)) (.cse48 (= ~m_st~0 |old(~m_st~0)|)) (.cse77 (not (= ~E_1~0 1))) (.cse78 (not .cse0)) (.cse79 (not (= ~E_3~0 0))) (.cse83 (+ ~local~0 1))) (let ((.cse8 (< ~token~0 .cse83)) (.cse20 (< .cse83 ~token~0)) (.cse31 (and .cse69 .cse70 .cse71 (not (= ~E_M~0 0)) (not (= ~t3_pc~0 1)) .cse72 (not .cse68) .cse54 .cse73 .cse74 .cse75 .cse76 .cse48 .cse77 .cse78 .cse79 (not (= ~E_1~0 0)))) (.cse59 (= ~t1_st~0 2)) (.cse58 (not (= |old(~t1_st~0)| 2))) (.cse36 (and .cse65 .cse48 .cse80 .cse66)) (.cse57 (and .cse65 .cse63 .cse66)) (.cse55 (< .cse82 ~token~0)) (.cse56 (< ~token~0 .cse82)) (.cse23 (< .cse81 ~token~0)) (.cse28 (and .cse65 .cse64 .cse67 .cse66)) (.cse29 (< ~token~0 .cse81)) (.cse50 (= activate_threads_~tmp~1 0)) (.cse51 (= ~t1_st~0 0)) (.cse49 (= ~t3_st~0 0)) (.cse52 (= ~t2_st~0 0)) (.cse42 (not (= ~t1_pc~0 0))) (.cse43 (not (= 2 ~E_3~0))) (.cse41 (not (= |old(~t1_st~0)| 0))) (.cse44 (not (= 0 ~m_pc~0))) (.cse45 (not (= 0 |old(~t3_st~0)|))) (.cse46 (not (= 0 ~t3_pc~0))) (.cse47 (not (= 2 ~E_M~0))) (.cse26 (not .cse38)) (.cse61 (not (= 2 ~E_1~0))) (.cse53 (not (= 0 ~t2_pc~0))) (.cse33 (< 0 ~t2_pc~0)) (.cse37 (not (= 0 |old(~t2_st~0)|))) (.cse62 (and .cse65 .cse63 .cse80 .cse66)) (.cse60 (and .cse69 .cse30 .cse70 .cse71 .cse72 .cse54 .cse73 .cse74 .cse75 .cse76 .cse48 .cse77 .cse78 .cse79)) (.cse10 (= 0 ~E_2~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse9 (= 1 ~E_1~0)) (.cse18 (not .cse39)) (.cse22 (and .cse65 .cse63 .cse64 .cse66)) (.cse32 (< 0 ~t1_pc~0)) (.cse34 (< ~local~0 ~token~0)) (.cse3 (= ~T3_E~0 1)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse40 (and .cse65 .cse48 .cse64 .cse66)) (.cse7 (= 1 ~E_3~0)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse12 (= 0 ~E_3~0)) (.cse13 (not (= ~t1_pc~0 1))) (.cse35 (< ~token~0 ~local~0)) (.cse14 (< |old(~t3_st~0)| 2)) (.cse25 (not .cse30)) (.cse15 (= 1 ~E_M~0)) (.cse16 (not (= 1 ~t2_pc~0))) (.cse19 (= 0 ~E_1~0)) (.cse27 (< ~E_2~0 2)) (.cse21 (= 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) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse23 .cse24 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse26 .cse19 .cse27 .cse21 .cse28 .cse29) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse30 .cse4 .cse22 .cse5 .cse6 .cse15 .cse16 .cse17 .cse7 .cse9 .cse19 .cse27 .cse21 .cse31 .cse32) (or .cse0 .cse1 .cse33 .cse12 .cse34 .cse13 .cse35 .cse3 .cse30 .cse4 .cse5 .cse6 .cse36 .cse15 .cse24 .cse17 .cse7 .cse37 .cse19 .cse27 .cse21 .cse38 .cse39) (or .cse0 .cse1 .cse22 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse32) (or .cse0 .cse1 .cse34 .cse3 .cse30 .cse4 .cse5 .cse6 .cse24 .cse7 .cse11 .cse12 .cse13 .cse35 .cse40 .cse15 .cse16 .cse17 .cse19 .cse27 .cse21 .cse38 .cse39) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 (not .cse9) .cse17 .cse37 (and .cse48 .cse49 .cse50 .cse51 .cse52) .cse27 .cse38 .cse53) (or .cse0 .cse1 .cse2 .cse30 .cse4 .cse5 .cse22 .cse6 .cse24 .cse7 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse27 .cse21 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse12 .cse30 .cse4 .cse5 .cse6 .cse15 .cse17 .cse7 .cse9 .cse19 .cse21 .cse10 .cse38 .cse31 .cse39) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse3 .cse30 .cse4 .cse5 .cse15 .cse16 .cse17 .cse7 .cse9 .cse19 .cse27 .cse22 .cse21 .cse54 .cse32) (or .cse0 .cse1 .cse12 .cse48 .cse3 .cse4 .cse5 .cse6 .cse15 .cse17 .cse9 .cse19 .cse21 .cse10 .cse38 .cse39) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse48 .cse5 .cse15 .cse17 .cse7 .cse9 .cse19 .cse21 .cse10 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse5 .cse24 .cse7 .cse9 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21) (or .cse0 .cse1 .cse33 .cse34 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse36 .cse12 .cse13 .cse35 .cse14 .cse15 .cse17 .cse37 .cse19 .cse27 .cse21 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse24 .cse7 .cse9 .cse11 .cse12 .cse55 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse56) (or .cse0 .cse1 .cse12 .cse57 .cse2 .cse13 .cse3 .cse30 .cse4 .cse5 .cse6 .cse15 .cse16 .cse24 .cse17 .cse9 .cse18 .cse19 .cse27 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse7 .cse9 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21) (or .cse0 .cse1 .cse12 .cse3 .cse25 .cse4 .cse5 .cse6 .cse17 .cse7 .cse9 .cse19 .cse21 .cse10 .cse48 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse43 .cse11 .cse13 .cse25 .cse14 .cse47 .cse16 .cse58 .cse17 .cse59 .cse60 .cse61 .cse27) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse5 .cse6 .cse24 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse22 .cse6 .cse24 .cse7 .cse9 .cse11 .cse12 .cse55 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse56) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse59 .cse43 .cse11 .cse13 .cse25 .cse14 .cse47 .cse16 .cse58 .cse17 .cse18 .cse61 .cse27) (or .cse0 .cse1 .cse33 .cse12 .cse3 .cse14 .cse25 .cse4 .cse5 .cse6 .cse15 .cse17 .cse7 .cse37 .cse36 .cse19 .cse27 .cse21 .cse38 .cse32 .cse39) (or .cse0 .cse1 .cse33 .cse12 .cse2 .cse13 .cse3 .cse14 .cse4 .cse62 .cse5 .cse6 .cse15 .cse17 .cse7 .cse9 .cse37 .cse18 .cse19 .cse21 .cse10) (or .cse0 .cse1 .cse2 (and .cse63 .cse64 .cse65 .cse66) .cse3 (and .cse64 .cse67 .cse65 .cse66) .cse4 .cse5 .cse6 .cse23 .cse24 .cse7 .cse9 .cse11 .cse12 .cse13 .cse25 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse9 .cse57 .cse12 .cse55 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse56) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse23 .cse24 .cse7 .cse9 .cse11 .cse28 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse26 .cse19 .cse27 .cse21 .cse29) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (and .cse50 .cse51 .cse68 .cse49 .cse52) (or (not (= ~token~0 0)) .cse42 .cse43 (not (= 0 ~local~0)) .cse41) (not (= 1 ~t1_i~0)) .cse44 (not (= ~T2_E~0 2)) .cse45 .cse46 .cse47 .cse26 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse37 .cse61 (not (= 1 ~t2_i~0)) .cse53 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse33 .cse12 .cse2 .cse13 .cse3 .cse30 .cse4 .cse5 .cse6 .cse15 .cse17 .cse7 .cse9 .cse37 .cse18 .cse19 .cse21 .cse10 .cse62) (or .cse0 .cse11 .cse1 .cse12 .cse3 .cse14 .cse4 .cse5 .cse6 .cse15 .cse16 .cse17 .cse7 .cse40 .cse19 .cse27 .cse21 .cse38 .cse32 .cse39) (or .cse0 .cse1 .cse12 .cse25 .cse4 .cse5 .cse6 .cse15 .cse17 .cse7 .cse9 .cse60 .cse19 .cse21 .cse10 .cse38 .cse39) (or .cse0 .cse11 .cse1 .cse12 .cse3 .cse30 .cse4 .cse5 .cse6 .cse15 .cse16 .cse17 .cse7 .cse19 .cse27 .cse21 .cse38 .cse40 .cse32 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse34 .cse3 .cse4 .cse5 .cse6 .cse24 .cse40 .cse7 .cse11 .cse12 .cse13 .cse35 .cse14 .cse25 .cse15 .cse16 .cse17 .cse19 .cse27 .cse21 .cse38))))) [2018-12-02 03:28:50,539 INFO L448 ceAbstractionStarter]: For program point L519-1(line 519) no Hoare annotation was computed. [2018-12-02 03:28:50,539 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 511 553) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t3_pc~0)) (.cse64 (+ ~local~0 2)) (.cse60 (= ~m_st~0 2)) (.cse45 (= ~m_st~0 |old(~m_st~0)|)) (.cse61 (= 0 ~t2_st~0)) (.cse59 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse63 (<= 2 ~t2_st~0)) (.cse62 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (= 0 |old(~m_st~0)|)) (.cse65 (+ ~local~0 3)) (.cse66 (+ ~local~0 1))) (let ((.cse43 (< ~token~0 .cse66)) (.cse44 (< .cse66 ~token~0)) (.cse57 (= ~t3_st~0 0)) (.cse56 (= ~t1_st~0 0)) (.cse58 (= ~t2_st~0 0)) (.cse51 (not (= |old(~t1_st~0)| 0))) (.cse50 (not (= ~t1_pc~0 0))) (.cse52 (not (= 0 ~m_pc~0))) (.cse53 (not (= 0 |old(~t3_st~0)|))) (.cse54 (not (= 0 ~t3_pc~0))) (.cse55 (not (= 0 ~t2_pc~0))) (.cse21 (< .cse65 ~token~0)) (.cse42 (not .cse30)) (.cse41 (and .cse59 .cse63 (= 0 ~m_st~0) .cse62)) (.cse25 (< ~token~0 .cse65)) (.cse31 (< 0 ~t1_pc~0)) (.cse26 (and .cse59 .cse45 .cse61 .cse62)) (.cse46 (< ~local~0 ~token~0)) (.cse33 (and .cse59 .cse45 .cse63 .cse62)) (.cse47 (< ~token~0 ~local~0)) (.cse6 (and .cse59 .cse60 .cse62)) (.cse48 (< .cse64 ~token~0)) (.cse49 (< ~token~0 .cse64)) (.cse34 (not (= 2 ~E_3~0))) (.cse24 (not .cse7)) (.cse35 (not (= 2 ~E_M~0))) (.cse37 (= ~t1_st~0 2)) (.cse36 (not (= |old(~t1_st~0)| 2))) (.cse38 (not (= 2 ~E_1~0))) (.cse13 (< |old(~t1_st~0)| 2)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse28 (< |old(~t3_st~0)| 2)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse20 (and .cse59 .cse60 .cse63 .cse62)) (.cse18 (< ~E_2~0 2)) (.cse27 (< 0 ~t2_pc~0)) (.cse40 (and .cse59 .cse60 .cse61 .cse62)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T3_E~0 1)) (.cse29 (not (= 0 |old(~t2_st~0)|))) (.cse16 (not .cse32)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse14 (= ~T1_E~0 1)) (.cse22 (= 1 ~E_3~0)) (.cse15 (= 1 ~E_1~0)) (.cse17 (= 0 ~E_1~0)) (.cse19 (= 0 ~E_M~0)) (.cse39 (= 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) (or .cse0 .cse20 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse21 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse24 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25) (or .cse26 .cse0 .cse1 .cse27 .cse2 .cse5 .cse28 .cse24 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse29 .cse17 .cse18 .cse19 .cse30 .cse31 .cse32) (or .cse0 .cse23 .cse33 .cse1 .cse2 .cse5 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse17 .cse18 .cse19 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse28 .cse11 .cse12 .cse20 .cse14 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse34 .cse23 .cse4 .cse24 .cse28 .cse35 .cse12 .cse36 .cse14 .cse37 .cse16 .cse38 .cse18) (or .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse28 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse29 .cse16 .cse17 .cse19 .cse39 .cse40) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse0 .cse1 .cse5 .cse8 .cse9 .cse21 .cse13 .cse22 .cse15 .cse41 .cse23 .cse2 .cse4 .cse28 .cse24 .cse11 .cse12 .cse14 .cse42 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse23 .cse20 .cse1 .cse2 .cse3 .cse5 .cse28 .cse8 .cse9 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse22 .cse43 .cse15 .cse39 .cse20 .cse23 .cse2 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse44 .cse19) (or .cse0 .cse1 .cse2 .cse45 .cse5 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse19 .cse39 .cse30 .cse32) (or .cse0 .cse1 .cse27 .cse46 .cse5 .cse8 .cse9 .cse10 .cse13 .cse22 .cse26 .cse2 .cse4 .cse47 .cse28 .cse11 .cse14 .cse29 .cse17 .cse18 .cse19 .cse30 .cse32) (or .cse0 .cse23 .cse33 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse17 .cse18 .cse19 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse13 .cse22 .cse15 .cse23 .cse2 .cse20 .cse48 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49) (or .cse20 .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse22 .cse43 .cse15 .cse39 .cse23 .cse2 .cse4 .cse28 .cse11 .cse12 .cse14 .cse16 .cse17 .cse44 .cse19) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse20 .cse16 .cse17 .cse18 .cse19) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse50 .cse34 (not (= 0 ~local~0)) .cse51) (not (= 1 ~t1_i~0)) .cse52 (not (= ~T2_E~0 2)) .cse53 .cse54 .cse35 .cse42 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse29 .cse38 (not (= 1 ~t2_i~0)) .cse55 (not (= 2 ~M_E~0)) (and .cse56 (= ~m_st~0 0) .cse57 .cse58)) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse20 .cse9 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse0 .cse1 (and .cse45 .cse57 .cse56 .cse58) .cse5 .cse8 .cse9 .cse10 .cse51 .cse50 .cse34 .cse52 .cse53 .cse54 .cse35 (not .cse15) .cse14 .cse29 .cse18 .cse30 .cse55) (or .cse0 .cse33 .cse1 .cse46 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13 .cse22 .cse23 .cse2 .cse4 .cse47 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse30 .cse32) (or .cse0 .cse1 .cse8 .cse9 .cse10 .cse21 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse28 .cse24 .cse11 .cse12 .cse14 .cse42 .cse41 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse26 .cse0 .cse1 .cse27 .cse2 .cse46 .cse4 .cse47 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse29 .cse17 .cse18 .cse19 .cse30 .cse32) (or .cse0 .cse1 .cse46 .cse5 .cse8 .cse33 .cse9 .cse10 .cse13 .cse22 .cse23 .cse2 .cse4 .cse47 .cse28 .cse24 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse30) (or .cse0 .cse1 .cse2 .cse5 .cse8 .cse9 .cse11 .cse14 .cse22 .cse15 .cse17 .cse45 .cse19 .cse39 .cse30 .cse32) (or .cse0 .cse1 .cse2 .cse5 .cse24 .cse8 .cse9 .cse10 .cse14 .cse22 .cse45 .cse15 .cse17 .cse19 .cse39 .cse30 .cse32) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse13 .cse15 .cse2 .cse48 .cse4 .cse28 .cse11 .cse12 .cse6 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse13 .cse22 .cse15 .cse20 .cse23 .cse2 .cse48 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse34 .cse23 .cse4 .cse24 .cse28 .cse35 .cse37 .cse12 .cse36 .cse14 .cse16 .cse38 .cse18) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse28 .cse11 .cse12 .cse14 .cse16 .cse20 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse2 .cse40 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse29 .cse16 .cse17 .cse19 .cse39) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse45 .cse17 .cse19 .cse39 .cse30 .cse32)))) [2018-12-02 03:28:50,548 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 511 553) no Hoare annotation was computed. [2018-12-02 03:28:50,548 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 554 564) no Hoare annotation was computed. [2018-12-02 03:28:50,548 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 554 564) the Hoare annotation is: (let ((.cse31 (= 1 ~m_pc~0)) (.cse45 (+ ~local~0 1)) (.cse46 (<= 2 ~t2_st~0)) (.cse42 (= ~m_st~0 2)) (.cse41 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse32 (= ~m_st~0 |old(~m_st~0)|)) (.cse43 (= 0 ~t2_st~0)) (.cse44 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= 1 ~t3_pc~0))) (let ((.cse24 (not .cse7)) (.cse34 (< ~local~0 ~token~0)) (.cse25 (and .cse41 .cse32 .cse43 .cse44)) (.cse35 (< ~token~0 ~local~0)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse6 (and .cse41 .cse42 .cse44)) (.cse33 (and .cse41 .cse32 .cse46 .cse44)) (.cse18 (< ~E_2~0 2)) (.cse29 (= 0 |old(~m_st~0)|)) (.cse30 (< 0 ~t1_pc~0)) (.cse20 (and .cse41 .cse42 .cse46 .cse44)) (.cse38 (< ~token~0 .cse45)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse27 (< |old(~t3_st~0)| 2)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse39 (< .cse45 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse26 (< 0 ~t2_pc~0)) (.cse2 (= 0 ~E_3~0)) (.cse37 (and .cse41 .cse42 .cse43 .cse44)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse14 (= ~T1_E~0 1)) (.cse22 (= 1 ~E_3~0)) (.cse15 (= 1 ~E_1~0)) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse16 (not .cse31)) (.cse17 (= 0 ~E_1~0)) (.cse19 (= 0 ~E_M~0)) (.cse36 (= 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) (let ((.cse21 (+ ~local~0 3))) (or .cse0 .cse20 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 (< .cse21 ~token~0) .cse13 .cse22 .cse15 .cse23 .cse2 .cse4 .cse24 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse21))) (or .cse25 .cse0 .cse1 .cse26 .cse2 .cse5 .cse27 .cse24 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse28 .cse17 .cse18 .cse19 .cse29 .cse30 .cse31) (or .cse0 .cse1 (and .cse32 (= ~t3_st~0 0) (= ~t1_st~0 0) (= ~t2_st~0 0)) .cse5 .cse8 .cse9 .cse10 (not (= |old(~t1_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 0 ~m_pc~0)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not .cse15) .cse14 .cse28 .cse18 .cse29 (not (= 0 ~t2_pc~0))) (or .cse0 .cse23 .cse33 .cse1 .cse2 .cse5 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse17 .cse18 .cse19 .cse29 .cse30 .cse31) (or .cse0 .cse33 .cse1 .cse34 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13 .cse22 .cse23 .cse2 .cse4 .cse35 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse29 .cse31) (or .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse27 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse28 .cse16 .cse17 .cse19 .cse36 .cse37) (or .cse32 .cse0 .cse1 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse19 .cse36 .cse29 .cse31) (or .cse25 .cse0 .cse1 .cse26 .cse2 .cse34 .cse4 .cse35 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse28 .cse17 .cse18 .cse19 .cse29 .cse31) (or .cse0 .cse1 .cse34 .cse5 .cse8 .cse33 .cse9 .cse10 .cse13 .cse22 .cse23 .cse2 .cse4 .cse35 .cse27 .cse24 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse29) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse22 .cse38 .cse15 .cse36 .cse20 .cse23 .cse2 .cse4 .cse11 .cse12 .cse14 .cse16 .cse17 .cse39 .cse19) (or .cse0 .cse1 .cse2 .cse5 .cse24 .cse8 .cse9 .cse10 .cse14 .cse22 .cse32 .cse15 .cse17 .cse19 .cse36 .cse29 .cse31) (or .cse0 .cse1 .cse26 .cse34 .cse5 .cse8 .cse9 .cse10 .cse13 .cse22 .cse25 .cse2 .cse4 .cse35 .cse27 .cse11 .cse14 .cse28 .cse17 .cse18 .cse19 .cse29 .cse31) (let ((.cse40 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse13 .cse15 .cse2 (< .cse40 ~token~0) .cse4 .cse27 .cse11 .cse12 .cse6 .cse14 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse40))) (or .cse0 .cse23 .cse33 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse17 .cse18 .cse19 .cse29 .cse30 .cse31) (or .cse20 .cse0 .cse1 .cse3 .cse5 .cse8 .cse9 .cse10 .cse22 .cse38 .cse15 .cse36 .cse23 .cse2 .cse4 .cse27 .cse11 .cse12 .cse14 .cse16 .cse17 .cse39 .cse19) (or .cse0 .cse1 .cse26 .cse2 .cse37 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse22 .cse15 .cse28 .cse16 .cse17 .cse19 .cse36)))) [2018-12-02 03:28:50,549 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 554 564) no Hoare annotation was computed. [2018-12-02 03:28:50,555 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 328) no Hoare annotation was computed. [2018-12-02 03:28:50,555 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 306 335) no Hoare annotation was computed. [2018-12-02 03:28:50,555 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 329) no Hoare annotation was computed. [2018-12-02 03:28:50,555 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 330) no Hoare annotation was computed. [2018-12-02 03:28:50,555 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 306 335) the Hoare annotation is: true [2018-12-02 03:28:50,556 INFO L444 ceAbstractionStarter]: At program point L332(lines 309 334) the Hoare annotation is: (let ((.cse50 (+ ~local~0 1)) (.cse47 (not (= ~token~0 0))) (.cse48 (not (= 0 ~local~0))) (.cse49 (not (= 0 ~m_pc~0))) (.cse31 (= 1 ~t3_pc~0))) (let ((.cse26 (not .cse31)) (.cse9 (or .cse47 .cse48 .cse49)) (.cse27 (< 0 ~t1_pc~0)) (.cse41 (not (= ~t1_st~0 2))) (.cse35 (not (= 2 ~E_2~0))) (.cse36 (not (= ~T3_E~0 2))) (.cse37 (not (= ~T1_E~0 2))) (.cse45 (not (= ~t1_pc~0 0))) (.cse46 (not (= 2 ~E_3~0))) (.cse34 (not (= ~T2_E~0 2))) (.cse38 (not (= 0 ~t3_st~0))) (.cse39 (not (= 0 ~t3_pc~0))) (.cse40 (not (= 2 ~E_M~0))) (.cse17 (not (= 0 ~m_st~0))) (.cse42 (not (= 2 ~E_1~0))) (.cse43 (not (= 0 ~t2_pc~0))) (.cse44 (not (= 2 ~M_E~0))) (.cse10 (< ~t2_st~0 2)) (.cse13 (< ~t3_st~0 2)) (.cse22 (< 0 ~t2_pc~0)) (.cse30 (< ~local~0 ~token~0)) (.cse32 (not (= ~t1_st~0 0))) (.cse33 (< ~token~0 ~local~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse23 (not (= 2 ~m_st~0))) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (< ~t1_st~0 2)) (.cse7 (= 1 ~E_3~0)) (.cse28 (< ~token~0 .cse50)) (.cse8 (= 1 ~E_1~0)) (.cse18 (= exists_runnable_thread_~__retres1~4 1)) (.cse11 (= 0 ~E_3~0)) (.cse12 (not (= ~t1_pc~0 1))) (.cse14 (= 1 ~E_M~0)) (.cse15 (not (= 1 ~t2_pc~0))) (.cse16 (= ~T1_E~0 1)) (.cse24 (not (= 0 ~t2_st~0))) (.cse25 (not (= 1 ~m_pc~0))) (.cse19 (= 0 ~E_1~0)) (.cse20 (< ~E_2~0 2)) (.cse29 (< .cse50 ~token~0)) (.cse21 (= 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) (or .cse0 .cse1 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse16 .cse24 .cse25 .cse19 .cse20 .cse21 .cse18) (or .cse0 .cse1 .cse22 .cse11 .cse23 .cse2 .cse13 .cse26 .cse3 .cse4 .cse5 .cse14 .cse18 .cse16 .cse7 .cse8 .cse24 .cse25 .cse19 .cse20 .cse21 .cse27) (or .cse0 .cse1 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse18 .cse25 .cse19 .cse20 .cse29 .cse21) (or .cse0 .cse1 .cse23 .cse30 .cse2 .cse3 .cse31 .cse4 .cse5 .cse32 .cse7 .cse8 .cse18 .cse10 .cse11 .cse33 .cse12 .cse14 .cse15 .cse16 .cse25 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse27) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse11 .cse12 .cse26 .cse13 .cse14 .cse16 .cse17 .cse24 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse18 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse32 .cse7 .cse8 .cse9 .cse11 .cse26 .cse13 .cse14 .cse18 .cse16 .cse17 .cse24 .cse19 .cse20 .cse21 .cse27) (or .cse7 .cse18 .cse9 .cse11 (or .cse34 .cse35 .cse12 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse17 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse32 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse27) (or .cse0 .cse1 .cse22 .cse11 .cse23 .cse12 .cse2 .cse31 .cse3 .cse4 .cse5 .cse14 .cse6 .cse16 .cse7 .cse8 .cse24 .cse25 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse35 .cse23 .cse2 .cse3 .cse4 .cse5 .cse32 .cse45 .cse46 .cse38 .cse39 .cse40 .cse16 .cse24 .cse25 .cse42 .cse43 .cse18) (or .cse0 .cse1 .cse35 .cse23 .cse2 .cse3 .cse4 .cse5 .cse18 .cse46 .cse10 .cse12 .cse38 .cse39 .cse40 .cse15 .cse41 .cse16 .cse25 .cse42) (or .cse0 .cse1 .cse22 .cse23 .cse30 .cse2 .cse3 .cse4 .cse5 .cse32 .cse7 .cse8 .cse18 .cse11 .cse33 .cse12 .cse13 .cse14 .cse16 .cse24 .cse25 .cse19 .cse20 .cse21) (or .cse18 .cse35 .cse36 .cse37 (or .cse47 .cse45 .cse46 .cse48 .cse32) (not (= 1 ~t1_i~0)) .cse49 .cse34 .cse38 .cse39 .cse40 .cse17 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse24 .cse42 (not (= 1 ~t2_i~0)) .cse43 .cse44) (or .cse0 .cse1 .cse23 .cse30 .cse2 .cse3 .cse4 .cse5 .cse32 .cse7 .cse8 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse19 .cse20 .cse21 .cse18) (or .cse0 .cse1 .cse22 .cse23 .cse30 .cse2 .cse3 .cse31 .cse4 .cse5 .cse32 .cse7 .cse8 .cse11 .cse33 .cse12 .cse14 .cse16 .cse24 .cse25 .cse19 .cse20 .cse18 .cse21) (or .cse0 .cse1 .cse23 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse18 .cse11 .cse12 .cse14 .cse15 .cse16 .cse24 .cse25 .cse19 .cse20 .cse29 .cse21)))) [2018-12-02 03:28:50,560 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 327) no Hoare annotation was computed. [2018-12-02 03:28:50,561 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 306 335) no Hoare annotation was computed. [2018-12-02 03:28:50,561 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,561 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 463 510) no Hoare annotation was computed. [2018-12-02 03:28:50,562 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 463 510) the Hoare annotation is: (let ((.cse25 (= |old(~T1_E~0)| ~T1_E~0)) (.cse26 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse23 (= 0 ~m_st~0)) (.cse5 (= 1 ~t3_pc~0)) (.cse20 (< ~t1_st~0 2)) (.cse21 (not (= ~t1_pc~0 1))) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (= 0 |old(~E_3~0)|)) (.cse4 (not (= 2 ~m_st~0))) (.cse22 (< ~t3_st~0 2)) (.cse6 (= |old(~T2_E~0)| 0)) (.cse8 (= 0 |old(~M_E~0)|)) (.cse9 (= 1 |old(~M_E~0)|)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse11 (not (= 1 ~t2_pc~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 (< |old(~E_2~0)| 2)) (.cse17 (= 0 |old(~E_M~0)|)) (.cse7 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) .cse25 .cse26)) (.cse18 (< 0 ~t1_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse19 (+ ~local~0 3))) (or .cse0 .cse2 .cse6 .cse8 .cse9 (< .cse19 ~token~0) .cse20 .cse13 .cse14 .cse1 .cse3 .cse21 .cse22 (not .cse5) .cse10 .cse11 .cse12 (not .cse23) .cse7 .cse15 .cse16 .cse17 (< ~token~0 .cse19))) (or .cse0 .cse2 .cse4 .cse6 .cse8 .cse9 .cse20 .cse13 .cse14 .cse1 .cse3 .cse21 .cse22 .cse10 .cse11 .cse7 .cse12 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 (= 0 |old(~E_2~0)|) .cse23 .cse7 (= 1 ~m_pc~0)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse7 .cse15 .cse16 .cse17) (let ((.cse24 (+ ~local~0 2))) (or .cse0 .cse2 .cse4 .cse6 .cse8 .cse9 .cse20 .cse13 .cse14 .cse1 .cse3 .cse7 (< .cse24 ~token~0) .cse21 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 (< ~token~0 .cse24))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 ~local~0)) (not (= ~t1_st~0 0))) (not (= 1 ~t1_i~0)) (not (= 0 ~m_pc~0)) (not (= |old(~T2_E~0)| 2)) (not (= 0 ~t3_st~0)) (not (= 0 ~t3_pc~0)) (not (= 2 |old(~E_M~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|)) (and (= ~T2_E~0 2) .cse25 (= ~E_3~0 2) (= ~E_1~0 2) (= ~E_M~0 2) (= ~T3_E~0 2) (= ~E_2~0 2) .cse26))))) [2018-12-02 03:28:50,562 INFO L448 ceAbstractionStarter]: For program point L467-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,562 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,562 INFO L448 ceAbstractionStarter]: For program point L482-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,562 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,562 INFO L448 ceAbstractionStarter]: For program point L497-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,562 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 463 510) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 466 509) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 213 231) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 226) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 213 231) the Hoare annotation is: true [2018-12-02 03:28:50,569 INFO L448 ceAbstractionStarter]: For program point L217-2(lines 217 226) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 213 231) no Hoare annotation was computed. [2018-12-02 03:28:50,569 INFO L444 ceAbstractionStarter]: At program point L228(lines 216 230) the Hoare annotation is: (let ((.cse28 (= 1 ~t3_pc~0))) (let ((.cse45 (+ ~local~0 2)) (.cse8 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (= 0 ~E_M~0)) (.cse13 (= 0 ~E_2~0)) (.cse4 (= ~T3_E~0 1)) (.cse33 (not .cse28)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse17 (= 1 ~M_E~0)) (.cse14 (= 0 ~m_st~0)) (.cse46 (+ ~local~0 3)) (.cse47 (+ ~local~0 1))) (let ((.cse37 (not (= ~t1_pc~0 0))) (.cse38 (not (= 2 ~E_3~0))) (.cse36 (not (= ~t1_st~0 0))) (.cse39 (not (= 0 ~m_pc~0))) (.cse40 (not (= 0 ~t3_st~0))) (.cse41 (not (= 0 ~t3_pc~0))) (.cse42 (not (= 2 ~E_M~0))) (.cse43 (not (= 0 ~t2_pc~0))) (.cse18 (< ~token~0 .cse47)) (.cse23 (< .cse47 ~token~0)) (.cse32 (< .cse46 ~token~0)) (.cse34 (not .cse14)) (.cse35 (< ~token~0 .cse46)) (.cse44 (or .cse8 .cse0 .cse1 .cse2 .cse11 .cse12 .cse13 .cse4 .cse33 .cse5 .cse6 .cse17)) (.cse30 (< 0 ~t2_pc~0)) (.cse21 (< ~t3_st~0 2)) (.cse31 (not (= 0 ~t2_st~0))) (.cse29 (< 0 ~t1_pc~0)) (.cse15 (= 1 ~m_pc~0)) (.cse16 (not (= 2 ~m_st~0))) (.cse24 (< ~t1_st~0 2)) (.cse9 (= 1 ~E_3~0)) (.cse10 (= 1 ~E_1~0)) (.cse3 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse19 (< ~t2_st~0 2)) (.cse25 (< .cse45 ~token~0)) (.cse20 (not (= ~t1_pc~0 1))) (.cse7 (= 1 ~E_M~0)) (.cse22 (not (= 1 ~t2_pc~0))) (.cse26 (< ~E_2~0 2)) (.cse27 (< ~token~0 .cse45))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse16 .cse4 .cse5 .cse6 .cse17 .cse9 .cse18 .cse10 .cse13 .cse19 .cse2 .cse20 .cse21 .cse7 .cse22 .cse8 .cse11 .cse3 .cse23 .cse12) (or .cse0 .cse1 .cse16 .cse4 .cse5 .cse6 .cse17 .cse24 .cse10 .cse3 .cse2 .cse25 .cse20 .cse21 .cse7 .cse22 .cse8 .cse11 .cse26 .cse12 .cse27) (or .cse0 .cse19 .cse1 .cse2 .cse16 .cse20 .cse28 .cse5 .cse3 .cse6 .cse17 .cse7 .cse22 .cse24 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12) (or .cse0 .cse19 .cse1 .cse2 .cse4 .cse21 .cse5 .cse6 .cse17 .cse7 .cse22 .cse8 .cse9 .cse3 .cse11 .cse26 .cse12 .cse14 .cse29 .cse15) (or .cse0 .cse1 .cse30 .cse2 .cse16 .cse20 .cse4 .cse28 .cse5 .cse6 .cse17 .cse7 .cse8 .cse3 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse32 .cse24 .cse9 .cse10 .cse19 .cse2 .cse20 .cse21 .cse33 .cse7 .cse22 .cse8 .cse34 .cse11 .cse26 .cse12 .cse35) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse17 .cse36 .cse37 .cse3 .cse38 .cse39 .cse40 .cse41 .cse42 .cse8 .cse31 .cse11 .cse26 .cse14 .cse43) (or .cse0 .cse1 .cse16 .cse5 .cse6 .cse17 .cse24 .cse9 .cse10 .cse19 .cse2 .cse3 .cse20 .cse21 .cse7 .cse22 .cse8 .cse11 .cse26 .cse12) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse20 .cse4 .cse28 .cse5 .cse6 .cse17 .cse7 .cse22 .cse24 .cse8 .cse10 .cse11 .cse26 .cse12) (or .cse0 .cse19 .cse1 .cse2 .cse16 .cse4 .cse21 .cse5 .cse6 .cse3 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse29) (or .cse0 .cse1 (< ~local~0 ~token~0) .cse10 .cse4 .cse5 .cse6 .cse17 .cse24 .cse9 .cse19 .cse2 .cse20 (< ~token~0 ~local~0) .cse21 .cse33 .cse7 .cse22 .cse8 .cse11 .cse26 .cse12 .cse14 .cse3) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (= is_transmit1_triggered_~__retres1~1 0) (or (not (= ~token~0 0)) .cse37 .cse38 (not (= 0 ~local~0)) .cse36) (not (= 1 ~t1_i~0)) .cse39 (not (= ~T2_E~0 2)) .cse40 .cse41 .cse42 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse31 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse43 (not (= 2 ~M_E~0))) (or .cse19 .cse16 .cse20 .cse3 .cse22 .cse24 .cse9 .cse10 .cse26 .cse44) (or .cse0 .cse1 .cse16 .cse4 .cse28 .cse5 .cse6 .cse17 .cse9 .cse18 .cse10 .cse13 .cse19 .cse2 .cse20 .cse3 .cse7 .cse22 .cse8 .cse11 .cse23 .cse12) (or .cse0 .cse19 .cse3 .cse1 .cse2 .cse16 .cse4 .cse28 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse29) (or .cse0 .cse19 .cse1 .cse2 .cse16 .cse20 .cse4 .cse28 .cse5 .cse6 .cse7 .cse22 .cse24 .cse8 .cse9 .cse10 .cse11 .cse3 .cse26 .cse12) (or .cse0 .cse19 .cse1 .cse2 .cse16 .cse28 .cse5 .cse6 .cse17 .cse7 .cse22 .cse3 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse29) (or .cse0 .cse1 .cse16 .cse4 .cse5 .cse6 .cse3 .cse24 .cse9 .cse10 .cse19 .cse2 .cse20 .cse21 .cse7 .cse22 .cse8 .cse11 .cse26 .cse12) (or .cse0 .cse19 .cse1 .cse2 .cse4 .cse28 .cse5 .cse6 .cse17 .cse7 .cse22 .cse8 .cse9 .cse11 .cse26 .cse12 .cse14 .cse3 .cse29 .cse15) (or .cse0 .cse1 .cse5 .cse6 .cse17 .cse32 .cse24 .cse9 .cse10 .cse19 .cse2 .cse20 .cse21 .cse33 .cse7 .cse22 .cse8 .cse34 .cse3 .cse11 .cse26 .cse12 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse19 .cse1 .cse2 .cse16 .cse21 .cse5 .cse6 .cse17 .cse7 .cse22 .cse8 .cse9 .cse10 .cse3 .cse11 .cse26 .cse12 .cse29) (or .cse19 .cse20 .cse32 .cse22 .cse24 .cse34 .cse9 .cse10 .cse26 .cse3 .cse44 .cse35) (or .cse0 .cse1 .cse30 .cse2 .cse16 .cse20 .cse4 .cse21 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse3) (or .cse0 .cse1 .cse16 .cse4 .cse5 .cse6 .cse24 .cse9 .cse10 .cse19 .cse2 .cse25 .cse20 .cse7 .cse22 .cse3 .cse8 .cse11 .cse26 .cse12 .cse27) (or .cse9 .cse10 .cse3 .cse14 .cse44 .cse15) (or .cse0 .cse1 .cse30 .cse2 .cse4 .cse21 .cse33 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse3 .cse31 .cse11 .cse26 .cse12 .cse14 .cse29 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse16 .cse5 .cse6 .cse17 .cse24 .cse9 .cse10 .cse3 .cse19 .cse2 .cse25 .cse20 .cse7 .cse22 .cse8 .cse11 .cse26 .cse12 .cse27))))) [2018-12-02 03:28:50,571 INFO L448 ceAbstractionStarter]: For program point L287-1(lines 281 304) no Hoare annotation was computed. [2018-12-02 03:28:50,573 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 278 305) no Hoare annotation was computed. [2018-12-02 03:28:50,573 INFO L448 ceAbstractionStarter]: For program point L282-1(lines 281 304) no Hoare annotation was computed. [2018-12-02 03:28:50,573 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 278 305) the Hoare annotation is: (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 0 ~local~0)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= 0 ~m_pc~0)) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0)) (and (= ~t1_st~0 0) (= ~m_st~0 0) (= ~t3_st~0 0) (= ~t2_st~0 0))) [2018-12-02 03:28:50,573 INFO L448 ceAbstractionStarter]: For program point L297-1(lines 278 305) no Hoare annotation was computed. [2018-12-02 03:28:50,573 INFO L448 ceAbstractionStarter]: For program point L292-1(lines 281 304) no Hoare annotation was computed. [2018-12-02 03:28:50,573 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 42 85) no Hoare annotation was computed. [2018-12-02 03:28:50,573 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-02 03:28:50,574 INFO L444 ceAbstractionStarter]: At program point L50(lines 45 84) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse11 (= 0 ~E_3~0)) (.cse2 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse17 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_3~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 |old(~m_st~0)|)) (.cse33 (= 1 ~t3_pc~0)) (.cse34 (+ |old(~local~0)| 3))) (let ((.cse27 (not (= 0 |old(~t2_st~0)|))) (.cse23 (< 0 ~t2_pc~0)) (.cse6 (< .cse34 |old(~token~0)|)) (.cse13 (not .cse33)) (.cse22 (< |old(~token~0)| .cse34)) (.cse28 (< 0 ~t1_pc~0)) (.cse31 (or .cse0 .cse1 .cse11 .cse2 .cse33 .cse3 .cse4 .cse5 .cse15 .cse17 .cse8 .cse9 .cse18 .cse20 .cse21)) (.cse24 (not (= 0 |old(~local~0)|))) (.cse29 (< |old(~local~0)| |old(~token~0)|)) (.cse25 (not (= |old(~token~0)| 0))) (.cse7 (< |old(~t1_st~0)| 2)) (.cse26 (not (= 0 |old(~m_pc~0)|))) (.cse10 (< |old(~t2_st~0)| 2)) (.cse30 (< |old(~token~0)| |old(~local~0)|)) (.cse12 (not (= ~t1_pc~0 1))) (.cse14 (< |old(~t3_st~0)| 2)) (.cse16 (not (= 1 ~t2_pc~0))) (.cse19 (< ~E_2~0 2))) (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 (= 1 |old(~m_pc~0)|)) (or .cse0 .cse1 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse25 .cse8 .cse9 .cse26 .cse11 .cse13 .cse14 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21 .cse28) (or .cse0 .cse1 .cse23 .cse29 .cse2 .cse3 .cse4 .cse5 .cse25 .cse7 .cse8 .cse9 .cse26 .cse11 .cse30 .cse12 .cse14 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (or .cse25 (not (= ~t1_pc~0 0)) .cse24 .cse26 (not (= |old(~t1_st~0)| 0))) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse27 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse21 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse31 .cse7 .cse27 .cse23 .cse29 .cse24 .cse12 .cse30 .cse19 .cse26) (or .cse16 .cse31 .cse25 .cse10 .cse24 .cse19 .cse26 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse32 (+ ~local~0 3))) (and (= |old(~E_1~0)| ~E_1~0) (<= .cse32 ~token~0) (<= |old(~t3_st~0)| ~t3_st~0) (= ~m_st~0 |old(~m_st~0)|) (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse32) (<= 2 ~t2_st~0) (<= |old(~t1_st~0)| ~t1_st~0))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse25 .cse8 .cse9 .cse26 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28) (or .cse16 .cse31 .cse7 .cse10 .cse29 .cse24 .cse12 .cse30 .cse19 .cse26) (or .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse25 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse30 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-12-02 03:28:50,576 INFO L444 ceAbstractionStarter]: At program point L79(lines 42 85) the Hoare annotation is: (let ((.cse8 (= ~T1_E~0 0)) (.cse10 (= ~T3_E~0 1)) (.cse9 (= ~T2_E~0 1)) (.cse11 (= ~T2_E~0 0))) (let ((.cse18 (= 0 ~E_3~0)) (.cse29 (not (= 0 |old(~local~0)|))) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse23 (= 1 ~E_M~0)) (.cse16 (= 1 ~E_3~0)) (.cse17 (= 1 |old(~E_1~0)|)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 ~E_M~0)) (.cse28 (= 0 |old(~m_st~0)|)) (.cse48 (= 0 ~t2_st~0)) (.cse24 (= ~T1_E~0 1)) (.cse47 (= 1 ~t2_pc~0)) (.cse45 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse49 (= 1 ~t1_pc~0)) (.cse50 (not .cse11)) (.cse51 (not .cse9)) (.cse52 (not (= ~M_E~0 0))) (.cse53 (not (= ~E_3~0 1))) (.cse54 (not (= ~M_E~0 1))) (.cse39 (<= ~token~0 ~local~0)) (.cse40 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= ~m_pc~0 1)) (.cse55 (not .cse10)) (.cse56 (<= 2 ~t3_st~0)) (.cse36 (= ~m_st~0 2)) (.cse41 (not (= ~E_1~0 1))) (.cse42 (<= 2 ~t2_st~0)) (.cse57 (not .cse8)) (.cse37 (= ~t1_st~0 0)) (.cse58 (not (= ~E_3~0 0))) (.cse43 (not (= ~E_1~0 0))) (.cse44 (<= ~local~0 ~token~0)) (.cse46 (= 1 ~t3_pc~0))) (let ((.cse7 (< 0 ~t1_pc~0)) (.cse20 (not .cse46)) (.cse22 (and .cse49 .cse50 .cse46 .cse51 .cse52 .cse53 .cse54 .cse39 .cse40 .cse35 .cse55 .cse56 .cse36 .cse41 .cse42 .cse57 .cse37 .cse58 .cse43 .cse44)) (.cse25 (and .cse49 .cse50 .cse46 .cse51 .cse52 (<= 2 ~t1_st~0) .cse53 .cse54 .cse40 (not (= ~E_M~0 1)) .cse35 (not .cse24) .cse47 .cse55 .cse56 .cse36 .cse41 .cse42 .cse57 .cse58 .cse43 .cse45)) (.cse31 (< 0 ~t2_pc~0)) (.cse33 (< |old(~local~0)| |old(~token~0)|)) (.cse34 (< |old(~token~0)| |old(~local~0)|)) (.cse21 (< |old(~t3_st~0)| 2)) (.cse38 (and .cse39 .cse40 .cse35 .cse36 .cse41 .cse48 .cse37 .cse43 .cse44)) (.cse30 (and .cse40 .cse35 .cse36 .cse41 .cse48 .cse43 .cse45)) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse3 (< |old(~t2_st~0)| 2)) (.cse19 (not (= ~t1_pc~0 1))) (.cse0 (not .cse47)) (.cse1 (or .cse8 .cse9 .cse18 .cse29 .cse10 .cse46 .cse11 .cse12 .cse13 .cse23 .cse24 .cse16 .cse17 .cse26 .cse27 .cse28)) (.cse2 (not (= |old(~token~0)| 0))) (.cse15 (< |old(~t1_st~0)| 2)) (.cse5 (< ~E_2~0 2)) (.cse4 (and .cse40 .cse35 .cse36 .cse41 .cse42 .cse43 .cse45)) (.cse6 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse14 (+ |old(~local~0)| 3))) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< .cse14 |old(~token~0)|) .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse5 .cse27 .cse28 (< |old(~token~0)| .cse14))) (or .cse8 .cse9 .cse29 .cse10 .cse11 .cse12 .cse13 .cse2 .cse16 .cse17 .cse6 .cse3 .cse18 .cse21 .cse4 .cse23 .cse0 .cse24 .cse26 .cse5 .cse27 .cse28 .cse7) (or .cse8 .cse30 .cse9 .cse31 .cse29 .cse10 .cse11 .cse12 .cse13 .cse2 .cse16 .cse17 .cse6 .cse18 .cse20 .cse21 .cse23 .cse24 .cse32 .cse26 .cse5 .cse27 .cse28 .cse7) (or .cse8 .cse9 .cse33 .cse10 .cse11 .cse12 .cse13 .cse2 .cse15 .cse16 .cse17 .cse6 .cse3 .cse18 .cse34 .cse19 .cse20 .cse21 .cse22 .cse23 .cse0 .cse24 .cse25 .cse26 .cse5 .cse27 .cse28) (or (and (= ~E_1~0 2) .cse35 .cse36 (= ~t3_st~0 0) .cse37 (= ~t2_st~0 0)) (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (or .cse2 (not (= ~t1_pc~0 0)) .cse29 .cse6 (not (= |old(~t1_st~0)| 0))) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse32 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse28 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse31 .cse19 .cse1 .cse2 .cse15 .cse30 .cse32 .cse5 .cse6 .cse38) (or .cse8 .cse9 .cse31 .cse33 .cse10 .cse11 .cse12 .cse13 .cse2 .cse15 .cse16 .cse17 .cse6 .cse18 .cse34 .cse19 .cse21 .cse38 .cse23 .cse24 .cse30 .cse32 .cse26 .cse5 .cse27 .cse28) (or .cse3 (and .cse39 .cse40 .cse35 .cse36 .cse41 .cse42 .cse37 .cse43 .cse44) .cse19 .cse0 .cse1 .cse2 .cse15 .cse5 .cse4 .cse6))))) [2018-12-02 03:28:50,578 INFO L444 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 0 ~E_3~0)) (.cse4 (= ~T3_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse16 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 |old(~m_st~0)|)) (.cse31 (= 1 ~t3_pc~0))) (let ((.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse2 (< 0 ~t2_pc~0)) (.cse22 (< 0 ~t1_pc~0)) (.cse13 (not .cse31)) (.cse27 (or .cse0 .cse1 .cse12 .cse4 .cse31 .cse5 .cse6 .cse7 .cse15 .cse16 .cse9 .cse10 .cse18 .cse20 .cse21)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse23 (< |old(~local~0)| |old(~token~0)|)) (.cse8 (not (= |old(~token~0)| 0))) (.cse24 (< |old(~t1_st~0)| 2)) (.cse11 (not (= 0 |old(~m_pc~0)|))) (.cse29 (< |old(~t2_st~0)| 2)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse26 (not (= ~t1_pc~0 1))) (.cse14 (< |old(~t3_st~0)| 2)) (.cse28 (not (= 1 ~t2_pc~0))) (.cse19 (< ~E_2~0 2))) (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 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (or .cse8 (not (= ~t1_pc~0 0)) .cse3 .cse11 (not (= |old(~t1_st~0)| 0))) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse17 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse21 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse27 .cse24 .cse17 .cse2 .cse23 .cse3 .cse26 .cse25 .cse19 .cse11) (or .cse28 .cse27 .cse8 .cse29 .cse3 .cse19 .cse11 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse15 .cse28 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse30 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (< .cse30 |old(~token~0)|) .cse24 .cse9 .cse10 .cse29 .cse12 .cse26 .cse13 .cse14 .cse15 .cse28 .cse16 .cse18 .cse19 .cse20 .cse21 (< |old(~token~0)| .cse30))) (or .cse28 .cse27 .cse24 .cse29 .cse23 .cse3 .cse26 .cse25 .cse19 .cse11) (or .cse0 .cse1 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse11 .cse29 .cse12 .cse25 .cse26 .cse14 .cse15 .cse28 .cse16 .cse18 .cse19 .cse20 .cse21)))) [2018-12-02 03:28:50,580 INFO L444 ceAbstractionStarter]: At program point L71(lines 45 84) the Hoare annotation is: (let ((.cse49 (+ |old(~local~0)| 3)) (.cse46 (= ~m_pc~0 0)) (.cse37 (= 0 ~t2_st~0)) (.cse47 (= ~token~0 0)) (.cse48 (= ~local~0 0)) (.cse31 (= |old(~E_1~0)| ~E_1~0)) (.cse32 (not (= ~m_pc~0 1))) (.cse33 (<= ~token~0 ~local~0)) (.cse34 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse36 (= ~token~0 |old(~token~0)|)) (.cse42 (<= 2 ~t2_st~0)) (.cse38 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (<= ~local~0 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 ~E_3~0)) (.cse45 (not (= 0 |old(~local~0)|))) (.cse3 (= ~T3_E~0 1)) (.cse50 (= 1 ~t3_pc~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse18 (= 1 ~E_M~0)) (.cse20 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse23 (= 0 ~E_M~0)) (.cse24 (= 0 |old(~m_st~0)|))) (let ((.cse26 (or .cse0 .cse1 .cse13 .cse45 .cse3 .cse50 .cse4 .cse5 .cse6 .cse18 .cse20 .cse9 .cse10 .cse21 .cse23 .cse24)) (.cse14 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse42 .cse38 .cse39)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse15 (< |old(~token~0)| |old(~local~0)|)) (.cse29 (< 0 ~t2_pc~0)) (.cse30 (and .cse31 .cse46 .cse34 .cse35 .cse37 .cse47 .cse48 .cse38)) (.cse40 (< .cse49 |old(~token~0)|)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse16 (not (= ~t1_pc~0 1))) (.cse43 (not .cse50)) (.cse44 (< |old(~token~0)| .cse49)) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse7 (not (= |old(~token~0)| 0))) (.cse11 (not (= 0 |old(~m_pc~0)|))) (.cse12 (< |old(~t2_st~0)| 2)) (.cse17 (< |old(~t3_st~0)| 2)) (.cse19 (not (= 1 ~t2_pc~0))) (.cse22 (< ~E_2~0 2)) (.cse27 (< 0 ~t1_pc~0)) (.cse25 (and .cse31 .cse46 .cse34 .cse35 .cse42 .cse47 .cse48 .cse38))) (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 .cse25 .cse19 .cse26 .cse7 .cse12 .cse22 .cse11 .cse27) (or .cse26 .cse8 .cse28 .cse29 .cse30 .cse2 .cse16 .cse15 .cse22 .cse11) (or .cse12 .cse16 .cse19 .cse26 .cse7 .cse8 .cse14 .cse22 .cse11) (or .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse15 .cse16 .cse17 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse40 .cse8 .cse9 .cse10 (let ((.cse41 (+ ~local~0 3))) (and .cse31 (<= .cse41 ~token~0) .cse34 .cse35 .cse36 (<= ~token~0 .cse41) .cse42 .cse38)) .cse12 .cse13 .cse16 .cse43 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse44) (or .cse0 .cse1 .cse29 .cse45 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse30 .cse11 .cse13 .cse43 .cse17 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24 .cse27) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse40 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16 .cse43 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse44 (= 1 |old(~m_pc~0)|)) (or (and .cse35 (= ~t1_st~0 0) .cse46 (= ~E_1~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) .cse47 .cse48) (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (or .cse7 (not (= ~t1_pc~0 0)) .cse45 .cse11 (not (= |old(~t1_st~0)| 0))) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse28 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse24 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse45 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse27 .cse25)))) [2018-12-02 03:28:50,582 INFO L444 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (let ((.cse43 (= 0 ~t2_st~0)) (.cse26 (= 0 ~E_3~0)) (.cse42 (not (= 0 |old(~local~0)|))) (.cse21 (= ~T2_E~0 0)) (.cse22 (= 0 ~M_E~0)) (.cse23 (= 1 ~M_E~0)) (.cse30 (= 1 ~E_M~0)) (.cse31 (= ~T1_E~0 1)) (.cse24 (= 1 ~E_3~0)) (.cse25 (= 1 |old(~E_1~0)|)) (.cse33 (= 0 |old(~E_1~0)|)) (.cse34 (= 0 ~E_M~0)) (.cse35 (= 0 |old(~m_st~0)|)) (.cse44 (= 1 ~t3_pc~0)) (.cse45 (+ |old(~local~0)| 3)) (.cse17 (= ~T2_E~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse20 (= ~T3_E~0 1)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (<= 2 ~t2_st~0)) (.cse16 (= ~T1_E~0 0)) (.cse7 (not (= ~E_1~0 0))) (.cse8 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (<= ~local~0 ~token~0))) (let ((.cse36 (and (not .cse17) .cse2 .cse3 .cse4 (not .cse20) .cse5 .cse6 (not .cse16) .cse7 .cse8 .cse9)) (.cse39 (< .cse45 |old(~token~0)|)) (.cse41 (< |old(~token~0)| .cse45)) (.cse40 (not .cse44)) (.cse11 (or .cse16 .cse17 .cse26 .cse42 .cse20 .cse44 .cse21 .cse22 .cse23 .cse30 .cse31 .cse24 .cse25 .cse33 .cse34 .cse35)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse18 (< 0 ~t2_pc~0)) (.cse19 (< |old(~local~0)| |old(~token~0)|)) (.cse29 (and .cse2 .cse3 .cse4 .cse5 .cse43 .cse7 .cse8 .cse9)) (.cse1 (not (= ~t1_pc~0 1))) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (< |old(~t2_st~0)| 2)) (.cse28 (< |old(~t3_st~0)| 2)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse37 (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse14 (< ~E_2~0 2)) (.cse38 (< 0 ~t1_pc~0)) (.cse12 (not (= |old(~token~0)| 0))) (.cse15 (not (= 0 |old(~m_pc~0)|))) (.cse32 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse12 .cse13 .cse24 .cse25 .cse15 .cse26 .cse27 .cse1 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse14 .cse34 .cse35) (or .cse16 .cse17 .cse19 .cse20 .cse36 .cse21 .cse22 .cse23 .cse12 .cse13 .cse24 .cse25 .cse15 .cse0 .cse26 .cse27 .cse1 .cse28 .cse30 .cse10 .cse31 .cse33 .cse14 .cse34 .cse35) (or .cse10 .cse11 .cse12 .cse0 .cse37 .cse14 .cse15 .cse38) (or .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 .cse39 .cse13 .cse24 .cse25 .cse0 .cse26 .cse1 .cse40 .cse28 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse30 .cse10 .cse31 .cse33 .cse14 .cse34 .cse35 .cse41) (or .cse16 .cse17 .cse20 .cse36 .cse21 .cse22 .cse23 .cse39 .cse13 .cse24 .cse25 .cse0 .cse26 .cse1 .cse40 .cse28 .cse30 .cse10 .cse31 .cse33 .cse14 .cse34 .cse35 .cse41 (= 1 |old(~m_pc~0)|)) (or .cse16 .cse17 .cse18 .cse42 .cse20 .cse21 .cse22 .cse23 .cse12 .cse24 .cse25 .cse15 .cse26 .cse40 .cse28 .cse30 (and .cse2 .cse4 .cse5 .cse43 .cse7 .cse8) .cse31 .cse32 .cse33 .cse14 .cse34 .cse35 .cse38) (or .cse11 .cse13 .cse32 .cse18 .cse19 .cse29 .cse1 .cse27 .cse14 .cse15) (or .cse16 .cse17 .cse42 .cse20 .cse21 .cse22 .cse23 .cse12 .cse24 .cse25 .cse15 .cse0 .cse26 .cse28 .cse30 .cse10 .cse31 .cse37 .cse33 .cse14 .cse34 .cse35 .cse38) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (and (= ~m_pc~0 0) (= ~E_1~0 1) .cse5 (= ~t3_st~0 0) (= ~t1_st~0 0) (= ~t2_st~0 0)) (not (= 1 ~t1_i~0)) (or .cse12 (not (= ~t1_pc~0 0)) .cse42 .cse15 (not (= |old(~t1_st~0)| 0))) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse32 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse35 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0)))))) [2018-12-02 03:28:50,583 INFO L448 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-12-02 03:28:50,584 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 53) no Hoare annotation was computed. [2018-12-02 03:28:50,584 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 42 85) the Hoare annotation is: (let ((.cse38 (<= 2 ~t2_st~0)) (.cse34 (= |old(~E_1~0)| ~E_1~0)) (.cse40 (= ~m_pc~0 0)) (.cse36 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse37 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (= ~token~0 0)) (.cse42 (= ~local~0 0)) (.cse39 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse14 (= 0 ~E_3~0)) (.cse32 (not (= 0 |old(~local~0)|))) (.cse5 (= ~T3_E~0 1)) (.cse43 (= 1 ~t3_pc~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse11 (= 1 ~E_3~0)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse23 (= 0 ~E_M~0)) (.cse24 (= 0 |old(~m_st~0)|)) (.cse44 (+ |old(~local~0)| 3))) (let ((.cse26 (< .cse44 |old(~token~0)|)) (.cse30 (< |old(~token~0)| .cse44)) (.cse25 (or .cse0 .cse2 .cse14 .cse32 .cse5 .cse43 .cse6 .cse7 .cse8 .cse18 .cse19 .cse11 .cse12 .cse21 .cse23 .cse24)) (.cse3 (< 0 ~t2_pc~0)) (.cse1 (and .cse34 .cse40 .cse36 .cse37 (= 0 ~t2_st~0) .cse41 .cse42 .cse39)) (.cse28 (not .cse43)) (.cse33 (< 0 ~t1_pc~0)) (.cse4 (< |old(~local~0)| |old(~token~0)|)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse27 (< |old(~t2_st~0)| 2)) (.cse15 (< |old(~token~0)| |old(~local~0)|)) (.cse16 (not (= ~t1_pc~0 1))) (.cse17 (< |old(~t3_st~0)| 2)) (.cse31 (and .cse34 .cse40 .cse36 .cse37 .cse38 .cse41 .cse42 .cse39)) (.cse29 (not (= 1 ~t2_pc~0))) (.cse22 (< ~E_2~0 2)) (.cse9 (not (= |old(~token~0)| 0))) (.cse13 (not (= 0 |old(~m_pc~0)|))) (.cse20 (not (= 0 |old(~t2_st~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 .cse25 .cse10 .cse20 .cse3 .cse1 .cse4 .cse16 .cse15 .cse22 .cse13) (or .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse26 .cse10 .cse11 .cse12 (not (= ~m_pc~0 1)) .cse27 .cse14 .cse16 .cse28 .cse17 .cse18 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24 .cse30 (= 1 |old(~m_pc~0)|)) (or .cse31 .cse0 .cse2 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse27 .cse14 .cse17 .cse18 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24 .cse33) (or .cse29 .cse25 .cse9 .cse27 .cse22 .cse31 .cse13 .cse33) (or .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse26 .cse10 .cse11 .cse12 (let ((.cse35 (+ ~local~0 3))) (and .cse34 (<= .cse35 ~token~0) .cse36 .cse37 (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse35) .cse38 .cse39)) .cse27 .cse14 .cse16 .cse28 .cse17 .cse18 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24 .cse30) (or .cse31 .cse27 .cse16 .cse29 .cse25 .cse9 .cse10 .cse22 .cse13) (or .cse0 .cse2 .cse3 .cse32 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse33) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse31 .cse18 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (or (and .cse37 (= ~t1_st~0 0) .cse40 (= ~E_1~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) .cse41 .cse42) (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (or .cse9 (not (= ~t1_pc~0 0)) .cse32 .cse13 (not (= |old(~t1_st~0)| 0))) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse20 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse24 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0)))))) [2018-12-02 03:28:50,586 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 565 573) no Hoare annotation was computed. [2018-12-02 03:28:50,586 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 565 573) the Hoare annotation is: (let ((.cse2 (not (= 2 ~m_st~0))) (.cse19 (< 0 ~t1_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 |old(~M_E~0)|)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse9 (= |old(~M_E~0)| ~M_E~0)) (.cse21 (< ~t1_st~0 2)) (.cse7 (= 1 ~E_3~0)) (.cse8 (= 1 ~E_1~0)) (.cse10 (< ~t2_st~0 2)) (.cse11 (= 0 ~E_3~0)) (.cse22 (not (= ~t1_pc~0 1))) (.cse20 (= 1 ~t3_pc~0)) (.cse12 (< ~t3_st~0 2)) (.cse13 (= 1 ~E_M~0)) (.cse14 (not (= 1 ~t2_pc~0))) (.cse15 (= ~T1_E~0 1)) (.cse24 (= 0 ~m_st~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (< ~E_2~0 2)) (.cse18 (= 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) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse9) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse23 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse10 .cse11 (< .cse23 ~token~0) .cse22 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~token~0 .cse23))) (or .cse0 .cse10 .cse1 .cse11 .cse2 .cse3 .cse20 .cse4 .cse9 .cse5 .cse6 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19) (or .cse9 .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8 .cse16 .cse18 (= 0 ~E_2~0) .cse24 (= 1 ~m_pc~0)) (let ((.cse25 (+ ~local~0 3))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (< .cse25 ~token~0) .cse9 .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 (not .cse20) .cse12 .cse13 .cse14 .cse15 (not .cse24) .cse16 .cse17 .cse18 (< ~token~0 .cse25))))) [2018-12-02 03:28:50,588 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 565 573) no Hoare annotation was computed. [2018-12-02 03:28:50,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 03:28:50,588 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~E_1~0)| ~E_1~0) (or (<= 1 |old(~t2_pc~0)|) (< ~t2_pc~0 1)) (= ~m_st~0 |old(~m_st~0)|) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= |old(~t3_st~0)| ~t3_st~0) (<= |old(~t1_st~0)| ~t1_st~0) (= |old(~E_M~0)| ~E_M~0)) [2018-12-02 03:28:50,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 03:28:50,588 INFO L448 ceAbstractionStarter]: For program point L345(line 345) no Hoare annotation was computed. [2018-12-02 03:28:50,588 INFO L448 ceAbstractionStarter]: For program point L366(lines 342 408) no Hoare annotation was computed. [2018-12-02 03:28:50,588 INFO L444 ceAbstractionStarter]: At program point L358(line 358) the Hoare annotation is: (let ((.cse5 (= ~T3_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0))) (let ((.cse43 (and (not .cse0) (not .cse7) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse12 (= ~T1_E~0 1)) (.cse44 (not .cse5)) (.cse45 (not (= ~M_E~0 1))) (.cse2 (= ~T2_E~0 1)) (.cse46 (not (= ~E_1~0 1))) (.cse47 (not (= ~E_3~0 1))) (.cse50 (+ ~local~0 3))) (let ((.cse40 (<= .cse50 ~token~0)) (.cse42 (<= ~token~0 .cse50)) (.cse37 (<= 2 ~t2_st~0)) (.cse24 (= 1 ~t1_pc~0)) (.cse35 (= 1 ~t2_pc~0)) (.cse25 (<= 2 ~t3_st~0)) (.cse41 (<= 2 ~E_2~0)) (.cse27 (<= 2 ~t1_st~0)) (.cse33 (and (and (and .cse43 (not .cse12) .cse44 (= 1 ~t3_pc~0) .cse45 (not .cse2) (not (= ~E_M~0 1))) .cse46) .cse47)) (.cse29 (not (= ~m_st~0 0)))) (let ((.cse18 (< 0 |old(~t1_pc~0)|)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse20 (< |old(~t1_st~0)| 2)) (.cse13 (= 1 |old(~E_3~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse3 (= 0 |old(~E_3~0)|)) (.cse19 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 1 |old(~t3_pc~0)|)) (.cse21 (< |old(~t3_st~0)| 2)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse11 (not (= 1 |old(~t2_pc~0)|))) (.cse48 (= 0 |old(~m_st~0)|)) (.cse23 (and .cse40 .cse42 (and .cse37 .cse24 (<= 1 |old(~t2_pc~0)|) .cse35 .cse25 .cse41 .cse27 .cse33 .cse29))) (.cse15 (= 0 |old(~E_1~0)|)) (.cse16 (< |old(~E_2~0)| 2)) (.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 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse20 .cse13 .cse14 .cse1 .cse3 .cse19 .cse21 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse22 (+ |old(~local~0)| 2))) (or .cse0 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse20 .cse13 .cse14 .cse1 .cse3 (< .cse22 |old(~token~0)|) .cse19 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse22))) (let ((.cse28 (<= ~t2_pc~0 0)) (.cse30 (= 0 ~t2_st~0)) (.cse36 (<= ~t1_pc~0 0)) (.cse26 (= ~m_pc~0 0)) (.cse31 (= ~token~0 0)) (.cse32 (= ~local~0 0)) (.cse39 (and (and (and .cse43 .cse44 .cse45 (not (= ~t3_pc~0 1)) .cse46 (= |old(~E_M~0)| ~E_M~0)) .cse47) (<= |old(~t3_st~0)| ~t3_st~0) .cse29 (not (= ~m_pc~0 1)))) (.cse38 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse34 (<= |old(~E_2~0)| ~E_2~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse35 .cse36 .cse25 .cse26 .cse29 .cse37 .cse31 .cse32 .cse33 .cse38 .cse34) (not (= ~m_i~0 1)) (and .cse24 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse39 .cse34) (not (= 2 ~M_E~0)) (and .cse24 .cse35 .cse25 .cse26 .cse27 .cse29 .cse37 .cse31 .cse32 .cse33 .cse34) (not (= ~T3_E~0 2)) (and .cse37 .cse24 .cse40 .cse35 .cse25 .cse41 .cse42 .cse27 .cse33 .cse29) (and .cse24 .cse35 .cse26 .cse27 .cse37 .cse31 .cse32 .cse39 .cse34) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse36 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse38 .cse34) (and (= ~E_3~0 2) .cse26 (= ~t3_pc~0 0) .cse29 (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~t2_st~0 0) .cse31 .cse32 (= ~E_2~0 2) (= ~t1_pc~0 0)) (and .cse37 .cse35 .cse36 .cse26 .cse31 .cse32 .cse39 .cse38 .cse34) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)))) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 (= 0 |old(~E_2~0)|) .cse48 (= 1 |old(~m_pc~0)|)) (let ((.cse49 (+ |old(~local~0)| 3))) (or .cse0 .cse2 .cse5 .cse7 .cse8 .cse9 (< .cse49 |old(~token~0)|) .cse20 .cse13 .cse14 .cse1 .cse3 .cse19 (not .cse6) .cse21 .cse10 .cse11 .cse12 (not .cse48) .cse23 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse49)))))))) [2018-12-02 03:28:50,590 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2018-12-02 03:28:50,592 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 336 414) no Hoare annotation was computed. [2018-12-02 03:28:50,593 INFO L444 ceAbstractionStarter]: At program point L400(line 400) the Hoare annotation is: (let ((.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse10 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse71 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse72 (not .cse10)) (.cse73 (not .cse3)) (.cse74 (not (= ~M_E~0 1))) (.cse75 (not .cse1)) (.cse77 (not (= ~E_M~0 1))) (.cse76 (not (= ~E_1~0 1))) (.cse78 (not (= ~E_3~0 1)))) (let ((.cse65 (= ~m_pc~0 1)) (.cse70 (+ ~local~0 2)) (.cse42 (= ~m_st~0 2)) (.cse68 (and (and (and .cse71 .cse72 .cse73 (= 1 ~t3_pc~0) .cse74 .cse75 .cse77) .cse76) .cse78)) (.cse66 (= ~m_st~0 0))) (let ((.cse30 (= 1 |old(~t3_pc~0)|)) (.cse62 (not .cse66)) (.cse41 (and (and .cse71 .cse72 .cse73 .cse74 .cse75 (not (= ~t3_pc~0 1)) .cse76 (= |old(~E_M~0)| ~E_M~0) .cse77) .cse78)) (.cse31 (<= 2 ~t2_st~0)) (.cse32 (= 1 ~t1_pc~0)) (.cse49 (and .cse42 .cse68)) (.cse33 (= 1 ~t2_pc~0)) (.cse50 (<= 2 ~E_2~0)) (.cse34 (<= 2 ~t1_st~0)) (.cse51 (<= .cse70 ~token~0)) (.cse52 (<= ~token~0 .cse70)) (.cse69 (= ~m_st~0 |old(~m_st~0)|)) (.cse63 (not .cse65))) (let ((.cse9 (and .cse69 .cse68 .cse63)) (.cse15 (= 0 |old(~E_2~0)|)) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse19 (and (and .cse31 .cse32 .cse49 .cse33 .cse50 .cse34) .cse51 .cse52)) (.cse18 (and .cse69 .cse41 .cse63)) (.cse35 (and .cse65 .cse69 .cse41 .cse62)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse23 (not (= |old(~t1_pc~0)| 1))) (.cse38 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse37 (<= ~t1_pc~0 0)) (.cse36 (<= |old(~E_2~0)| ~E_2~0)) (.cse28 (not (= 2 |old(~m_st~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse24 (< |old(~t3_st~0)| 2)) (.cse4 (not .cse30)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse25 (not (= 1 |old(~t2_pc~0)|))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse26 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse27 (and .cse68 .cse62 .cse63)) (.cse39 (< 0 |old(~t1_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 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse20 |old(~token~0)|) .cse21 .cse11 .cse12 .cse22 .cse2 .cse23 .cse4 .cse24 .cse8 .cse25 .cse10 (not .cse16) .cse13 .cse26 .cse14 .cse27 (< |old(~token~0)| .cse20))) (let ((.cse29 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse28 .cse3 .cse5 .cse19 .cse6 .cse7 .cse21 .cse11 .cse12 .cse22 .cse2 (< .cse29 |old(~token~0)|) .cse23 .cse4 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 (< |old(~token~0)| .cse29))) (or .cse0 .cse1 .cse28 .cse3 .cse30 .cse5 .cse6 .cse7 .cse11 .cse12 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse22 .cse2 (and .cse31 .cse33 .cse37 .cse35 .cse38 .cse36) .cse18 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 .cse39) (or .cse0 .cse1 .cse28 .cse3 .cse30 .cse5 .cse6 .cse7 .cse21 .cse11 .cse12 .cse22 .cse2 .cse23 .cse18 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 (and .cse31 .cse32 .cse33 .cse35 .cse38 .cse36)) (or .cse0 .cse1 .cse28 .cse3 .cse5 .cse6 .cse7 .cse21 .cse11 .cse12 .cse22 .cse2 .cse23 .cse4 .cse24 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27) (let ((.cse40 (= ~E_3~0 2)) (.cse53 (= ~T1_E~0 2)) (.cse58 (= ~m_i~0 1)) (.cse44 (= ~E_1~0 2)) (.cse46 (= ~t1_st~0 0)) (.cse47 (= ~E_2~0 2)) (.cse48 (= ~t1_pc~0 0)) (.cse45 (= ~t2_pc~0 0)) (.cse43 (= ~t3_pc~0 0)) (.cse57 (let ((.cse67 (= eval_~tmp~0 1))) (or (and .cse66 (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse67) (and .cse65 .cse42 .cse67))))) (let ((.cse54 (or (and .cse40 .cse53 .cse58 (= ~t1_i~0 1) .cse43 (= ~M_E~0 2) .cse44 .cse45 .cse46 (= 0 ~m_st~0) .cse41 .cse47 .cse48 .cse57) (and .cse45 (= ~t1_pc~0 1) .cse41 .cse43 .cse57 .cse63))) (.cse59 (<= ~token~0 ~local~0)) (.cse61 (<= ~t2_pc~0 0)) (.cse60 (<= ~local~0 ~token~0)) (.cse56 (and .cse65 .cse41 .cse42)) (.cse55 (= 0 ~t2_st~0))) (or (and (and .cse40 .cse41 .cse42 .cse43) .cse44 .cse45 .cse46 (= ~t2_st~0 0) .cse47 .cse48) (and .cse31 .cse32 .cse33 .cse49 .cse50 .cse34 .cse51 .cse52) (not (= 2 |old(~E_2~0)|)) (not .cse53) (and .cse34 .cse54 .cse55 .cse36) (and .cse31 .cse33 .cse37 .cse38 .cse56 .cse36) (and .cse33 .cse37 .cse31 .cse46 .cse41 .cse57 .cse36) (not .cse58) (not (= 2 ~M_E~0)) (not (= ~T3_E~0 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse31 .cse32 .cse33 .cse46 .cse59 .cse60 .cse56 .cse36) (and .cse32 .cse50 .cse34 .cse61 .cse56 .cse55) (and .cse54 .cse55 .cse48) (not (= ~T2_E~0 2)) (and .cse32 .cse33 .cse34 .cse31 .cse41 .cse57 .cse36) (and .cse32 .cse46 .cse59 .cse61 .cse60 .cse56 .cse55 .cse36) (and .cse41 .cse62 .cse63) (not (= 0 |old(~t3_st~0)|)) (and .cse31 .cse32 .cse33 .cse50 .cse34 .cse56) (not (= 2 |old(~E_M~0)|)) (let ((.cse64 (+ ~local~0 1))) (and .cse32 (<= ~token~0 .cse64) .cse33 .cse50 (<= .cse64 ~token~0) .cse34 .cse56 .cse55)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse27))) (or .cse0 .cse1 .cse28 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse22 .cse2 .cse24 .cse4 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 .cse39))))))) [2018-12-02 03:28:50,594 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2018-12-02 03:28:50,598 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 336 414) the Hoare annotation is: (let ((.cse26 (= ~m_pc~0 1)) (.cse43 (= 1 |old(~m_pc~0)|)) (.cse4 (= 1 |old(~t3_pc~0)|)) (.cse53 (+ |old(~local~0)| 3)) (.cse42 (= 0 |old(~m_st~0)|))) (let ((.cse33 (not (= 2 |old(~E_3~0)|))) (.cse36 (not (= 2 |old(~E_M~0)|))) (.cse37 (not (= 2 |old(~E_1~0)|))) (.cse44 (not .cse42)) (.cse45 (< .cse53 |old(~token~0)|)) (.cse48 (< |old(~token~0)| .cse53)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse13 (not (= |old(~t1_pc~0)| 1))) (.cse21 (= 1 ~t1_pc~0)) (.cse47 (= ~token~0 |old(~token~0)|)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse51 (<= ~t1_pc~0 0)) (.cse38 (= 1 ~t3_pc~0)) (.cse24 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse27 (= 1 ~t2_pc~0)) (.cse28 (= ~m_st~0 2)) (.cse31 (<= 2 ~t2_st~0)) (.cse32 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse35 (< |old(~t3_st~0)| 2)) (.cse34 (not .cse4)) (.cse15 (not (= 1 |old(~t2_pc~0)|))) (.cse17 (not .cse43)) (.cse19 (< |old(~E_2~0)| 2)) (.cse52 (< 0 |old(~t1_pc~0)|)) (.cse22 (= |old(~E_1~0)| ~E_1~0)) (.cse23 (not (= ~t3_pc~0 1))) (.cse39 (not .cse26)) (.cse25 (= |old(~E_M~0)| ~E_M~0)) (.cse40 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (= |old(~E_2~0)| ~E_2~0)) (.cse30 (= |old(~E_3~0)| ~E_3~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 0 |old(~E_3~0)|)) (.cse3 (= ~T3_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse9 (= 1 |old(~E_3~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse20 (= 0 |old(~E_M~0)|)) (.cse41 (= 0 |old(~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 (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse33 .cse11 .cse13 .cse34 .cse35 .cse36 .cse15 (not (= |old(~t1_st~0)| 2)) .cse16 (= ~t1_st~0 2) .cse17 .cse37 .cse19) (or .cse0 .cse1 .cse12 .cse3 .cse34 .cse5 .cse6 (and .cse22 .cse38 .cse39 .cse25 .cse40 .cse29 .cse30) .cse7 .cse14 .cse16 .cse9 .cse10 .cse18 .cse20 .cse41 .cse42 .cse43) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse33 (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) .cse36 .cse44 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) .cse37 (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse45 (let ((.cse46 (+ ~local~0 3))) (and .cse21 .cse22 .cse38 (<= .cse46 ~token~0) .cse24 .cse25 .cse27 .cse47 (<= ~token~0 .cse46) .cse29 .cse30 .cse31 (= 0 ~m_st~0) .cse32)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse35 .cse14 .cse15 .cse16 .cse44 .cse18 .cse19 .cse20 .cse48) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse45 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse35 .cse14 .cse15 .cse16 .cse39 .cse18 .cse19 .cse20 .cse48 .cse43) (or .cse0 (and .cse21 .cse22 .cse38 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse35 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse49 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse49 |old(~token~0)|) .cse13 .cse34 (let ((.cse50 (+ ~local~0 2))) (and .cse21 .cse22 .cse38 .cse24 .cse25 (<= ~token~0 .cse50) .cse26 .cse27 .cse47 .cse28 .cse29 .cse30 .cse31 (<= .cse50 ~token~0) .cse32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< |old(~token~0)| .cse49))) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 (and .cse22 .cse51 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse52) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 (and .cse22 .cse51 .cse38 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse11 .cse12 .cse35 .cse34 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse52) (or (and .cse22 .cse23 .cse39 .cse25 .cse40 .cse29 .cse30) .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse10 .cse18 .cse20 .cse41 .cse42 .cse43)))) [2018-12-02 03:28:50,600 INFO L448 ceAbstractionStarter]: For program point L380(lines 342 408) no Hoare annotation was computed. [2018-12-02 03:28:50,606 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2018-12-02 03:28:50,606 INFO L448 ceAbstractionStarter]: For program point L347-1(lines 342 408) no Hoare annotation was computed. [2018-12-02 03:28:50,606 INFO L444 ceAbstractionStarter]: At program point L409(lines 336 414) the Hoare annotation is: (let ((.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse10 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse65 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse66 (not .cse10)) (.cse67 (not .cse3)) (.cse68 (not (= ~M_E~0 1))) (.cse69 (not .cse1)) (.cse71 (not (= ~E_M~0 1))) (.cse70 (not (= ~E_1~0 1))) (.cse72 (not (= ~E_3~0 1)))) (let ((.cse42 (= ~m_st~0 2)) (.cse44 (and (and (and .cse65 .cse66 .cse67 (= 1 ~t3_pc~0) .cse68 .cse69 .cse71) .cse70) .cse72)) (.cse43 (<= 2 ~t2_st~0)) (.cse63 (= ~m_pc~0 1)) (.cse40 (= 1 ~t2_pc~0)) (.cse62 (= ~m_st~0 |old(~m_st~0)|)) (.cse53 (<= 2 ~E_2~0)) (.cse56 (and (and .cse65 .cse66 .cse67 .cse68 .cse69 (not (= ~t3_pc~0 1)) .cse70 (= |old(~E_M~0)| ~E_M~0) .cse71) .cse72)) (.cse59 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse64 (+ ~local~0 3))) (let ((.cse57 (not (= ~m_st~0 0))) (.cse52 (<= .cse64 ~token~0)) (.cse54 (= 0 ~m_st~0)) (.cse55 (<= ~token~0 .cse64)) (.cse46 (= 1 |old(~t3_pc~0)|)) (.cse41 (<= 2 ~t3_st~0)) (.cse30 (<= 2 ~t1_st~0)) (.cse47 (and .cse43 .cse63 .cse40 .cse62 .cse53 .cse56 .cse59)) (.cse61 (<= 1 |old(~t2_pc~0)|)) (.cse58 (not .cse63)) (.cse48 (= 1 ~t1_pc~0)) (.cse29 (and .cse43 .cse40 .cse62 .cse53 .cse42 .cse59 .cse44))) (let ((.cse19 (and .cse48 .cse29)) (.cse24 (< |old(~t3_st~0)| 2)) (.cse9 (and .cse62 .cse44 .cse58)) (.cse15 (= 0 |old(~E_2~0)|)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse31 (< 0 |old(~t1_pc~0)|)) (.cse49 (and .cse48 .cse47 .cse61)) (.cse39 (and .cse62 .cse56 .cse58)) (.cse18 (not (= 2 |old(~m_st~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse23 (not (= |old(~t1_pc~0)| 1))) (.cse37 (and .cse43 .cse48 .cse40 .cse41 .cse53 .cse42 .cse30 .cse44)) (.cse4 (not .cse46)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse25 (not (= 1 |old(~t2_pc~0)|))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse26 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse38 (and .cse43 .cse48 .cse52 .cse61 .cse40 .cse41 .cse53 .cse54 .cse55 .cse30 .cse44)) (.cse35 (let ((.cse60 (+ ~local~0 2))) (and .cse43 .cse48 .cse40 .cse53 .cse42 .cse30 (<= .cse60 ~token~0) .cse44 (<= ~token~0 .cse60)))) (.cse32 (not (= 2 |old(~E_3~0)|))) (.cse28 (<= ~t1_pc~0 0)) (.cse20 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= |old(~E_2~0)| ~E_2~0)) (.cse33 (not (= 2 |old(~E_M~0)|))) (.cse34 (not (= 2 |old(~E_1~0)|))) (.cse27 (and .cse44 .cse57 .cse58))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse18 (and .cse19 .cse20) .cse3 .cse5 .cse6 .cse7 .cse21 .cse11 .cse12 .cse22 .cse2 .cse23 .cse4 .cse24 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27) (or .cse0 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse22 .cse2 (and .cse28 .cse29 .cse20) (and .cse19 .cse30) .cse24 .cse4 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 .cse31) (or .cse0 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse32 .cse22 .cse23 .cse4 .cse24 .cse33 .cse25 (not (= |old(~t1_st~0)| 2)) .cse10 (and (= ~E_1~0 2) (= ~E_3~0 2) (= ~E_M~0 2) (= ~t1_st~0 2)) .cse34 .cse26 .cse27) (let ((.cse36 (+ |old(~local~0)| 3))) (or .cse35 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (< .cse36 |old(~token~0)|) .cse21 .cse11 .cse12 .cse22 .cse2 .cse23 .cse4 .cse24 .cse37 .cse8 .cse25 .cse10 (not .cse16) .cse13 .cse26 .cse14 .cse27 .cse38 (< |old(~token~0)| .cse36))) (or .cse0 .cse1 .cse2 .cse39 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse18 .cse3 (and .cse40 .cse28 .cse41 .cse42 .cse43 .cse44 .cse20 .cse45) .cse46 .cse5 .cse6 .cse7 (and .cse47 .cse28 .cse20) .cse11 .cse12 .cse22 (and .cse48 .cse40 .cse41 .cse42 .cse30 .cse43 .cse44 .cse45) .cse2 .cse39 .cse8 .cse25 .cse10 .cse13 .cse26 (and .cse30 .cse49) .cse14 .cse27 .cse31) (or .cse0 .cse1 (and .cse49 .cse20) .cse18 .cse3 .cse46 .cse5 .cse6 .cse7 .cse21 .cse11 .cse12 .cse22 .cse2 .cse23 .cse39 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 (and .cse48 .cse40 .cse41 .cse42 .cse43 .cse44 .cse20 .cse45)) (let ((.cse50 (+ |old(~local~0)| 2))) (or .cse35 .cse0 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse21 .cse11 .cse12 .cse22 .cse2 (< .cse50 |old(~token~0)|) .cse23 .cse37 .cse4 .cse8 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 .cse38 (< |old(~token~0)| .cse50))) (let ((.cse51 (and .cse43 .cse40 .cse53 .cse56 .cse42 .cse59))) (or .cse35 (not (= 2 |old(~E_2~0)|)) (and .cse48 .cse30 .cse51) (not (= ~T1_E~0 2)) (not (= ~m_i~0 1)) (not (= 2 ~M_E~0)) (and .cse28 .cse51 .cse20) (and .cse43 .cse48 .cse40 .cse41 .cse42 .cse30 .cse44 .cse45) (not (= ~T3_E~0 2)) (and .cse43 .cse48 .cse52 .cse40 .cse41 .cse53 .cse54 .cse55 .cse30 .cse44) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse32 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse43 .cse40 .cse28 .cse41 .cse42 .cse44 .cse20 .cse45) (not (= ~T2_E~0 2)) (and .cse56 .cse57 .cse58) (not (= 0 |old(~t3_st~0)|)) .cse33 (not (= 1 ~t3_i~0)) .cse34 (not (= 1 ~t2_i~0)) .cse27)))))))) [2018-12-02 03:28:50,612 INFO L444 ceAbstractionStarter]: At program point L343(line 343) the Hoare annotation is: (let ((.cse51 (= ~T2_E~0 1)) (.cse53 (= ~T3_E~0 1)) (.cse60 (= ~T1_E~0 1)) (.cse50 (= ~T1_E~0 0)) (.cse55 (= ~T2_E~0 0))) (let ((.cse93 (and (not .cse50) (not .cse55) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse94 (not .cse60)) (.cse95 (not .cse53)) (.cse96 (not (= ~M_E~0 1))) (.cse97 (not .cse51)) (.cse99 (not (= ~E_M~0 1))) (.cse98 (not (= ~E_1~0 1))) (.cse100 (not (= ~E_3~0 1)))) (let ((.cse47 (= ~m_pc~0 1)) (.cse36 (= ~m_st~0 2)) (.cse18 (and (and (and .cse93 .cse94 .cse95 (= 1 ~t3_pc~0) .cse96 .cse97 .cse99) .cse98) .cse100)) (.cse90 (+ ~local~0 1)) (.cse91 (+ ~local~0 2)) (.cse92 (+ ~local~0 3)) (.cse48 (= ~m_st~0 0))) (let ((.cse39 (not .cse48)) (.cse85 (= 1 |old(~t3_pc~0)|)) (.cse4 (and (and .cse93 .cse94 .cse95 .cse96 .cse97 (not (= ~t3_pc~0 1)) .cse98 (= |old(~E_M~0)| ~E_M~0) .cse99) .cse100)) (.cse31 (<= .cse92 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse33 (<= ~token~0 .cse92)) (.cse89 (<= 1 |old(~t2_pc~0)|)) (.cse12 (<= .cse91 ~token~0)) (.cse13 (<= ~token~0 .cse91)) (.cse22 (<= ~token~0 .cse90)) (.cse11 (<= 2 ~t1_st~0)) (.cse17 (= 0 ~t2_st~0)) (.cse23 (<= .cse90 ~token~0)) (.cse2 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (and .cse36 .cse18)) (.cse0 (= 1 ~t2_pc~0)) (.cse3 (= ~t1_st~0 0)) (.cse14 (<= 2 ~t3_st~0)) (.cse10 (<= 2 ~E_2~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse84 (= ~m_st~0 |old(~m_st~0)|)) (.cse40 (not .cse47))) (let ((.cse1 (<= ~t1_pc~0 0)) (.cse82 (< 0 |old(~t1_pc~0)|)) (.cse59 (and .cse84 .cse18 .cse40)) (.cse65 (= 0 |old(~E_2~0)|)) (.cse67 (= 1 |old(~m_pc~0)|)) (.cse70 (and (and .cse2 .cse8 .cse9 .cse0 .cse3 .cse14 .cse10) .cse19 .cse20)) (.cse74 (and .cse22 (and .cse8 .cse9 .cse0 .cse14 .cse10 .cse11 .cse17) .cse23)) (.cse75 (and .cse2 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13)) (.cse66 (= 0 |old(~m_st~0)|)) (.cse77 (and .cse2 .cse8 .cse9 .cse89 .cse0 .cse14 .cse10 .cse11)) (.cse79 (and .cse2 .cse8 .cse31 .cse89 .cse0 .cse14 .cse10 .cse32 .cse33 .cse11 .cse18)) (.cse69 (< |old(~t1_st~0)| 2)) (.cse61 (= 1 |old(~E_3~0)|)) (.cse62 (= 1 |old(~E_1~0)|)) (.cse52 (= 0 |old(~E_3~0)|)) (.cse83 (and .cse47 .cse84 .cse36 .cse18)) (.cse86 (and .cse47 .cse84 .cse4)) (.cse5 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse16 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (<= |old(~E_2~0)| ~E_2~0)) (.cse87 (and .cse84 .cse4 .cse40)) (.cse58 (= 1 |old(~E_M~0)|)) (.cse63 (= 0 |old(~E_1~0)|)) (.cse64 (= 0 |old(~E_M~0)|)) (.cse68 (not (= 2 |old(~m_st~0)|))) (.cse56 (= 0 ~M_E~0)) (.cse57 (= 1 ~M_E~0)) (.cse25 (= ~E_1~0 2)) (.cse35 (= ~E_3~0 2)) (.cse38 (= ~E_M~0 2)) (.cse26 (= ~t1_st~0 2)) (.cse34 (not (= 2 |old(~E_3~0)|))) (.cse71 (< |old(~t2_st~0)| 2)) (.cse73 (not (= |old(~t1_pc~0)| 1))) (.cse54 (not .cse85)) (.cse81 (< |old(~t3_st~0)| 2)) (.cse41 (not (= 2 |old(~E_M~0)|))) (.cse76 (not (= 1 |old(~t2_pc~0)|))) (.cse45 (not (= 2 |old(~E_1~0)|))) (.cse78 (< |old(~E_2~0)| 2)) (.cse46 (and .cse18 .cse39 .cse40))) (and (let ((.cse44 (= ~m_pc~0 0)) (.cse42 (= ~token~0 0)) (.cse43 (= ~local~0 0))) (let ((.cse15 (<= ~t2_pc~0 0)) (.cse27 (= ~t3_st~0 0)) (.cse28 (= ~t2_pc~0 0)) (.cse29 (= ~t2_st~0 0)) (.cse30 (= ~E_2~0 2)) (.cse37 (= ~t1_pc~0 0)) (.cse24 (= ~t3_pc~0 0)) (.cse6 (let ((.cse49 (= eval_~tmp~0 1))) (or (and .cse48 .cse44 .cse42 .cse43 .cse49) (and .cse47 .cse36 .cse49)))) (.cse21 (and .cse47 .cse4 .cse36))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse9 .cse15 .cse16 .cse17 .cse7) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse1 .cse14 .cse15 .cse17 .cse3 .cse18 .cse6 .cse7) (and .cse8 .cse3 .cse14 .cse9 .cse19 .cse15 .cse20 .cse17 .cse7) (and .cse8 .cse3 .cse19 .cse5 .cse15 .cse20 .cse21 .cse17 .cse7) (and .cse8 .cse14 .cse11 .cse15 .cse17 .cse18 .cse6 .cse7) (and .cse8 .cse0 .cse14 .cse11 .cse2 .cse18 .cse6 .cse7) (not (= ~m_i~0 1)) (and .cse8 .cse22 .cse0 .cse14 .cse9 .cse10 .cse23 .cse11 .cse17) (and (= ~t1_pc~0 1) .cse24 .cse25 .cse4 .cse26 .cse27 .cse28 .cse29 .cse30 .cse6) (and .cse2 .cse0 .cse1 .cse14 .cse9 .cse16 .cse7) (and .cse2 .cse8 .cse0 .cse14 .cse9 .cse11 .cse7) (not (= 2 ~M_E~0)) (and .cse8 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse19 (and .cse2 .cse8 .cse0 .cse14 .cse9 .cse10) .cse20) (not (= ~T3_E~0 2)) (and .cse8 .cse22 .cse0 .cse10 .cse23 .cse11 .cse5 .cse21 .cse17) (and .cse2 .cse0 .cse1 .cse5 .cse16 .cse21 .cse7) (and .cse2 .cse8 .cse31 .cse0 .cse14 .cse10 .cse32 .cse33 .cse11 .cse18) (and .cse8 .cse14 .cse9 .cse11 .cse15 .cse17 .cse7) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse34 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse25 (and .cse28 .cse3 .cse35 .cse36 .cse37 .cse24 .cse27) .cse38 .cse30 .cse17) (and .cse8 .cse11 .cse5 .cse15 .cse21 .cse17 .cse7) (not (= ~T2_E~0 2)) (and .cse4 .cse39 .cse40) (not (= 0 |old(~t3_st~0)|)) .cse41 (and .cse27 .cse28 .cse3 .cse29 .cse42 .cse43 .cse30 .cse37 (and (and .cse35 .cse44 .cse4 .cse24) .cse25)) (not (= 1 ~t3_i~0)) (and .cse2 .cse8 .cse0 .cse3 .cse19 .cse5 .cse20 .cse21 .cse7) .cse45 (not (= 1 ~t2_i~0)) .cse46 (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse18 .cse6 .cse7) (and .cse2 .cse8 .cse0 .cse11 .cse5 .cse21 .cse7)))) (or .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67) (let ((.cse72 (+ |old(~local~0)| 2))) (or .cse50 .cse51 .cse68 .cse53 .cse55 .cse56 .cse57 .cse69 .cse61 .cse62 .cse70 .cse71 .cse52 (< .cse72 |old(~token~0)|) .cse73 .cse74 .cse54 .cse75 .cse58 .cse76 .cse60 .cse77 .cse63 .cse78 .cse64 .cse46 .cse79 (< |old(~token~0)| .cse72))) (let ((.cse80 (and .cse2 .cse0 .cse14 .cse10 .cse83 .cse5))) (or .cse50 .cse51 .cse68 .cse53 .cse55 .cse56 .cse57 (and (and .cse80 .cse8) .cse11) .cse61 .cse62 .cse71 .cse52 .cse81 .cse54 .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46 .cse82 (and .cse80 .cse1 .cse16))) (or .cse50 .cse51 (and .cse16 (and (and .cse2 .cse0 .cse10 .cse5 (and .cse84 .cse18)) .cse8)) .cse68 .cse53 .cse55 .cse56 .cse57 .cse69 .cse61 .cse62 .cse71 .cse52 .cse73 .cse54 .cse81 .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46) (or .cse50 .cse51 .cse68 .cse53 .cse85 .cse55 .cse56 .cse57 .cse61 .cse62 (and .cse2 .cse8 .cse0 .cse14 .cse83 .cse11 .cse7) (and .cse2 .cse0 .cse86 .cse1 .cse5 .cse16 .cse7) .cse71 .cse52 (and .cse2 .cse0 .cse1 .cse14 .cse83 .cse16 .cse7) .cse87 (and .cse2 .cse8 .cse0 .cse86 .cse11 .cse5 .cse7) .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46 .cse82) (or .cse50 .cse51 .cse52 .cse87 .cse53 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67) (let ((.cse88 (+ |old(~local~0)| 3))) (or .cse50 .cse51 .cse53 .cse55 .cse56 .cse57 (< .cse88 |old(~token~0)|) .cse69 .cse61 .cse62 .cse70 .cse71 .cse52 .cse73 .cse54 .cse81 .cse74 .cse75 .cse58 .cse76 .cse60 (not .cse66) .cse63 .cse77 .cse78 .cse64 .cse46 .cse79 (< |old(~token~0)| .cse88))) (or .cse50 .cse51 .cse68 .cse53 .cse85 .cse55 .cse56 .cse57 .cse69 .cse61 .cse62 .cse71 .cse52 (and .cse2 .cse8 .cse0 .cse14 .cse83 .cse16 .cse7) (and .cse2 .cse8 .cse0 .cse86 .cse5 .cse16 .cse7) .cse73 .cse87 .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46) (or .cse50 .cse51 .cse68 .cse53 .cse55 .cse56 .cse57 (and .cse25 .cse35 .cse38 .cse26) .cse34 .cse71 .cse73 .cse54 .cse81 .cse41 .cse76 (not (= |old(~t1_st~0)| 2)) .cse60 .cse45 .cse78 .cse46))))))) [2018-12-02 03:28:50,620 INFO L444 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse10 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse65 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse66 (not .cse10)) (.cse67 (not .cse3)) (.cse68 (not (= ~M_E~0 1))) (.cse69 (not .cse1)) (.cse71 (not (= ~E_M~0 1))) (.cse70 (not (= ~E_1~0 1))) (.cse72 (not (= ~E_3~0 1)))) (let ((.cse60 (= ~m_pc~0 1)) (.cse59 (= ~m_st~0 2)) (.cse51 (and (and (and .cse65 .cse66 .cse67 (= 1 ~t3_pc~0) .cse68 .cse69 .cse71) .cse70) .cse72)) (.cse61 (= ~m_st~0 0))) (let ((.cse57 (not .cse61)) (.cse56 (and (and .cse65 .cse66 .cse67 .cse68 .cse69 (not (= ~t3_pc~0 1)) .cse70 (= |old(~E_M~0)| ~E_M~0) .cse71) .cse72)) (.cse63 (= 1 |old(~t3_pc~0)|)) (.cse52 (<= ~token~0 ~local~0)) (.cse18 (<= 2 ~t2_st~0)) (.cse53 (= 1 ~t1_pc~0)) (.cse54 (and .cse60 .cse59 .cse51)) (.cse19 (= 1 ~t2_pc~0)) (.cse48 (<= 2 ~t3_st~0)) (.cse20 (<= 2 ~E_2~0)) (.cse55 (<= ~local~0 ~token~0)) (.cse64 (= ~m_st~0 |old(~m_st~0)|)) (.cse58 (not .cse60))) (let ((.cse9 (and .cse64 .cse51 .cse58)) (.cse15 (= 0 |old(~E_2~0)|)) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse34 (and .cse52 (and .cse18 .cse53 .cse54 (<= 1 |old(~t2_pc~0)|) .cse19 .cse48 .cse20) .cse55)) (.cse4 (not .cse63)) (.cse26 (< |old(~t3_st~0)| 2)) (.cse22 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse23 (<= ~t1_pc~0 0)) (.cse21 (and .cse64 .cse59 .cse51)) (.cse38 (<= |old(~E_2~0)| ~E_2~0)) (.cse30 (< 0 |old(~t1_pc~0)|)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse31 (< |old(~t1_st~0)| 2)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse33 (not (= |old(~t1_pc~0)| 1))) (.cse35 (and .cse64 .cse56 .cse58)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse27 (not (= 1 |old(~t2_pc~0)|))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse28 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse29 (and .cse51 .cse57 .cse58))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (and (and .cse18 .cse19 .cse20 .cse21 .cse22) .cse23) .cse1 .cse24 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse25 .cse2 .cse26 .cse4 .cse8 .cse27 .cse10 .cse13 .cse28 .cse14 .cse29 .cse30) (let ((.cse32 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse24 .cse3 .cse5 .cse6 .cse7 .cse31 .cse11 .cse12 .cse25 .cse2 (< .cse32 |old(~token~0)|) .cse33 .cse4 .cse8 .cse27 .cse10 .cse13 .cse28 .cse14 .cse29 .cse34 (< |old(~token~0)| .cse32))) (or .cse0 .cse1 .cse2 .cse35 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse36 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (< .cse36 |old(~token~0)|) .cse31 .cse11 .cse12 .cse25 .cse2 .cse33 .cse4 .cse26 .cse8 .cse27 .cse10 (not .cse16) .cse13 .cse28 .cse14 .cse29 .cse34 (< |old(~token~0)| .cse36))) (or .cse0 .cse1 .cse24 .cse3 .cse5 .cse6 .cse7 .cse31 .cse11 .cse12 .cse25 .cse2 .cse33 .cse4 .cse26 .cse8 .cse27 .cse10 .cse13 .cse28 .cse14 .cse29) (let ((.cse41 (= ~E_1~0 2)) (.cse44 (= ~t2_pc~0 0)) (.cse39 (= ~E_3~0 2)) (.cse46 (= ~t1_pc~0 0)) (.cse40 (= ~t3_pc~0 0)) (.cse43 (= ~t3_st~0 0)) (.cse42 (= ~E_M~0 2)) (.cse45 (= ~E_2~0 2)) (.cse47 (let ((.cse62 (= eval_~tmp~0 1))) (or (and .cse61 (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse62) (and .cse60 .cse59 .cse62)))) (.cse49 (<= ~t2_pc~0 0)) (.cse50 (= 0 ~t2_st~0)) (.cse37 (and .cse60 .cse56 .cse59))) (or (and .cse18 .cse19 .cse23 .cse22 .cse37 .cse38) (not (= 2 |old(~E_2~0)|)) (and .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (= ~t2_st~0 0) .cse45 .cse46 .cse47) (not (= ~T1_E~0 2)) (and .cse23 .cse48 .cse49 .cse50 .cse51 .cse47 .cse38) (and .cse52 (and .cse18 .cse53 .cse19 .cse48 .cse54 .cse20) .cse55) (and .cse18 .cse19 .cse23 .cse48 .cse54 .cse38) (not (= ~m_i~0 1)) (and (and .cse53 .cse48 .cse54 .cse20 .cse49) .cse50) (and .cse23 .cse48 .cse54 .cse49 .cse50 .cse38) (not (= 2 ~M_E~0)) (not (= ~T3_E~0 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and .cse56 .cse57 .cse58) (and .cse19 .cse23 .cse48 .cse18 .cse51 .cse47 .cse38) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 1 ~t3_i~0)) (and .cse41 (and (and .cse44 .cse39 .cse46 .cse40 .cse43) .cse59) .cse42 .cse45 .cse50) (not (= 2 |old(~E_1~0)|)) (and .cse19 .cse23 .cse18 .cse56 .cse22 .cse47 .cse38) (not (= 1 ~t2_i~0)) .cse29 (and (and .cse53 .cse20 .cse22 .cse49 .cse37) .cse50) (and (and .cse18 .cse53 .cse19 .cse20 .cse22 .cse37) .cse52 .cse55))) (or .cse0 .cse1 .cse24 .cse3 .cse63 .cse5 .cse6 .cse7 .cse11 .cse12 (and .cse18 .cse19 .cse56 .cse23 .cse59 .cse22 .cse38) .cse25 .cse2 .cse35 (and .cse18 .cse19 .cse23 .cse48 .cse21 .cse38) .cse8 .cse27 .cse10 .cse13 .cse28 .cse14 .cse29 .cse30) (or .cse0 .cse1 .cse24 .cse3 .cse63 .cse5 .cse6 .cse7 .cse31 .cse11 .cse12 .cse25 .cse2 .cse33 .cse35 .cse8 .cse27 .cse10 .cse13 .cse28 .cse14 .cse29))))))) [2018-12-02 03:28:50,623 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 404) no Hoare annotation was computed. [2018-12-02 03:28:50,623 INFO L448 ceAbstractionStarter]: For program point L352(lines 342 408) no Hoare annotation was computed. [2018-12-02 03:28:50,623 INFO L448 ceAbstractionStarter]: For program point L369(lines 369 376) no Hoare annotation was computed. [2018-12-02 03:28:50,624 INFO L444 ceAbstractionStarter]: At program point L394(lines 342 408) the Hoare annotation is: (let ((.cse51 (= ~T2_E~0 1)) (.cse53 (= ~T3_E~0 1)) (.cse60 (= ~T1_E~0 1)) (.cse50 (= ~T1_E~0 0)) (.cse55 (= ~T2_E~0 0))) (let ((.cse93 (and (not .cse50) (not .cse55) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse94 (not .cse60)) (.cse95 (not .cse53)) (.cse96 (not (= ~M_E~0 1))) (.cse97 (not .cse51)) (.cse99 (not (= ~E_M~0 1))) (.cse98 (not (= ~E_1~0 1))) (.cse100 (not (= ~E_3~0 1)))) (let ((.cse47 (= ~m_pc~0 1)) (.cse36 (= ~m_st~0 2)) (.cse18 (and (and (and .cse93 .cse94 .cse95 (= 1 ~t3_pc~0) .cse96 .cse97 .cse99) .cse98) .cse100)) (.cse90 (+ ~local~0 1)) (.cse91 (+ ~local~0 2)) (.cse92 (+ ~local~0 3)) (.cse48 (= ~m_st~0 0))) (let ((.cse39 (not .cse48)) (.cse85 (= 1 |old(~t3_pc~0)|)) (.cse4 (and (and .cse93 .cse94 .cse95 .cse96 .cse97 (not (= ~t3_pc~0 1)) .cse98 (= |old(~E_M~0)| ~E_M~0) .cse99) .cse100)) (.cse31 (<= .cse92 ~token~0)) (.cse32 (= 0 ~m_st~0)) (.cse33 (<= ~token~0 .cse92)) (.cse89 (<= 1 |old(~t2_pc~0)|)) (.cse12 (<= .cse91 ~token~0)) (.cse13 (<= ~token~0 .cse91)) (.cse22 (<= ~token~0 .cse90)) (.cse11 (<= 2 ~t1_st~0)) (.cse17 (= 0 ~t2_st~0)) (.cse23 (<= .cse90 ~token~0)) (.cse2 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (and .cse36 .cse18)) (.cse0 (= 1 ~t2_pc~0)) (.cse3 (= ~t1_st~0 0)) (.cse14 (<= 2 ~t3_st~0)) (.cse10 (<= 2 ~E_2~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse84 (= ~m_st~0 |old(~m_st~0)|)) (.cse40 (not .cse47))) (let ((.cse1 (<= ~t1_pc~0 0)) (.cse82 (< 0 |old(~t1_pc~0)|)) (.cse59 (and .cse84 .cse18 .cse40)) (.cse65 (= 0 |old(~E_2~0)|)) (.cse67 (= 1 |old(~m_pc~0)|)) (.cse70 (and (and .cse2 .cse8 .cse9 .cse0 .cse3 .cse14 .cse10) .cse19 .cse20)) (.cse74 (and .cse22 (and .cse8 .cse9 .cse0 .cse14 .cse10 .cse11 .cse17) .cse23)) (.cse75 (and .cse2 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13)) (.cse66 (= 0 |old(~m_st~0)|)) (.cse77 (and .cse2 .cse8 .cse9 .cse89 .cse0 .cse14 .cse10 .cse11)) (.cse79 (and .cse2 .cse8 .cse31 .cse89 .cse0 .cse14 .cse10 .cse32 .cse33 .cse11 .cse18)) (.cse69 (< |old(~t1_st~0)| 2)) (.cse61 (= 1 |old(~E_3~0)|)) (.cse62 (= 1 |old(~E_1~0)|)) (.cse52 (= 0 |old(~E_3~0)|)) (.cse83 (and .cse47 .cse84 .cse36 .cse18)) (.cse86 (and .cse47 .cse84 .cse4)) (.cse5 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse16 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (<= |old(~E_2~0)| ~E_2~0)) (.cse87 (and .cse84 .cse4 .cse40)) (.cse58 (= 1 |old(~E_M~0)|)) (.cse63 (= 0 |old(~E_1~0)|)) (.cse64 (= 0 |old(~E_M~0)|)) (.cse68 (not (= 2 |old(~m_st~0)|))) (.cse56 (= 0 ~M_E~0)) (.cse57 (= 1 ~M_E~0)) (.cse25 (= ~E_1~0 2)) (.cse35 (= ~E_3~0 2)) (.cse38 (= ~E_M~0 2)) (.cse26 (= ~t1_st~0 2)) (.cse34 (not (= 2 |old(~E_3~0)|))) (.cse71 (< |old(~t2_st~0)| 2)) (.cse73 (not (= |old(~t1_pc~0)| 1))) (.cse54 (not .cse85)) (.cse81 (< |old(~t3_st~0)| 2)) (.cse41 (not (= 2 |old(~E_M~0)|))) (.cse76 (not (= 1 |old(~t2_pc~0)|))) (.cse45 (not (= 2 |old(~E_1~0)|))) (.cse78 (< |old(~E_2~0)| 2)) (.cse46 (and .cse18 .cse39 .cse40))) (and (let ((.cse44 (= ~m_pc~0 0)) (.cse42 (= ~token~0 0)) (.cse43 (= ~local~0 0))) (let ((.cse15 (<= ~t2_pc~0 0)) (.cse27 (= ~t3_st~0 0)) (.cse28 (= ~t2_pc~0 0)) (.cse29 (= ~t2_st~0 0)) (.cse30 (= ~E_2~0 2)) (.cse37 (= ~t1_pc~0 0)) (.cse24 (= ~t3_pc~0 0)) (.cse6 (let ((.cse49 (= eval_~tmp~0 1))) (or (and .cse48 .cse44 .cse42 .cse43 .cse49) (and .cse47 .cse36 .cse49)))) (.cse21 (and .cse47 .cse4 .cse36))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse9 .cse15 .cse16 .cse17 .cse7) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse1 .cse14 .cse15 .cse17 .cse3 .cse18 .cse6 .cse7) (and .cse8 .cse3 .cse14 .cse9 .cse19 .cse15 .cse20 .cse17 .cse7) (and .cse8 .cse3 .cse19 .cse5 .cse15 .cse20 .cse21 .cse17 .cse7) (and .cse8 .cse14 .cse11 .cse15 .cse17 .cse18 .cse6 .cse7) (and .cse8 .cse0 .cse14 .cse11 .cse2 .cse18 .cse6 .cse7) (not (= ~m_i~0 1)) (and .cse8 .cse22 .cse0 .cse14 .cse9 .cse10 .cse23 .cse11 .cse17) (and (= ~t1_pc~0 1) .cse24 .cse25 .cse4 .cse26 .cse27 .cse28 .cse29 .cse30 .cse6) (and .cse2 .cse0 .cse1 .cse14 .cse9 .cse16 .cse7) (and .cse2 .cse8 .cse0 .cse14 .cse9 .cse11 .cse7) (not (= 2 ~M_E~0)) (and .cse8 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse19 (and .cse2 .cse8 .cse0 .cse14 .cse9 .cse10) .cse20) (not (= ~T3_E~0 2)) (and .cse8 .cse22 .cse0 .cse10 .cse23 .cse11 .cse5 .cse21 .cse17) (and .cse2 .cse0 .cse1 .cse5 .cse16 .cse21 .cse7) (and .cse2 .cse8 .cse31 .cse0 .cse14 .cse10 .cse32 .cse33 .cse11 .cse18) (and .cse8 .cse14 .cse9 .cse11 .cse15 .cse17 .cse7) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse34 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse25 (and .cse28 .cse3 .cse35 .cse36 .cse37 .cse24 .cse27) .cse38 .cse30 .cse17) (and .cse8 .cse11 .cse5 .cse15 .cse21 .cse17 .cse7) (not (= ~T2_E~0 2)) (and .cse4 .cse39 .cse40) (not (= 0 |old(~t3_st~0)|)) .cse41 (and .cse27 .cse28 .cse3 .cse29 .cse42 .cse43 .cse30 .cse37 (and (and .cse35 .cse44 .cse4 .cse24) .cse25)) (not (= 1 ~t3_i~0)) (and .cse2 .cse8 .cse0 .cse3 .cse19 .cse5 .cse20 .cse21 .cse7) .cse45 (not (= 1 ~t2_i~0)) .cse46 (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse18 .cse6 .cse7) (and .cse2 .cse8 .cse0 .cse11 .cse5 .cse21 .cse7)))) (or .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67) (let ((.cse72 (+ |old(~local~0)| 2))) (or .cse50 .cse51 .cse68 .cse53 .cse55 .cse56 .cse57 .cse69 .cse61 .cse62 .cse70 .cse71 .cse52 (< .cse72 |old(~token~0)|) .cse73 .cse74 .cse54 .cse75 .cse58 .cse76 .cse60 .cse77 .cse63 .cse78 .cse64 .cse46 .cse79 (< |old(~token~0)| .cse72))) (let ((.cse80 (and .cse2 .cse0 .cse14 .cse10 .cse83 .cse5))) (or .cse50 .cse51 .cse68 .cse53 .cse55 .cse56 .cse57 (and (and .cse80 .cse8) .cse11) .cse61 .cse62 .cse71 .cse52 .cse81 .cse54 .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46 .cse82 (and .cse80 .cse1 .cse16))) (or .cse50 .cse51 (and .cse16 (and (and .cse2 .cse0 .cse10 .cse5 (and .cse84 .cse18)) .cse8)) .cse68 .cse53 .cse55 .cse56 .cse57 .cse69 .cse61 .cse62 .cse71 .cse52 .cse73 .cse54 .cse81 .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46) (or .cse50 .cse51 .cse68 .cse53 .cse85 .cse55 .cse56 .cse57 .cse61 .cse62 (and .cse2 .cse8 .cse0 .cse14 .cse83 .cse11 .cse7) (and .cse2 .cse0 .cse86 .cse1 .cse5 .cse16 .cse7) .cse71 .cse52 (and .cse2 .cse0 .cse1 .cse14 .cse83 .cse16 .cse7) .cse87 (and .cse2 .cse8 .cse0 .cse86 .cse11 .cse5 .cse7) .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46 .cse82) (or .cse50 .cse51 .cse52 .cse87 .cse53 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67) (let ((.cse88 (+ |old(~local~0)| 3))) (or .cse50 .cse51 .cse53 .cse55 .cse56 .cse57 (< .cse88 |old(~token~0)|) .cse69 .cse61 .cse62 .cse70 .cse71 .cse52 .cse73 .cse54 .cse81 .cse74 .cse75 .cse58 .cse76 .cse60 (not .cse66) .cse63 .cse77 .cse78 .cse64 .cse46 .cse79 (< |old(~token~0)| .cse88))) (or .cse50 .cse51 .cse68 .cse53 .cse85 .cse55 .cse56 .cse57 .cse69 .cse61 .cse62 .cse71 .cse52 (and .cse2 .cse8 .cse0 .cse14 .cse83 .cse16 .cse7) (and .cse2 .cse8 .cse0 .cse86 .cse5 .cse16 .cse7) .cse73 .cse87 .cse58 .cse76 .cse60 .cse63 .cse78 .cse64 .cse46) (or .cse50 .cse51 .cse68 .cse53 .cse55 .cse56 .cse57 (and .cse25 .cse35 .cse38 .cse26) .cse34 .cse71 .cse73 .cse54 .cse81 .cse41 .cse76 (not (= |old(~t1_st~0)| 2)) .cse60 .cse45 .cse78 .cse46))))))) [2018-12-02 03:28:50,627 INFO L444 ceAbstractionStarter]: At program point L386(line 386) the Hoare annotation is: (let ((.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse66 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) (not (= ~E_3~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse10 (= ~T1_E~0 1)) (.cse67 (not .cse3)) (.cse68 (not (= ~M_E~0 1))) (.cse69 (not .cse1)) (.cse71 (not (= ~E_M~0 1))) (.cse70 (not (= ~E_1~0 1))) (.cse72 (not (= ~E_3~0 1)))) (let ((.cse65 (+ ~local~0 1)) (.cse40 (= ~m_st~0 2)) (.cse38 (and (and (and .cse66 (not .cse10) .cse67 (= 1 ~t3_pc~0) .cse68 .cse69 .cse71) .cse70) .cse72)) (.cse50 (= ~m_pc~0 1)) (.cse48 (= ~m_st~0 0))) (let ((.cse45 (not .cse48)) (.cse61 (= 1 |old(~t3_pc~0)|)) (.cse23 (and (and .cse66 .cse67 .cse68 .cse69 (not (= ~t3_pc~0 1)) .cse70 (= |old(~E_M~0)| ~E_M~0) .cse71) .cse72)) (.cse64 (= ~m_st~0 |old(~m_st~0)|)) (.cse46 (not .cse50)) (.cse29 (= 1 ~t1_pc~0)) (.cse33 (and .cse40 .cse38)) (.cse31 (= 1 ~t2_pc~0)) (.cse32 (<= 2 ~t3_st~0)) (.cse34 (<= 2 ~E_2~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse30 (<= ~token~0 .cse65)) (.cse35 (<= .cse65 ~token~0))) (let ((.cse53 (and (and .cse29 .cse33 .cse31 .cse32 .cse34 .cse36) .cse30 .cse35)) (.cse9 (and .cse64 .cse38 .cse46)) (.cse15 (= 0 |old(~E_2~0)|)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse52 (< |old(~t1_st~0)| 2)) (.cse55 (not (= |old(~t1_pc~0)| 1))) (.cse62 (and .cse64 .cse23 .cse46)) (.cse59 (not (= 2 |old(~m_st~0)|))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse54 (< |old(~t2_st~0)| 2)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse56 (< |old(~t3_st~0)| 2)) (.cse4 (not .cse61)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse57 (not (= 1 |old(~t2_pc~0)|))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse58 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse47 (and .cse38 .cse45 .cse46)) (.cse63 (< 0 |old(~t1_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (= ~E_1~0 2)) (.cse21 (= ~t2_pc~0 0)) (.cse18 (= ~E_3~0 2)) (.cse26 (= ~t1_pc~0 0)) (.cse19 (= ~t3_pc~0 0)) (.cse28 (= ~t3_st~0 0)) (.cse25 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse41 (and .cse23 .cse40)) (.cse42 (<= ~token~0 ~local~0)) (.cse43 (<= ~local~0 ~token~0)) (.cse44 (<= ~t1_pc~0 0)) (.cse37 (<= ~t2_pc~0 0)) (.cse22 (= ~t1_st~0 0)) (.cse27 (let ((.cse49 (= eval_~tmp~0 1))) (or (and .cse48 (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse49) (and .cse50 .cse40 .cse49)))) (.cse39 (<= |old(~E_2~0)| ~E_2~0))) (or (let ((.cse24 (= ~E_2~0 2))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22 (= 0 ~m_st~0) .cse23 .cse24 .cse25 .cse26 .cse27) (and (= ~t1_pc~0 1) .cse19 (= ~t1_st~0 2) .cse28 .cse20 .cse21 .cse23 .cse24 .cse27))) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (not (= ~m_i~0 1)) (and .cse29 .cse32 .cse36 .cse37 .cse38 .cse27 .cse39) (not (= 2 ~M_E~0)) (not (= ~T3_E~0 2)) (and .cse20 .cse22 (and .cse40 (and .cse21 .cse18 .cse26 .cse19 .cse28)) (= ~E_M~0 2) .cse39) (and .cse29 .cse31 .cse34 .cse36 .cse25 .cse41) (and .cse29 .cse22 .cse42 .cse25 .cse37 .cse43 .cse41 .cse39) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse29 .cse32 .cse33 .cse36 .cse37 .cse39) (and .cse44 .cse32 .cse33 .cse37 (<= |old(~t1_st~0)| ~t1_st~0) .cse39) (and .cse29 .cse36 .cse25 .cse37 .cse41 .cse39) (not (= ~T2_E~0 2)) (and .cse23 .cse45 .cse46) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (and .cse29 .cse22 .cse32 .cse33 .cse42 .cse37 .cse43 .cse39) (not (= 1 ~t3_i~0)) (and .cse44 .cse32 .cse37 .cse22 .cse38 .cse27 .cse39) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse47)) (let ((.cse51 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (< .cse51 |old(~token~0)|) .cse52 .cse11 .cse12 .cse53 .cse54 .cse2 .cse55 .cse4 .cse56 .cse8 .cse57 .cse10 (not .cse16) .cse13 .cse58 .cse14 .cse47 (< |old(~token~0)| .cse51))) (let ((.cse60 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse59 .cse3 .cse5 .cse6 .cse7 .cse52 .cse11 .cse12 .cse53 .cse54 .cse2 (< .cse60 |old(~token~0)|) .cse55 .cse4 .cse8 .cse57 .cse10 .cse13 .cse58 .cse14 .cse47 (< |old(~token~0)| .cse60))) (or .cse0 .cse1 .cse59 .cse3 .cse61 .cse5 .cse6 .cse7 .cse52 .cse11 .cse12 .cse54 .cse2 .cse55 .cse62 .cse8 .cse57 .cse10 .cse13 .cse58 .cse14 .cse47) (or .cse0 .cse1 .cse2 .cse62 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse59 .cse3 .cse5 .cse6 .cse7 .cse52 .cse11 .cse12 .cse54 .cse2 .cse55 .cse4 .cse56 .cse8 .cse57 .cse10 .cse13 .cse58 .cse14 .cse47) (or .cse0 .cse1 .cse59 .cse3 .cse61 .cse5 .cse6 .cse7 .cse11 .cse12 .cse54 .cse2 .cse62 .cse8 .cse57 .cse10 .cse13 .cse58 .cse14 .cse47 .cse63) (or .cse0 .cse1 .cse59 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse54 .cse2 .cse56 .cse4 .cse8 .cse57 .cse10 .cse13 .cse58 .cse14 .cse47 .cse63))))))) [2018-12-02 03:28:50,632 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2018-12-02 03:28:50,632 INFO L448 ceAbstractionStarter]: For program point is_transmit3_triggeredEXIT(lines 251 269) no Hoare annotation was computed. [2018-12-02 03:28:50,632 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 264) no Hoare annotation was computed. [2018-12-02 03:28:50,632 INFO L451 ceAbstractionStarter]: At program point is_transmit3_triggeredENTRY(lines 251 269) the Hoare annotation is: true [2018-12-02 03:28:50,632 INFO L448 ceAbstractionStarter]: For program point L255-2(lines 255 264) no Hoare annotation was computed. [2018-12-02 03:28:50,632 INFO L448 ceAbstractionStarter]: For program point is_transmit3_triggeredFINAL(lines 251 269) no Hoare annotation was computed. [2018-12-02 03:28:50,633 INFO L444 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse25 (= 1 ~t3_pc~0))) (let ((.cse22 (not .cse25)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse10 (= 0 ~E_3~0)) (.cse20 (= ~T3_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse15 (= ~T1_E~0 1)) (.cse16 (= 0 ~E_1~0)) (.cse18 (= 0 ~E_M~0)) (.cse31 (= 0 ~E_2~0))) (let ((.cse51 (or .cse0 .cse1 .cse10 .cse20 .cse25 .cse3 .cse4 .cse5 .cse13 .cse15 .cse16 .cse18 .cse31)) (.cse33 (= 1 ~m_pc~0)) (.cse53 (+ ~local~0 1)) (.cse54 (+ ~local~0 3)) (.cse55 (+ ~local~0 2)) (.cse7 (= 1 ~E_3~0)) (.cse32 (= 0 ~m_st~0)) (.cse52 (or .cse0 .cse1 .cse10 .cse20 .cse22 .cse3 .cse4 .cse5 .cse13 .cse15 .cse16 .cse18))) (let ((.cse27 (or .cse7 .cse32 .cse52)) (.cse46 (< .cse55 ~token~0)) (.cse47 (< ~token~0 .cse55)) (.cse21 (< .cse54 ~token~0)) (.cse23 (not .cse32)) (.cse24 (< ~token~0 .cse54)) (.cse6 (< ~t1_st~0 2)) (.cse49 (< ~token~0 .cse53)) (.cse50 (< .cse53 ~token~0)) (.cse37 (or .cse7 .cse32 .cse51 .cse33)) (.cse34 (or .cse7 .cse32 .cse52 .cse33)) (.cse36 (< 0 ~t2_pc~0)) (.cse28 (< ~local~0 ~token~0)) (.cse11 (not (= ~t1_pc~0 1))) (.cse29 (< ~token~0 ~local~0)) (.cse42 (not (= 0 ~t3_st~0))) (.cse43 (not (= 0 ~t3_pc~0))) (.cse44 (not (= 2 ~E_M~0))) (.cse30 (not (= ~t1_st~0 0))) (.cse39 (not (= ~t1_pc~0 0))) (.cse38 (= is_transmit3_triggered_~__retres1~3 0)) (.cse35 (not (= 0 ~t2_st~0))) (.cse40 (not (= 2 ~E_3~0))) (.cse45 (not (= 0 ~t2_pc~0))) (.cse41 (not (= 0 ~m_pc~0))) (.cse48 (or .cse15 .cse0 .cse1 .cse10 .cse16 .cse18 .cse31 .cse20 .cse22 .cse3 .cse4 .cse5)) (.cse9 (< ~t2_st~0 2)) (.cse2 (not (= 2 ~m_st~0))) (.cse19 (= 0 is_transmit3_triggered_~__retres1~3)) (.cse12 (< ~t3_st~0 2)) (.cse14 (not (= 1 ~t2_pc~0))) (.cse8 (= 1 ~E_1~0)) (.cse17 (< ~E_2~0 2)) (.cse26 (< 0 ~t1_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 .cse20 .cse3 .cse4 .cse21 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse24) (or .cse0 .cse9 .cse1 .cse10 .cse2 .cse25 .cse3 .cse19 .cse4 .cse5 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18 .cse26) (or .cse14 .cse27 .cse9 .cse19 .cse28 .cse11 .cse29 .cse17 .cse12 .cse30) (or .cse0 .cse1 .cse10 .cse20 .cse3 .cse4 .cse13 .cse15 .cse7 .cse8 .cse16 .cse19 .cse18 .cse31 .cse32 .cse33) (or .cse0 .cse9 .cse1 .cse10 .cse2 .cse11 .cse20 .cse12 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15 .cse19 .cse7 .cse8 .cse16 .cse18 .cse31) (or .cse0 .cse9 .cse1 .cse10 .cse2 .cse20 .cse19 .cse25 .cse3 .cse4 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18 .cse26) (or .cse34 .cse6 .cse19 .cse35 .cse36 .cse11 .cse17 .cse12) (or .cse34 .cse35 .cse36 .cse17 .cse12 .cse19 .cse26) (or .cse0 .cse9 .cse1 .cse10 .cse2 .cse11 .cse20 .cse25 .cse3 .cse4 .cse5 .cse19 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse18 .cse31) (or .cse6 .cse35 .cse36 .cse11 .cse17 .cse19 .cse37) (or (not (= 2 ~E_2~0)) (not (= ~T3_E~0 2)) .cse38 (not (= ~T1_E~0 2)) (or (not (= ~token~0 0)) .cse39 .cse40 (not (= 0 ~local~0)) .cse30) (not (= 1 ~t1_i~0)) .cse41 (not (= ~T2_E~0 2)) .cse42 .cse43 .cse44 (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) .cse35 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse45 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse46 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse47) (or .cse14 .cse19 .cse9 .cse17 .cse26 .cse37) (or .cse19 .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse14 .cse9 .cse28 .cse11 .cse29 .cse17 .cse19 .cse37 .cse30) (or .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse46 .cse11 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse47) (or .cse14 .cse34 .cse19 .cse9 .cse17 .cse12 .cse26) (or .cse0 .cse19 .cse1 .cse10 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse8 .cse16 .cse18 .cse31 .cse32 .cse33) (or .cse9 .cse11 .cse19 .cse21 .cse14 .cse6 .cse23 .cse7 .cse8 .cse17 .cse48 .cse24) (or .cse0 .cse9 .cse1 .cse10 .cse2 .cse11 .cse20 .cse25 .cse3 .cse4 .cse13 .cse14 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse19 .cse18) (or .cse0 .cse9 .cse1 .cse10 .cse19 .cse2 .cse11 .cse25 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18) (or .cse14 .cse6 .cse27 .cse19 .cse9 .cse11 .cse17 .cse12) (or .cse0 .cse19 .cse9 .cse1 .cse10 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18 .cse26) (or .cse0 .cse19 .cse1 .cse10 .cse2 .cse11 .cse20 .cse25 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse15 .cse8 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse20 .cse25 .cse3 .cse4 .cse5 .cse7 .cse49 .cse8 .cse31 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse35 .cse16 .cse50 .cse18) (or .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse46 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse47) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse24) (or .cse19 .cse0 .cse1 .cse36 .cse10 .cse2 .cse11 .cse20 .cse12 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse8 .cse35 .cse16 .cse18 .cse31) (or .cse19 .cse0 .cse1 .cse36 .cse10 .cse2 .cse11 .cse20 .cse25 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse8 .cse35 .cse16 .cse18 .cse31) (or .cse9 .cse2 .cse11 .cse14 .cse6 .cse7 .cse8 .cse19 .cse17 .cse48) (or .cse0 .cse1 .cse10 .cse20 .cse25 .cse3 .cse4 .cse5 .cse13 .cse15 .cse8 .cse19 .cse16 .cse18 .cse31 .cse32 .cse33) (or .cse14 .cse6 .cse9 .cse19 .cse11 .cse17 .cse37) (or .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse7 .cse49 .cse8 .cse31 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse15 .cse35 .cse16 .cse50 .cse18) (or .cse35 .cse19 .cse36 .cse28 .cse11 .cse29 .cse17 .cse37 .cse30) (or .cse34 .cse19 .cse35 .cse36 .cse28 .cse11 .cse29 .cse17 .cse12 .cse30) (or .cse42 .cse43 .cse44 .cse30 .cse39 .cse38 .cse35 .cse40 .cse17 .cse32 .cse45 .cse51 .cse41) (or .cse7 .cse8 .cse19 .cse32 .cse48 .cse33) (or .cse0 .cse9 .cse1 .cse10 .cse2 .cse19 .cse20 .cse12 .cse3 .cse4 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse18 .cse26)))))) [2018-12-02 03:28:50,638 INFO L448 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-12-02 03:28:50,638 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 704) no Hoare annotation was computed. [2018-12-02 03:28:50,638 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 653 711) no Hoare annotation was computed. [2018-12-02 03:28:50,638 INFO L448 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-12-02 03:28:50,639 INFO L444 ceAbstractionStarter]: At program point L663(line 663) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-02 03:28:50,639 INFO L444 ceAbstractionStarter]: At program point L661(line 661) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0))) [2018-12-02 03:28:50,641 INFO L444 ceAbstractionStarter]: At program point L661-1(line 661) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0))) [2018-12-02 03:28:50,641 INFO L444 ceAbstractionStarter]: At program point L690(line 690) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,642 INFO L444 ceAbstractionStarter]: At program point L690-1(line 690) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse18 (not (= ~T3_E~0 1))) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse20 (and (not (= ~E_3~0 0)) (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse21 (not (= ~E_1~0 1))) (.cse22 (not (= ~E_3~0 1)))) (let ((.cse12 (and (and (and .cse17 .cse18 .cse19 (not (= ~t3_pc~0 1)) .cse20) .cse21 (= |old(~E_M~0)| ~E_M~0)) .cse22)) (.cse16 (= ~m_pc~0 1)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse9 (<= 2 ~t3_st~0)) (.cse11 (and (and (and (and .cse17 (not (= ~T1_E~0 1)) .cse18 (= 1 ~t3_pc~0) .cse19 .cse20) (not (= ~E_M~0 1))) .cse21) .cse22)) (.cse10 (<= 2 ~E_2~0))) (let ((.cse0 (and .cse7 .cse8 .cse9 .cse11 .cse10)) (.cse4 (<= ~t1_pc~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not .cse16)) (.cse5 (and .cse7 .cse16 .cse8 .cse12 .cse10)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse4 .cse5 .cse2) (let ((.cse6 (+ ~local~0 3))) (and .cse1 (<= .cse6 ~token~0) (<= ~token~0 .cse6) .cse3 (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))))) (and .cse12 .cse13 .cse14) (not (= ~m_i~0 1)) (and .cse0 .cse4 .cse2) (not (= 2 |old(~M_E~0)|)) (not (= |old(~T3_E~0)| 2)) (and .cse11 .cse13 .cse14) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse1 .cse5 .cse2 .cse3) (let ((.cse15 (+ ~local~0 2))) (and .cse1 .cse2 .cse3 (<= .cse15 ~token~0) (and .cse7 .cse8 .cse11 .cse10) (<= ~token~0 .cse15))) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,644 INFO L444 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,646 INFO L444 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,650 INFO L444 ceAbstractionStarter]: At program point L680-1(line 680) the Hoare annotation is: (let ((.cse18 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse21 (not (= ~M_E~0 1))) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_3~0 1)))) (let ((.cse12 (and (and .cse18 (and .cse20 .cse21 (not (= ~t3_pc~0 1))) .cse19 .cse22 (= |old(~E_M~0)| ~E_M~0)) .cse23)) (.cse16 (= ~m_pc~0 1)) (.cse3 (<= 2 ~t2_st~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~t3_st~0)) (.cse17 (<= 2 ~E_2~0)) (.cse9 (= ~m_st~0 2)) (.cse4 (and (and (and .cse18 (not (= ~T1_E~0 1)) .cse19 (not (= ~T2_E~0 1)) (and (= 1 ~t3_pc~0) .cse20 .cse21) (not (= ~E_M~0 1))) .cse22) .cse23))) (let ((.cse11 (and .cse3 .cse5 .cse6 .cse17 .cse9 .cse4)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not .cse16)) (.cse8 (and .cse3 .cse16 .cse5 .cse17 .cse12)) (.cse10 (<= ~t1_pc~0 0)) (.cse0 (= 1 ~t1_pc~0)) (.cse7 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (<= 2 ~t1_st~0))) (or (let ((.cse1 (+ ~local~0 3))) (and .cse0 (<= .cse1 ~token~0) (<= ~token~0 .cse1) .cse2 (and .cse3 (and (= 0 ~m_st~0) .cse4) .cse5 .cse6 .cse7))) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse8 .cse9 .cse2) (and .cse10 .cse11) (and .cse0 .cse2 .cse11) (not (= ~m_i~0 1)) (and .cse12 .cse13 .cse14) (not (= 2 |old(~M_E~0)|)) (not (= |old(~T3_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse13 .cse4 .cse14) (and .cse8 .cse10 .cse9) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse0 (and .cse3 .cse5 .cse9 .cse4 .cse7) .cse2 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,651 INFO L444 ceAbstractionStarter]: At program point L676(line 676) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,654 INFO L448 ceAbstractionStarter]: For program point L676-1(line 676) no Hoare annotation was computed. [2018-12-02 03:28:50,654 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 653 711) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0))) [2018-12-02 03:28:50,654 INFO L444 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and (= ~E_3~0 2) (= ~m_pc~0 0) (= ~t3_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,655 INFO L448 ceAbstractionStarter]: For program point L672-1(line 672) no Hoare annotation was computed. [2018-12-02 03:28:50,655 INFO L444 ceAbstractionStarter]: At program point L668-1(lines 665 705) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and (= ~E_3~0 2) (= ~m_pc~0 0) (= ~t3_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,657 INFO L444 ceAbstractionStarter]: At program point L664(line 664) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-02 03:28:50,658 INFO L444 ceAbstractionStarter]: At program point L662(line 662) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-02 03:28:50,661 INFO L444 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse18 (not (= ~T3_E~0 1))) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse20 (and (not (= ~E_3~0 0)) (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse21 (not (= ~E_1~0 1))) (.cse22 (not (= ~E_3~0 1)))) (let ((.cse12 (and (and (and .cse17 .cse18 .cse19 (not (= ~t3_pc~0 1)) .cse20) .cse21 (= |old(~E_M~0)| ~E_M~0)) .cse22)) (.cse16 (= ~m_pc~0 1)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse9 (<= 2 ~t3_st~0)) (.cse11 (and (and (and (and .cse17 (not (= ~T1_E~0 1)) .cse18 (= 1 ~t3_pc~0) .cse19 .cse20) (not (= ~E_M~0 1))) .cse21) .cse22)) (.cse10 (<= 2 ~E_2~0))) (let ((.cse0 (and .cse7 .cse8 .cse9 .cse11 .cse10)) (.cse4 (<= ~t1_pc~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not .cse16)) (.cse5 (and .cse7 .cse16 .cse8 .cse12 .cse10)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse4 .cse5 .cse2) (let ((.cse6 (+ ~local~0 3))) (and .cse1 (<= .cse6 ~token~0) (<= ~token~0 .cse6) .cse3 (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))))) (and .cse12 .cse13 .cse14) (not (= ~m_i~0 1)) (and .cse0 .cse4 .cse2) (not (= 2 |old(~M_E~0)|)) (not (= |old(~T3_E~0)| 2)) (and .cse11 .cse13 .cse14) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse1 .cse5 .cse2 .cse3) (let ((.cse15 (+ ~local~0 2))) (and .cse1 .cse2 .cse3 (<= .cse15 ~token~0) (and .cse7 .cse8 .cse11 .cse10) (<= ~token~0 .cse15))) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,661 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 696) no Hoare annotation was computed. [2018-12-02 03:28:50,661 INFO L444 ceAbstractionStarter]: At program point L687-1(lines 687 696) the Hoare annotation is: (let ((.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (not (= ~T1_E~0 1))) (.cse21 (not (= ~T3_E~0 1))) (.cse22 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (not (= ~T2_E~0 1))) (.cse18 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse19 (not (= ~M_E~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= ~E_1~0 1))) (.cse26 (not (= ~E_3~0 1)))) (let ((.cse11 (and (and (and (and .cse17 .cse20 .cse21 .cse22 .cse23 (and (= 1 ~t3_pc~0) .cse18 .cse19)) .cse25) .cse24) .cse26)) (.cse9 (<= 2 ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse2 (and (and (and .cse17 (and .cse18 .cse19 (not (= ~t3_pc~0 1))) .cse20 .cse21 .cse22 .cse23) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25) .cse26)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ~m_st~0 2)) (.cse16 (= ~m_pc~0 1))) (let ((.cse3 (not (= ~m_st~0 0))) (.cse4 (not .cse16)) (.cse1 (<= ~t1_pc~0 0)) (.cse13 (and .cse7 .cse16 .cse8 .cse2 .cse10 .cse14)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (and .cse7 .cse16 .cse11 .cse8 .cse9 .cse10 .cse14)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (let ((.cse6 (+ ~local~0 3))) (and .cse5 (<= .cse6 ~token~0) (and .cse7 .cse8 .cse9 .cse10 (and .cse11 (= 0 ~m_st~0))) (<= ~token~0 .cse6) .cse12)) (not (= ~m_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse11 .cse3 .cse4) (not (= |old(~T3_E~0)| 2)) (and .cse5 .cse12 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse5 (and .cse7 .cse11 .cse8 .cse10) .cse14 .cse12 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (and .cse1 .cse13) (and .cse5 .cse0 .cse12) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,663 INFO L448 ceAbstractionStarter]: For program point L685(line 685) no Hoare annotation was computed. [2018-12-02 03:28:50,664 INFO L444 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (let ((.cse18 (= |old(~T2_E~0)| ~T2_E~0)) (.cse20 (and (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse21 (not (= ~M_E~0 1))) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_3~0 1)))) (let ((.cse12 (and (and .cse18 (and .cse20 .cse21 (not (= ~t3_pc~0 1))) .cse19 .cse22 (= |old(~E_M~0)| ~E_M~0)) .cse23)) (.cse16 (= ~m_pc~0 1)) (.cse3 (<= 2 ~t2_st~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~t3_st~0)) (.cse17 (<= 2 ~E_2~0)) (.cse9 (= ~m_st~0 2)) (.cse4 (and (and (and .cse18 (not (= ~T1_E~0 1)) .cse19 (not (= ~T2_E~0 1)) (and (= 1 ~t3_pc~0) .cse20 .cse21) (not (= ~E_M~0 1))) .cse22) .cse23))) (let ((.cse11 (and .cse3 .cse5 .cse6 .cse17 .cse9 .cse4)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not .cse16)) (.cse8 (and .cse3 .cse16 .cse5 .cse17 .cse12)) (.cse10 (<= ~t1_pc~0 0)) (.cse0 (= 1 ~t1_pc~0)) (.cse7 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (<= 2 ~t1_st~0))) (or (let ((.cse1 (+ ~local~0 3))) (and .cse0 (<= .cse1 ~token~0) (<= ~token~0 .cse1) .cse2 (and .cse3 (and (= 0 ~m_st~0) .cse4) .cse5 .cse6 .cse7))) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse8 .cse9 .cse2) (and .cse10 .cse11) (and .cse0 .cse2 .cse11) (not (= ~m_i~0 1)) (and .cse12 .cse13 .cse14) (not (= 2 |old(~M_E~0)|)) (not (= |old(~T3_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (and .cse13 .cse4 .cse14) (and .cse8 .cse10 .cse9) (not (= |old(~T2_E~0)| 2)) (let ((.cse15 (+ ~local~0 2))) (and .cse0 (and .cse3 .cse5 .cse9 .cse4 .cse7) .cse2 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)))))) [2018-12-02 03:28:50,665 INFO L444 ceAbstractionStarter]: At program point L706(lines 653 711) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= ~M_E~0 0)) (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~local~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~T2_E~0)| 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-02 03:28:50,665 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 270 277) no Hoare annotation was computed. [2018-12-02 03:28:50,665 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 270 277) the Hoare annotation is: true [2018-12-02 03:28:50,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 03:28:50,665 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~E_3~0 2) (= ~T1_E~0 2) (= ~E_M~0 2) (= ~m_pc~0 0) (= ~t3_pc~0 0) (= ~t3_st~0 0) (= ~M_E~0 2) (= ~E_1~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= 0 ~m_st~0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) [2018-12-02 03:28:50,665 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 03:28:50,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 03:28:50,665 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 622 633) no Hoare annotation was computed. [2018-12-02 03:28:50,667 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 622 633) no Hoare annotation was computed. [2018-12-02 03:28:50,668 INFO L451 ceAbstractionStarter]: At program point init_modelENTRY(lines 622 633) the Hoare annotation is: true [2018-12-02 03:28:50,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:28:50 BoogieIcfgContainer [2018-12-02 03:28:50,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:28:50,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:28:50,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:28:50,741 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:28:50,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:24:26" (3/4) ... [2018-12-02 03:28:50,744 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit3 [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-12-02 03:28:50,748 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit3_triggered [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-02 03:28:50,749 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-02 03:28:50,754 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-12-02 03:28:50,755 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 03:28:50,772 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(2 == \old(E_2)) || !(\old(T1_E) == 2)) || (((((((2 <= t2_st && m_pc == 1) && (((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && t1_pc <= 0)) || (((((((((((\old(T2_E) == T2_E && (((((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(t3_pc == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((1 == t1_pc && local + 3 <= token) && (((2 <= t2_st && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && ((((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 0 == m_st) && token <= local + 3) && 2 <= t1_st)) || !(m_i == 1)) || !(2 == \old(M_E))) || ((((((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || !(\old(T3_E) == 2)) || ((1 == t1_pc && 2 <= t1_st) && ((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && ((((((((\old(T2_E) == T2_E && (((((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(t3_pc == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && 2 <= E_2) && m_st == 2)) || (((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || ((((((((((((((((E_3 == 2 && m_pc == 0) && t3_pc == 0) && E_1 == 2) && T1_E == 2) && E_M == 2) && t3_st == 0) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && T3_E == 2) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(\old(T2_E) == 2)) || (((((1 == t1_pc && ((2 <= t2_st && (((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(2 == \old(E_1))) || (t1_pc <= 0 && ((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && ((((((((\old(T2_E) == T2_E && (((((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(t3_pc == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && 2 <= E_2) && m_st == 2)) || ((1 == t1_pc && (((((2 <= t2_st && m_pc == 1) && (((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && 2 <= t1_st)) || !(1 == t2_i) [2018-12-02 03:28:50,772 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(2 == \old(E_2)) || !(M_E == 0)) || !(\old(T3_E) == 2)) || !(\old(T1_E) == 2)) || (((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(\old(T2_E) == 2)) || !(0 == \old(t3_st))) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-12-02 03:28:50,772 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((((1 == t2_pc && t1_pc <= 0) && 2 <= t2_st) && t1_st == 0) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((t1_pc <= 0 && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && t2_pc <= 0) && \old(t1_st) <= t1_st) && 0 == t2_st) && \old(E_2) <= E_2)) || !(2 == \old(E_2))) || !(T1_E == 2)) || (((((((t1_pc <= 0 && 2 <= t3_st) && t2_pc <= 0) && 0 == t2_st) && t1_st == 0) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && t1_st == 0) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local) && t2_pc <= 0) && local <= token) && 0 == t2_st) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && t1_st == 0) && token <= local) && \old(t3_st) <= t3_st) && t2_pc <= 0) && local <= token) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || (((((((1 == t1_pc && 2 <= t3_st) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && 2 <= t1_st) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || !(m_i == 1)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && 0 == t2_st)) || (((((((((t1_pc == 1 && t3_pc == 0) && E_1 == 2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && t1_st == 2) && t3_st == 0) && t2_pc == 0) && t2_st == 0) && E_2 == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1)))) || ((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st) && \old(E_2) <= E_2)) || !(2 == M_E)) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t1_st) && 2 <= t2_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || (((t1_st == 0 && token <= local) && ((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= E_2) && local <= token)) || !(T3_E == 2)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && \old(t3_st) <= t3_st) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && 0 == t2_st)) || ((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(E_2) <= E_2)) || (((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || ((((((1 == t1_pc && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && \old(E_2) <= E_2)) || (((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || ((((E_1 == 2 && (((((t2_pc == 0 && t1_st == 0) && E_3 == 2) && m_st == 2) && t1_pc == 0) && t3_pc == 0) && t3_st == 0) && E_M == 2) && E_2 == 2) && 0 == t2_st)) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && t2_pc <= 0) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || !(T2_E == 2)) || (((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || ((((((((t3_st == 0 && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0) && (((E_3 == 2 && m_pc == 0) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && t3_pc == 0) && E_1 == 2)) || !(1 == t3_i)) || ((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && t1_st == 0) && token <= local) && \old(t3_st) <= t3_st) && local <= token) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(E_2) <= E_2)) || !(2 == \old(E_1))) || !(1 == t2_i)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || (((((((1 == t2_pc && t1_pc <= 0) && 2 <= t3_st) && 2 <= t2_st) && t1_st == 0) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && \old(t3_st) <= t3_st) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(E_2) <= E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(1 == \old(t3_pc))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && t1_st == 0) && 2 <= t3_st) && 2 <= E_2) && token <= local) && local <= token)) || \old(t2_st) < 2) || 0 == \old(E_3)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || ((token <= local + 1 && (((((1 == t1_pc && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && local + 1 <= token)) || !(1 == \old(t3_pc))) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st)) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((((2 <= t2_st && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && 1 == t1_pc) && 2 <= t1_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc)) || (((((((2 <= t2_st && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && t1_pc <= 0) && \old(t1_st) <= t1_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (\old(t1_st) <= t1_st && ((((2 <= t2_st && 1 == t2_pc) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t1_pc)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t2_pc) && (m_pc == 1 && m_st == \old(m_st)) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && t1_pc <= 0) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && 2 <= t3_st) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && (m_pc == 1 && m_st == \old(m_st)) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && 2 <= t1_st) && \old(t3_st) <= t3_st) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && t1_st == 0) && 2 <= t3_st) && 2 <= E_2) && token <= local) && local <= token)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || ((token <= local + 1 && (((((1 == t1_pc && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && local + 1 <= token)) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && (m_pc == 1 && m_st == \old(m_st)) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || !(\old(t1_pc) == 1)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((E_1 == 2 && E_3 == 2) && E_M == 2) && t1_st == 2)) || !(2 == \old(E_3))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || T1_E == 1) || !(2 == \old(E_1))) || \old(E_2) < 2) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) [2018-12-02 03:28:50,773 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(1 == \old(t3_pc))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || ((1 == t1_pc && (((((2 <= t2_st && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && m_st == 2) && \old(t3_st) <= t3_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((t1_pc <= 0 && (((((2 <= t2_st && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && m_st == 2) && \old(t3_st) <= t3_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st)) || ((1 == t1_pc && (((((2 <= t2_st && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && m_st == 2) && \old(t3_st) <= t3_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == \old(E_3))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || T1_E == 1) || (((E_1 == 2 && E_3 == 2) && E_M == 2) && t1_st == 2)) || !(2 == \old(E_1))) || \old(E_2) < 2) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local + 2) || T1_E == 0) || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 3)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || (((((((1 == t2_pc && t1_pc <= 0) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && t1_pc <= 0) && \old(t1_st) <= t1_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && m_st == 2) && 2 <= t1_st) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(E_2) <= E_2)) || 0 == \old(E_3)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || (2 <= t1_st && (1 == t1_pc && (((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && 1 <= \old(t2_pc))) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((1 == t1_pc && (((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && 1 <= \old(t2_pc)) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2))) && (((((((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local + 2) || T1_E == 0) || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local + 2) || !(2 == \old(E_2))) || ((1 == t1_pc && 2 <= t1_st) && ((((2 <= t2_st && 1 == t2_pc) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(t3_st) <= t3_st)) || !(T1_E == 2)) || !(m_i == 1)) || !(2 == M_E)) || ((t1_pc <= 0 && ((((2 <= t2_st && 1 == t2_pc) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(E_2) <= E_2)) || !(T3_E == 2)) || (((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || (((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || (((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && 2 <= t3_st) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || !(T2_E == 2)) || (((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(2 == \old(E_1))) || !(1 == t2_i)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) [2018-12-02 03:28:50,774 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || ((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && 2 <= t2_st) && \old(t1_st) <= t1_st) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) && ((((((((((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st) || !(1 == t2_pc)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t2_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) || 0 < t1_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || 0 < t2_pc) || (((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((\old(t2_st) < 2 || !(t1_pc == 1)) || !(1 == t2_pc)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && 2 <= t2_st) && \old(t1_st) <= t1_st) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || ((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && 0 == t2_st) && \old(t1_st) <= t1_st) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || (((((((\old(E_1) == E_1 && local + 3 <= token) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && token <= local + 3) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || (((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || !(0 == \old(m_pc))) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || !(m_pc == 1)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3) || 1 == \old(m_pc))) && (((((((((((((((((((((((((m_st == \old(m_st) && t1_st == 0) && m_pc == 0) && E_1 == 2) && t3_st == 0) && t2_st == 0) && token == 0) && local == 0) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc) || (((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) [2018-12-02 03:28:50,774 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(1 == t2_pc) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t2_st) < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || E_2 < 2) || !(0 == \old(m_pc))) || 0 < t1_pc) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(M_E == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_pc == 1) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || (((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || T2_E == 1) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(M_E == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_pc == 1) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || (((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((((((((((((((((E_1 == 2 && m_pc == 1) && m_st == 2) && t3_st == 0) && t1_st == 0) && t2_st == 0) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((0 < t2_pc || !(t1_pc == 1)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || !(0 == \old(t2_st))) || E_2 < 2) || !(0 == \old(m_pc))) || ((((((((token <= local && \old(t3_st) <= t3_st) && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && t1_st == 0) && !(E_1 == 0)) && local <= token))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || ((((((((token <= local && \old(t3_st) <= t3_st) && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && t1_st == 0) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || T1_E == 1) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((\old(t2_st) < 2 || ((((((((token <= local && \old(t3_st) <= t3_st) && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && t1_st == 0) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || !(1 == t2_pc)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || !(0 == \old(m_pc))) [2018-12-02 03:28:50,778 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 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)) || 0 == E_M) || 0 == \old(m_st)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || 0 < t2_pc) || \old(local) < \old(token)) || !(0 == \old(local))) || !(t1_pc == 1)) || \old(token) < \old(local)) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((!(1 == t2_pc) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t2_st) < 2) || !(0 == \old(local))) || E_2 < 2) || !(0 == \old(m_pc))) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || (((((((\old(E_1) == E_1 && local + 3 <= token) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && token <= local + 3) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && (((((((((!(1 == t2_pc) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 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)) || 0 == E_M) || 0 == \old(m_st)) || \old(t1_st) < 2) || \old(t2_st) < 2) || \old(local) < \old(token)) || !(0 == \old(local))) || !(t1_pc == 1)) || \old(token) < \old(local)) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) [2018-12-02 03:28:50,779 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((t1_pc <= 0 && \old(t3_st) <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || (((((((2 <= t2_st && 0 == m_st) && t1_pc <= 0) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || (((((t1_pc <= 0 && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((((((((t1_pc <= 0 && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2) || T1_E == 0) || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || (((((((1 == t1_pc && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token) && \old(t1_st) <= t1_st)) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(E_2))) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_pc) == 0)) || !(2 == E_3)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || (((((m_st == 2 && t3_st == 0) && t2_st == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || !(0 == t2_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (!(E_2 == 0) && m_st == \old(m_st))) || T3_E == 1) || 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)) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || ((((((t1_pc <= 0 && \old(t3_st) <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((\old(t1_st) <= t1_st && m_st == 0) && t3_st == 0) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || ((((!(T2_E == 2) || !(2 == \old(E_2))) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_pc) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || \old(t3_st) < 2) || !(1 == t3_pc)) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || (((((t1_pc <= 0 && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || (((((((1 == t1_pc && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) [2018-12-02 03:28:50,784 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || \old(t3_st) < 2) || !(1 == t3_pc)) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= 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_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (!(E_2 == 0) && m_st == \old(m_st))) || T3_E == 1) || 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)) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || (((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(E_2) <= E_2)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(E_2))) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_pc) == 0)) || !(2 == E_3)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || (((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t3_st == 0) && t2_st == 0) && E_2 == 2)) || !(2 == E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && ((((((((((((((!(2 == E_3) || !(1 == t1_i)) || ((((((m_st == 0 && t1_pc == 1) && t1_st == 2) && t3_st == 0) && t2_st == 0) && token == 0) && E_2 == 2)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || ((((!(T2_E == 2) || !(2 == \old(E_2))) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_pc) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(E_2) <= E_2)) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) [2018-12-02 03:28:50,788 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_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 == E_1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 1) || (((((1 == t1_pc && \old(t3_st) <= t3_st) && m_st == 2) && \old(E_2) == E_2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((!(2 == E_3) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || ((((!(T2_E == 2) || !(2 == \old(E_2))) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_pc) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((((1 == t1_pc && \old(t3_st) <= t3_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((m_st == \old(m_st) && \old(E_2) == E_2) || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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)) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(E_2))) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_pc) == 0)) || !(2 == E_3)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || !(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 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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 == t1_pc && \old(t3_st) <= t3_st) && m_st == 2) && \old(E_2) == E_2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || ((((((1 == t1_pc && \old(t3_st) <= t3_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) [2018-12-02 03:28:50,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || ((((t1_st == 0 && token <= local) && t2_pc <= 0) && (((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(t3_pc == 1)) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0)) && local <= token)) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(token) < local) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) && (((((((((((((((((((((T1_E == 0 || ((((((!(E_3 == 1) && t2_pc <= 0) && \old(t3_st) <= t3_st) && t1_st == 0) && 0 == m_st) && token == 0) && !(E_3 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T1_E == 0)) && !(E_3 == 0)) && t2_pc <= 0) && \old(t1_st) <= t1_st)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || ((((((!(E_3 == 1) && token <= local + 2) && 1 == t2_pc) && m_st == 2) && !(E_3 == 0)) && local + 2 <= token) && \old(t1_st) <= t1_st)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || (((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0))) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == E_M) || ((((!(E_3 == 1) && \old(t3_st) <= t3_st) && m_st == 2) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && ((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) || ((((((!(E_3 == 1) && t2_pc <= 0) && \old(t3_st) <= t3_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && (((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) || ((t2_pc == 0 && t1_st == 0) && E_3 == 2)) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || ((((((!(E_3 == 1) && t2_pc <= 0) && \old(t3_st) <= t3_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((E_3 == 2 && t1_st == 2) && t3_st == 0) && t2_pc == 0)) || !(2 == \old(E_3))) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(\old(t1_st) == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc)))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || (((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(t3_pc == 1)) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(2 == E_1)) || (((E_3 == 2 && t2_pc == 0) && t1_st == 0) && \old(t3_st) <= t3_st && m_st == 2)) || E_2 < 2) || (((!(t1_pc == 0) || !(2 == \old(E_3))) || !(1 == m_pc)) || !(0 == \old(t2_pc))) || !(0 == \old(t3_st)))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || T3_E == 1) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T1_E == 0)) && !(E_3 == 0)) && t2_pc <= 0) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || !(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) || (((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || ((((t1_st == 0 && token <= local) && ((((((!(T2_E == 0) && !(T2_E == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T1_E == 0)) && !(E_3 == 0)) && t2_pc <= 0) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || T2_E == 0) || ((!(E_3 == 1) && m_st == \old(m_st)) && !(E_3 == 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) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || ((t2_pc <= 0 && (((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(t3_pc == 1)) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) [2018-12-02 03:28:50,798 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || !(2 == E_M)) || T1_E == 1) || !(2 == E_1)) || E_2 < 2) || ((((!(t1_pc == 0) || !(2 == \old(E_3))) || !(1 == m_pc)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && 2 <= t2_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0) && !(E_3 == 0))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(token) < local) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) || t1_st == 0) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == \old(E_3))) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(\old(t1_st) == 2)) || T1_E == 1) || ((E_3 == 2 && t1_st == 2) && t3_st == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || (((((((!(E_3 == 1) && token <= local + 2) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && local + 2 <= token) && \old(t1_st) <= t1_st)) || \old(token) < local + 1) || 1 == E_1) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(m_pc == 1)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0) && !(E_3 == 0))) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && 2 <= t2_st) && t1_st == 0) && 0 == m_st) && token == 0) && !(E_3 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && 2 <= t2_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st) || (((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || T2_E == 0) || ((!(E_3 == 1) && m_st == \old(m_st)) && !(E_3 == 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) || 0 == \old(m_st)) || 1 == m_pc) [2018-12-02 03:28:50,802 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || !(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) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || \old(t3_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((m_st == \old(m_st) && \old(E_3) == E_3) || T1_E == 0) || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || 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) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || !(2 == E_M)) || T1_E == 1) || !(2 == E_1)) || E_2 < 2) || ((((!(t1_pc == 0) || !(2 == \old(E_3))) || !(1 == m_pc)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 1) || 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) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || ((((\old(t3_st) <= t3_st && 1 == t2_pc) && m_st == 2) && \old(E_3) == E_3) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((((((((\old(t3_st) <= t3_st && 1 == t2_pc) && token == \old(token)) && m_st == 2) && \old(E_3) == E_3) && \old(t1_st) <= t1_st) || T1_E == 0) || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == E_M) [2018-12-02 03:28:50,807 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || 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) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || (((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || ((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || \old(t2_st) < 2) || !(t1_pc == 1)) || (t3_pc == 0 && t1_st == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t2_pc)) || !(\old(t1_st) == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 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) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || (((((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && m_st == \old(m_st)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st) && 2 <= t2_st) && t1_st == 0) && token == 0)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st) && 0 == t2_st) && token == 0) && \old(t1_st) <= t1_st) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || E_2 < 2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T2_E == 1)) && m_st == 2) && !(E_3 == 1)) && t2_pc <= 0) && !(E_1 == 1)) && 0 == t2_st) && !(M_E == 1)) && \old(t3_st) <= t3_st) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(m_st)) || ((m_st == \old(m_st) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || local < \old(token)) || 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) || (((t1_st == 0 && token <= local) && ((((((((((((((m_pc == 1 && 1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T2_E == 1)) && m_st == 2) && !(E_3 == 1)) && t2_pc <= 0) && !(E_1 == 1)) && 0 == t2_st) && !(M_E == 1)) && \old(t3_st) <= t3_st) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && local <= token)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || ((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || T3_E == 1) || 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) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) || !(0 == \old(m_st))) || ((((t3_pc == 0 && t1_st == 0) && t2_st == 0) && token == 0) && (((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && m_st == \old(m_st)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st)) || !(0 == \old(t2_st))) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (((((\old(t3_st) <= t3_st && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || (((((((\old(t3_st) <= t3_st && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 3) && 2 <= t2_st) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(E_M) == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || !(t1_pc == 0) || !(\old(t1_st) == 0)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || (((((t3_pc == 0 && \old(t3_st) <= t3_st) && E_M == 2) && m_st == 2) && t1_st == 0) && t2_st == 0)) || !(0 == t2_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || (((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && token == \old(token)) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) [2018-12-02 03:28:50,815 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || (((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st == 2) || !(2 == E_3)) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t2_pc)) || !(\old(t1_st) == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 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 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 2 <= t2_st) && t1_st == 0) && 0 == m_st) && token == 0)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(m_st)) || (((1 == t3_pc && !(E_M == 0)) && !(E_M == 1)) && m_st == \old(m_st)))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || !(t1_pc == 0) || !(\old(t1_st) == 0)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || (((((\old(E_M) == E_M && m_st == 2) && t1_st == 0) && t2_st == 0) && t3_st == 2) && t3_pc == 1)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || 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) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || (((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || local < \old(token)) || 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 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t2_st) && t1_st == 0)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || ((((((1 == t3_pc && !(E_M == 0)) && !(E_M == 1)) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || ((((((((1 == t3_pc && !(E_M == 0)) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && 2 <= t2_st) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || \old(token) < local + 2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && t1_st == 0) && 0 == m_st) && token == 0) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)))) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || E_2 < 2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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(E_M) == E_M) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || (((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) [2018-12-02 03:28:50,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 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) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || 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) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || ((((((1 == t3_pc && \old(t3_st) <= t3_st) && \old(E_M) == E_M) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || local < \old(token)) || 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) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((\old(t1_st) < 2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)))) || E_2 < 2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || !(t1_pc == 0) || !(\old(t1_st) == 0)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || 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) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(m_st)) || ((1 == t3_pc && \old(E_M) == E_M) && m_st == \old(m_st)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(E_M)) || 0 == E_2) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) [2018-12-02 03:28:50,882 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3bc32b89-fb89-4cdd-810e-fe93bb72ab15/bin-2019/utaipan/witness.graphml [2018-12-02 03:28:50,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:28:50,882 INFO L168 Benchmark]: Toolchain (without parser) took 264527.57 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 958.7 MB in the beginning and 1.4 GB in the end (delta: -463.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,883 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:28:50,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.05 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 942.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.86 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,883 INFO L168 Benchmark]: Boogie Preprocessor took 52.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,884 INFO L168 Benchmark]: RCFGBuilder took 315.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,884 INFO L168 Benchmark]: TraceAbstraction took 263810.72 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -397.1 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,884 INFO L168 Benchmark]: Witness Printer took 140.66 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:28:50,886 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.05 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 942.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.86 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 263810.72 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -397.1 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 140.66 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 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: (((((((((((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || !(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) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || \old(t3_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((m_st == \old(m_st) && \old(E_3) == E_3) || T1_E == 0) || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || 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) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || !(2 == E_M)) || T1_E == 1) || !(2 == E_1)) || E_2 < 2) || ((((!(t1_pc == 0) || !(2 == \old(E_3))) || !(1 == m_pc)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 1) || 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) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || ((((\old(t3_st) <= t3_st && 1 == t2_pc) && m_st == 2) && \old(E_3) == E_3) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((((((((\old(t3_st) <= t3_st && 1 == t2_pc) && token == \old(token)) && m_st == 2) && \old(E_3) == E_3) && \old(t1_st) <= t1_st) || T1_E == 0) || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == E_M) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((!(1 == t2_pc) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t2_st) < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || E_2 < 2) || !(0 == \old(m_pc))) || 0 < t1_pc) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(M_E == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_pc == 1) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || (((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || T2_E == 1) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(M_E == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_pc == 1) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && !(E_3 == 0)) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || (((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= t1_st) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 1)) && 2 <= t3_st) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((((((((((((((((E_1 == 2 && m_pc == 1) && m_st == 2) && t3_st == 0) && t1_st == 0) && t2_st == 0) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((0 < t2_pc || !(t1_pc == 1)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || !(0 == \old(t2_st))) || E_2 < 2) || !(0 == \old(m_pc))) || ((((((((token <= local && \old(t3_st) <= t3_st) && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && t1_st == 0) && !(E_1 == 0)) && local <= token))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || ((((((((token <= local && \old(t3_st) <= t3_st) && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && t1_st == 0) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || T1_E == 1) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 0 == t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((\old(t2_st) < 2 || ((((((((token <= local && \old(t3_st) <= t3_st) && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && t1_st == 0) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || !(1 == t2_pc)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || ((((((\old(t3_st) <= t3_st && m_pc == 1) && m_st == 2) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0)) && \old(t1_st) <= t1_st)) || !(0 == \old(m_pc))) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || 0 == __retres1) || t1_st < 2) || !(0 == t2_st)) || 0 < t2_pc) || !(t1_pc == 1)) || E_2 < 2) || t3_st < 2) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 == __retres1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || 0 == __retres1) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((!(0 == t3_st) || !(0 == t3_pc)) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || !(2 == E_3)) || 0 == __retres1) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc)) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || !(0 == m_pc))) && (((((!(1 == t2_pc) || t2_st < 2) || E_2 < 2) || 0 == __retres1) || 0 < t1_pc) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(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_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || 0 == __retres1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((!(1 == t2_pc) || ((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || t2_st < 2) || E_2 < 2) || t3_st < 2) || 0 == __retres1) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_1) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || (((!(token == 0) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == local)) || !(t1_st == 0)) || !(1 == t1_i)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == __retres1) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1)) && (((((((!(1 == t2_pc) || t1_st < 2) || (1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || t2_st < 2) || !(t1_pc == 1)) || E_2 < 2) || 0 == __retres1) || t3_st < 2)) && ((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1) || token < local + 2)) && (((((((((((t2_st < 2 || !(t1_pc == 1)) || 0 == __retres1) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || E_2 < 2) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || token < local + 3)) && ((((((((!(1 == t2_pc) || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || 0 == __retres1) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && ((((((t1_st < 2 || 0 == __retres1) || !(0 == t2_st)) || 0 < t2_pc) || !(t1_pc == 1)) || E_2 < 2) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((t2_st < 2 || !(2 == m_st)) || !(t1_pc == 1)) || !(1 == t2_pc)) || t1_st < 2) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || E_2 < 2) || 0 == __retres1) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || !(0 == t2_st)) || 0 < t2_pc) || E_2 < 2) || t3_st < 2) || 0 < t1_pc) || 0 == __retres1)) && (((((((((!(1 == t2_pc) || (1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || 0 == __retres1) || t3_st < 2) || !(t1_st == 0))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == __retres1) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && ((((((((!(0 == t2_st) || 0 < t2_pc) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || 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 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || !(0 == t2_st)) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || t3_st < 2) || 0 == __retres1) || !(t1_st == 0))) && ((((((!(1 == t2_pc) || t1_st < 2) || t2_st < 2) || !(t1_pc == 1)) || E_2 < 2) || 0 == __retres1) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(2 == \old(E_2)) || !(\old(T1_E) == 2)) || (((((((2 <= t2_st && m_pc == 1) && (((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && t1_pc <= 0)) || (((((((((((\old(T2_E) == T2_E && (((((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(t3_pc == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((1 == t1_pc && local + 3 <= token) && (((2 <= t2_st && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && ((((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 0 == m_st) && token <= local + 3) && 2 <= t1_st)) || !(m_i == 1)) || !(2 == \old(M_E))) || ((((((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || !(\old(T3_E) == 2)) || ((1 == t1_pc && 2 <= t1_st) && ((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && ((((((((\old(T2_E) == T2_E && (((((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(t3_pc == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && 2 <= E_2) && m_st == 2)) || (((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || ((((((((((((((((E_3 == 2 && m_pc == 0) && t3_pc == 0) && E_1 == 2) && T1_E == 2) && E_M == 2) && t3_st == 0) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && T3_E == 2) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(\old(T2_E) == 2)) || (((((1 == t1_pc && ((2 <= t2_st && (((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(2 == \old(E_1))) || (t1_pc <= 0 && ((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && ((((((((\old(T2_E) == T2_E && (((((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(t3_pc == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && 2 <= E_2) && m_st == 2)) || ((1 == t1_pc && (((((2 <= t2_st && m_pc == 1) && (((((((\old(T2_E) == T2_E && !(T1_E == 1)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (1 == t3_pc && (((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && 2 <= t1_st)) || !(1 == t2_i) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || (((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st == 2) || !(2 == E_3)) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t2_pc)) || !(\old(t1_st) == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 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 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 2 <= t2_st) && t1_st == 0) && 0 == m_st) && token == 0)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(m_st)) || (((1 == t3_pc && !(E_M == 0)) && !(E_M == 1)) && m_st == \old(m_st)))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || !(t1_pc == 0) || !(\old(t1_st) == 0)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || (((((\old(E_M) == E_M && m_st == 2) && t1_st == 0) && t2_st == 0) && t3_st == 2) && t3_pc == 1)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || 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) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || (((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || local < \old(token)) || 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 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t2_st) && t1_st == 0)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || ((((((1 == t3_pc && !(E_M == 0)) && !(E_M == 1)) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || ((((((((1 == t3_pc && !(E_M == 0)) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && 2 <= t2_st) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || \old(token) < local + 2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && t1_st == 0) && 0 == m_st) && token == 0) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)))) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) || ((((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || E_2 < 2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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(E_M) == E_M) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || (((((1 == t3_pc && \old(E_M) == E_M) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 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) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || 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) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || ((((((1 == t3_pc && \old(t3_st) <= t3_st) && \old(E_M) == E_M) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || local < \old(token)) || 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) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((\old(t1_st) < 2 || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)))) || E_2 < 2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || !(t1_pc == 0) || !(\old(t1_st) == 0)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || 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) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(m_st)) || ((1 == t3_pc && \old(E_M) == E_M) && m_st == \old(m_st)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(E_M)) || 0 == E_2) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == m_pc)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == E_1)) || T1_E == 1) || !(0 == t2_st)) || __retres1 == 0) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || token < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_2) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || local + 1 < token) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == __retres1) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || (((!(token == 0) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == local)) || !(t1_st == 0)) || !(1 == t1_i)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == __retres1) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || local < token) || 0 == __retres1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 0 == E_3) || !(t1_pc == 1)) || token < local) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 1 == E_3) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || T3_E == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == __retres1) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 1 == E_M) || token < local + 3)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1) || 0 < t1_pc)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || 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 == E_1) || !(0 == t2_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(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_3) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_1) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 0 == __retres1) || 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) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || 0 == __retres1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_2) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 == E_3) || 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) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 0 == __retres1) || 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 == m_st) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1) || token < local + 3)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || T3_E == 1) || t3_st < 2) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || 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) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 1 == m_pc) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || token < local) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == __retres1) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((!(1 == t2_pc) || (1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || t2_st < 2) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || t3_st < 2) || !(t1_st == 0))) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || 0 == E_M) || 0 == E_2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == __retres1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || T3_E == 1) || 0 == __retres1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || t1_st < 2) || 0 == __retres1) || !(0 == t2_st)) || 0 < t2_pc) || !(t1_pc == 1)) || E_2 < 2) || t3_st < 2)) && (((((((((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || !(0 == t2_st)) || 0 < t2_pc) || E_2 < 2) || t3_st < 2) || 0 == __retres1) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((t1_st < 2 || !(0 == t2_st)) || 0 < t2_pc) || !(t1_pc == 1)) || E_2 < 2) || 0 == __retres1) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || __retres1 == 0) || !(T1_E == 2)) || (((!(token == 0) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == local)) || !(t1_st == 0)) || !(1 == t1_i)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((!(1 == t2_pc) || 0 == __retres1) || t2_st < 2) || E_2 < 2) || 0 < t1_pc) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((!(1 == t2_pc) || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || 0 == __retres1) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_1) || 1 == E_3) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((!(1 == t2_pc) || ((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || 0 == __retres1) || t2_st < 2) || E_2 < 2) || t3_st < 2) || 0 < t1_pc)) && (((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 == E_3) || 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) || 0 == m_st) || 1 == m_pc)) && (((((((((((t2_st < 2 || !(t1_pc == 1)) || 0 == __retres1) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || E_2 < 2) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || token < local + 3)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == __retres1) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((!(1 == t2_pc) || t1_st < 2) || (1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == __retres1) || t2_st < 2) || !(t1_pc == 1)) || E_2 < 2) || t3_st < 2)) && ((((((((((((((((((T1_E == 0 || 0 == __retres1) || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || t3_st < 2) || 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) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_2) || 0 == E_3) || !(t1_pc == 1)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == t2_st)) || 0 == E_1) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == __retres1) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || 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 == E_1) || !(0 == t2_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((t2_st < 2 || !(2 == m_st)) || !(t1_pc == 1)) || !(1 == t2_pc)) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || E_2 < 2) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == m_st) || 1 == m_pc)) && ((((((!(1 == t2_pc) || t1_st < 2) || t2_st < 2) || 0 == __retres1) || !(t1_pc == 1)) || E_2 < 2) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == t2_st)) || 0 == E_1) || local + 1 < token) || 0 == E_M)) && ((((((((!(0 == t2_st) || 0 == __retres1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || ((1 == E_3 || 0 == m_st) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((((1 == E_3 || 0 == m_st) || ((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) || 0 == __retres1) || !(0 == t2_st)) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || t3_st < 2) || !(t1_st == 0))) && ((((((((((((!(0 == t3_st) || !(0 == t3_pc)) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || __retres1 == 0) || !(0 == t2_st)) || !(2 == E_3)) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc)) || (((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || !(0 == m_pc))) && (((((1 == E_3 || 1 == E_1) || 0 == __retres1) || 0 == m_st) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || 0 == __retres1) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || \old(t3_st) < 2) || !(1 == t3_pc)) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= 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_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st)) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (!(E_2 == 0) && m_st == \old(m_st))) || T3_E == 1) || 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)) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || (((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(E_2) <= E_2)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(E_2))) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_pc) == 0)) || !(2 == E_3)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || (((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t3_st == 0) && t2_st == 0) && E_2 == 2)) || !(2 == E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && ((((((((((((((!(2 == E_3) || !(1 == t1_i)) || ((((((m_st == 0 && t1_pc == 1) && t1_st == 2) && t3_st == 0) && t2_st == 0) && token == 0) && E_2 == 2)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || ((((!(T2_E == 2) || !(2 == \old(E_2))) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_pc) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || (((((1 == t1_pc && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(E_2) <= E_2)) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_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 == E_1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 1) || (((((1 == t1_pc && \old(t3_st) <= t3_st) && m_st == 2) && \old(E_2) == E_2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((!(2 == E_3) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || ((((!(T2_E == 2) || !(2 == \old(E_2))) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_pc) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((((1 == t1_pc && \old(t3_st) <= t3_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((m_st == \old(m_st) && \old(E_2) == E_2) || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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)) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(E_2))) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_pc) == 0)) || !(2 == E_3)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || !(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 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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 == t1_pc && \old(t3_st) <= t3_st) && m_st == 2) && \old(E_2) == E_2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || ((((((1 == t1_pc && \old(t3_st) <= t3_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || 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) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || (((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || ((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || \old(t2_st) < 2) || !(t1_pc == 1)) || (t3_pc == 0 && t1_st == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t2_pc)) || !(\old(t1_st) == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 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) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || (((((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && m_st == \old(m_st)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st) && 2 <= t2_st) && t1_st == 0) && token == 0)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st) && 0 == t2_st) && token == 0) && \old(t1_st) <= t1_st) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || E_2 < 2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T2_E == 1)) && m_st == 2) && !(E_3 == 1)) && t2_pc <= 0) && !(E_1 == 1)) && 0 == t2_st) && !(M_E == 1)) && \old(t3_st) <= t3_st) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 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) || 0 == \old(m_st)) || ((m_st == \old(m_st) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || local < \old(token)) || 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) || (((t1_st == 0 && token <= local) && ((((((((((((((m_pc == 1 && 1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T2_E == 1)) && m_st == 2) && !(E_3 == 1)) && t2_pc <= 0) && !(E_1 == 1)) && 0 == t2_st) && !(M_E == 1)) && \old(t3_st) <= t3_st) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && local <= token)) || 0 == E_3) || \old(token) < local) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || 0 == E_3) || !(2 == \old(m_st))) || ((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || T3_E == 1) || 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) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(0 == m_pc)) && ((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) || !(0 == \old(m_st))) || ((((t3_pc == 0 && t1_st == 0) && t2_st == 0) && token == 0) && (((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 1)) && !(E_3 == 1)) && !(E_1 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(E_M) == E_M) && !(E_M == 1)) && m_st == \old(m_st)) && ((m_pc == 1 && m_st == 2) || (m_st == 0 && m_pc == 0))) && \old(t3_st) <= t3_st)) || !(0 == \old(t2_st))) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || 1 == E_1) || (((((\old(t3_st) <= t3_st && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || local + 2 < \old(token)) || !(t1_pc == 1)) || (((((((\old(t3_st) <= t3_st && (((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 3) && 2 <= t2_st) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(E_M) == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 0 == \old(m_st)) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == E_3)) || !(t1_pc == 0) || !(\old(t1_st) == 0)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || (((((t3_pc == 0 && \old(t3_st) <= t3_st) && E_M == 2) && m_st == 2) && t1_st == 0) && t2_st == 0)) || !(0 == t2_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == E_3) || \old(token) < local + 1) || 1 == E_1) || (((((\old(t3_st) <= t3_st && \old(E_M) == E_M) && token == \old(token)) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(1 == \old(t3_pc))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || ((1 == t1_pc && (((((2 <= t2_st && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && m_st == 2) && \old(t3_st) <= t3_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((t1_pc <= 0 && (((((2 <= t2_st && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && m_st == 2) && \old(t3_st) <= t3_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st)) || ((1 == t1_pc && (((((2 <= t2_st && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && m_st == 2) && \old(t3_st) <= t3_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == \old(E_3))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || T1_E == 1) || (((E_1 == 2 && E_3 == 2) && E_M == 2) && t1_st == 2)) || !(2 == \old(E_1))) || \old(E_2) < 2) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local + 2) || T1_E == 0) || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 3)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || (((((((1 == t2_pc && t1_pc <= 0) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && t1_pc <= 0) && \old(t1_st) <= t1_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && m_st == 2) && 2 <= t1_st) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(E_2) <= E_2)) || 0 == \old(E_3)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || (2 <= t1_st && (1 == t1_pc && (((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && 1 <= \old(t2_pc))) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((1 == t1_pc && (((((2 <= t2_st && m_pc == 1) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && 1 <= \old(t2_pc)) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && m_st == 2) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2))) && (((((((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local + 2) || T1_E == 0) || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local + 2) || !(2 == \old(E_2))) || ((1 == t1_pc && 2 <= t1_st) && ((((2 <= t2_st && 1 == t2_pc) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(t3_st) <= t3_st)) || !(T1_E == 2)) || !(m_i == 1)) || !(2 == M_E)) || ((t1_pc <= 0 && ((((2 <= t2_st && 1 == t2_pc) && 2 <= E_2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(E_2) <= E_2)) || !(T3_E == 2)) || (((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || (((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || (((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && 2 <= t3_st) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || !(T2_E == 2)) || (((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || !(1 == t3_i)) || !(2 == \old(E_1))) || !(1 == t2_i)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || !(2 == E_M)) || T1_E == 1) || !(2 == E_1)) || E_2 < 2) || ((((!(t1_pc == 0) || !(2 == \old(E_3))) || !(1 == m_pc)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && 2 <= t2_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0) && !(E_3 == 0))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(token) < local) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) || t1_st == 0) || 0 < t1_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 == \old(E_3))) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(\old(t1_st) == 2)) || T1_E == 1) || ((E_3 == 2 && t1_st == 2) && t3_st == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || (((((((!(E_3 == 1) && token <= local + 2) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && local + 2 <= token) && \old(t1_st) <= t1_st)) || \old(token) < local + 1) || 1 == E_1) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || T3_E == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(m_pc == 1)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0) && !(E_3 == 0))) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || ((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || (((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && 2 <= t2_st) && t1_st == 0) && 0 == m_st) && token == 0) && !(E_3 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((!(E_3 == 1) && \old(t3_st) <= t3_st) && 1 == t2_pc) && 2 <= t2_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st) || (((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || T2_E == 0) || ((!(E_3 == 1) && m_st == \old(m_st)) && !(E_3 == 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) || 0 == \old(m_st)) || 1 == m_pc) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || ((((t1_st == 0 && token <= local) && t2_pc <= 0) && (((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(t3_pc == 1)) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0)) && local <= token)) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(token) < local) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) && (((((((((((((((((((((T1_E == 0 || ((((((!(E_3 == 1) && t2_pc <= 0) && \old(t3_st) <= t3_st) && t1_st == 0) && 0 == m_st) && token == 0) && !(E_3 == 0))) || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T1_E == 0)) && !(E_3 == 0)) && t2_pc <= 0) && \old(t1_st) <= t1_st)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || \old(token) < local + 1) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || ((((((!(E_3 == 1) && token <= local + 2) && 1 == t2_pc) && m_st == 2) && !(E_3 == 0)) && local + 2 <= token) && \old(t1_st) <= t1_st)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || (((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0))) || 0 == E_1) || E_2 < 2) || local + 1 < \old(token)) || 0 == E_M) || ((((!(E_3 == 1) && \old(t3_st) <= t3_st) && m_st == 2) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && ((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) || ((((((!(E_3 == 1) && t2_pc <= 0) && \old(t3_st) <= t3_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && (((((((0 == \old(E_3) || 1 == \old(E_3)) || (((((((!(T2_E == 2) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_st) == 2)) || !(0 == \old(m_st))) || !(2 == E_1)) || !(2 == M_E)) || ((((!(\old(token) == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_pc)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) || ((t2_pc == 0 && t1_st == 0) && E_3 == 2)) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || ((((((!(E_3 == 1) && t2_pc <= 0) && \old(t3_st) <= t3_st) && 0 == m_st) && token == 0) && !(E_3 == 0)) && \old(t1_st) <= t1_st))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((E_3 == 2 && t1_st == 2) && t3_st == 0) && t2_pc == 0)) || !(2 == \old(E_3))) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(\old(t1_st) == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc)))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 1 == E_M) || !(1 == \old(t2_pc))) || T1_E == 1) || !(1 == m_pc)) || (((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(t3_pc == 1)) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(2 == E_1)) || (((E_3 == 2 && t2_pc == 0) && t1_st == 0) && \old(t3_st) <= t3_st && m_st == 2)) || E_2 < 2) || (((!(t1_pc == 0) || !(2 == \old(E_3))) || !(1 == m_pc)) || !(0 == \old(t2_pc))) || !(0 == \old(t3_st)))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || T3_E == 1) || (((((((((!(T2_E == 0) && !(T2_E == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T1_E == 0)) && !(E_3 == 0)) && t2_pc <= 0) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || !(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) || (((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && !(M_E == 0)) && !(E_3 == 1)) && !(m_pc == 1)) && !(M_E == 1)) && !(E_M == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0))) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || T2_E == 0) || ((((t1_st == 0 && token <= local) && ((((((!(T2_E == 0) && !(T2_E == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && !(T3_E == 1)) && m_st == \old(m_st)) && !(T1_E == 0)) && !(E_3 == 0)) && t2_pc <= 0) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || 0 == \old(E_3)) || \old(token) < local) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || T2_E == 0) || ((!(E_3 == 1) && m_st == \old(m_st)) && !(E_3 == 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) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < \old(t2_pc)) || 0 == \old(E_3)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || ((t2_pc <= 0 && (((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(t3_pc == 1)) && !(E_3 == 1)) && !(M_E == 1)) && \old(t3_st) <= t3_st) && !(E_M == 1)) && m_pc == 1) && !(T1_E == 1)) && !(T3_E == 1)) && m_st == \old(m_st)) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_3 == 0)) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: (((((((((((((((((!(2 == \old(E_2)) || !(M_E == 0)) || !(\old(T3_E) == 2)) || !(\old(T1_E) == 2)) || (((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(\old(T2_E) == 2)) || !(0 == \old(t3_st))) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 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)) || 0 == E_M) || 0 == \old(m_st)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || 0 < t2_pc) || \old(local) < \old(token)) || !(0 == \old(local))) || !(t1_pc == 1)) || \old(token) < \old(local)) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((!(1 == t2_pc) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t2_st) < 2) || !(0 == \old(local))) || E_2 < 2) || !(0 == \old(m_pc))) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || (((((((\old(E_1) == E_1 && local + 3 <= token) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && token <= local + 3) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && (((((((((!(1 == t2_pc) || (((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 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)) || 0 == E_M) || 0 == \old(m_st)) || \old(t1_st) < 2) || \old(t2_st) < 2) || \old(local) < \old(token)) || !(0 == \old(local))) || !(t1_pc == 1)) || \old(token) < \old(local)) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || T3_E == 1) || 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) || 0 == m_st) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_2) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || 0 == __retres1) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_1) || 0 == __retres1) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || 1 == t3_pc) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 0 == __retres1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || !(t1_pc == 0)) || 0 == __retres1) || !(2 == E_3)) || !(0 == m_pc)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || 0 == __retres1) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || 0 == __retres1) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || 1 == E_1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || token < local) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1)) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || __retres1 == 0) || (((!(token == 0) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == local)) || !(t1_st == 0)) || !(1 == t1_i)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((t2_st < 2 || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || !(1 == t2_pc)) || t1_st < 2) || 1 == E_3) || 1 == E_1) || E_2 < 2) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_2) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || 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) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1) || 0 < t1_pc) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || local + 3 < token) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 3)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || T3_E == 1) || 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 == m_st) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == E_3) || !(2 == m_st)) || t3_st < 2) || 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 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((t2_st < 2 || !(t1_pc == 1)) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || E_2 < 2) || 0 == __retres1) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || token < local + 3)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || t3_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((1 == E_3 || 1 == E_1) || 0 == __retres1) || 0 == m_st) || ((((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || T3_E == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 0 == __retres1) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || 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) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || t2_st < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || token < local + 2) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || ((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && 2 <= t2_st) && \old(t1_st) <= t1_st) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) && ((((((((((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st) || !(1 == t2_pc)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t2_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) || 0 < t1_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || 0 < t2_pc) || (((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((\old(t2_st) < 2 || !(t1_pc == 1)) || !(1 == t2_pc)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(0 == \old(local))) || 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)) || 0 == E_M) || 0 == \old(m_st)) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && 2 <= t2_st) && \old(t1_st) <= t1_st) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || \old(local) < \old(token)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || 0 == E_3) || ((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && 0 == t2_st) && \old(t1_st) <= t1_st) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || (((((((\old(E_1) == E_1 && local + 3 <= token) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && token == \old(token)) && token <= local + 3) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || (((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || !(0 == \old(m_pc))) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == E_3) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || !(m_pc == 1)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || \old(token) < \old(local) + 3) || 1 == \old(m_pc))) && (((((((((((((((((((((((((m_st == \old(m_st) && t1_st == 0) && m_pc == 0) && E_1 == 2) && t3_st == 0) && t2_st == 0) && token == 0) && local == 0) || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(0 == \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) == 0)) || 1 == E_3) || 1 == \old(E_1)) || !(0 == \old(m_pc))) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || 0 < t1_pc) || (((((((\old(E_1) == E_1 && m_pc == 0) && \old(t3_st) <= t3_st) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || __retres1 == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || __retres1 == 1)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || T3_E == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || __retres1 == 1) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || token < local + 1) || 1 == E_1) || 0 == E_3) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == t2_st)) || __retres1 == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < token) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || local < token) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || t2_st < 2) || 0 == E_3) || token < local) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || t2_st < 2) || 0 == E_3) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || 1 == E_1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || t2_st < 2) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || __retres1 == 1) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || __retres1 == 1) || T1_E == 1) || !(0 == m_st)) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && ((((((1 == E_3 || __retres1 == 1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || ((((((((((!(T2_E == 2) || !(2 == E_2)) || !(t1_pc == 1)) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(t1_st == 2)) || !(2 == E_1)) || !(0 == t2_pc)) || !(2 == M_E)) || !(0 == m_st)) || !(0 == t2_st))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || (!(token == 0) || !(0 == local)) || !(0 == m_pc)) || t2_st < 2) || 0 == E_3) || __retres1 == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 1 == E_3) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || __retres1 == 1) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc)) || __retres1 == 1)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == E_2)) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || __retres1 == 1) || !(2 == E_3)) || t2_st < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t2_pc)) || !(t1_st == 2)) || T1_E == 1) || !(1 == m_pc)) || !(2 == E_1))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == m_st)) || local < token) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 0 == E_3) || token < local) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((((__retres1 == 1 || !(2 == E_2)) || !(T3_E == 2)) || !(T1_E == 2)) || (((!(token == 0) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == local)) || !(t1_st == 0)) || !(1 == t1_i)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == m_st)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || local < token) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || t2_st < 2) || 0 == E_3) || token < local) || !(t1_pc == 1)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || __retres1 == 1)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == m_st)) || local < token) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || 0 == E_3) || token < local) || !(t1_pc == 1)) || 1 == E_M) || T1_E == 1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || __retres1 == 1) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == m_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_3) || token < local + 1) || 1 == E_1) || __retres1 == 1) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || local + 1 < token) || 0 == E_M) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((t1_pc <= 0 && \old(t3_st) <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || 0 == E_3) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || (((((((2 <= t2_st && 0 == m_st) && t1_pc <= 0) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || (((((t1_pc <= 0 && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((((((((t1_pc <= 0 && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2) || T1_E == 0) || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || (((((((1 == t1_pc && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token) && \old(t1_st) <= t1_st)) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(E_2))) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_pc) == 0)) || !(2 == E_3)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || (((((m_st == 2 && t3_st == 0) && t2_st == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || !(0 == t2_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (!(E_2 == 0) && m_st == \old(m_st))) || T3_E == 1) || 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)) || 0 == \old(m_st)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || ((((((t1_pc <= 0 && \old(t3_st) <= t3_st) && 2 <= t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 0 == E_3) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((\old(t1_st) <= t1_st && m_st == 0) && t3_st == 0) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) || !(2 == E_3)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || ((((!(T2_E == 2) || !(2 == \old(E_2))) || !(T3_E == 2)) || !(T1_E == 2)) || !(0 == \old(t3_st))) || !(\old(t1_pc) == 0)) || !(0 == t3_pc)) || !(2 == E_M)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || 0 == E_3) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || \old(t3_st) < 2) || !(1 == t3_pc)) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || (((((t1_pc <= 0 && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M) || 0 < \old(t1_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 < t2_pc) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || 0 == E_3) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || local < \old(token)) || T3_E == 1) || (((((((1 == t1_pc && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || \old(t2_st) < 2) || 0 == E_3) || \old(token) < local) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || 0 == E_M) || (((((1 == t1_pc && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((1 == t2_pc && t1_pc <= 0) && 2 <= t2_st) && t1_st == 0) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((t1_pc <= 0 && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && t2_pc <= 0) && \old(t1_st) <= t1_st) && 0 == t2_st) && \old(E_2) <= E_2)) || !(2 == \old(E_2))) || !(T1_E == 2)) || (((((((t1_pc <= 0 && 2 <= t3_st) && t2_pc <= 0) && 0 == t2_st) && t1_st == 0) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && t1_st == 0) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && token <= local) && t2_pc <= 0) && local <= token) && 0 == t2_st) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && t1_st == 0) && token <= local) && \old(t3_st) <= t3_st) && t2_pc <= 0) && local <= token) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || (((((((1 == t1_pc && 2 <= t3_st) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && 2 <= t1_st) && 2 <= t2_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || !(m_i == 1)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && 0 == t2_st)) || (((((((((t1_pc == 1 && t3_pc == 0) && E_1 == 2) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && t1_st == 2) && t3_st == 0) && t2_pc == 0) && t2_st == 0) && E_2 == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1)))) || ((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st) && \old(E_2) <= E_2)) || !(2 == M_E)) || (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t1_st) && 2 <= t2_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || (((t1_st == 0 && token <= local) && ((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= E_2) && local <= token)) || !(T3_E == 2)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && \old(t3_st) <= t3_st) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && 0 == t2_st)) || ((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(E_2) <= E_2)) || (((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || ((((((1 == t1_pc && 2 <= t3_st) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && \old(E_2) <= E_2)) || (((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(1 == t1_i)) || ((((E_1 == 2 && (((((t2_pc == 0 && t1_st == 0) && E_3 == 2) && m_st == 2) && t1_pc == 0) && t3_pc == 0) && t3_st == 0) && E_M == 2) && E_2 == 2) && 0 == t2_st)) || ((((((1 == t1_pc && 2 <= t1_st) && \old(t3_st) <= t3_st) && t2_pc <= 0) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || !(T2_E == 2)) || (((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || ((((((((t3_st == 0 && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0) && (((E_3 == 2 && m_pc == 0) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && t3_pc == 0) && E_1 == 2)) || !(1 == t3_i)) || ((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && t1_st == 0) && token <= local) && \old(t3_st) <= t3_st) && local <= token) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(E_2) <= E_2)) || !(2 == \old(E_1))) || !(1 == t2_i)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || (((((((1 == t2_pc && t1_pc <= 0) && 2 <= t3_st) && 2 <= t2_st) && t1_st == 0) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && \old(t3_st) <= t3_st) && (m_pc == 1 && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && m_st == 2) && \old(E_2) <= E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(1 == \old(t3_pc))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && t1_st == 0) && 2 <= t3_st) && 2 <= E_2) && token <= local) && local <= token)) || \old(t2_st) < 2) || 0 == \old(E_3)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || ((token <= local + 1 && (((((1 == t1_pc && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && local + 1 <= token)) || !(1 == \old(t3_pc))) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st)) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((((2 <= t2_st && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && 1 == t1_pc) && 2 <= t1_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc)) || (((((((2 <= t2_st && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && t1_pc <= 0) && \old(t1_st) <= t1_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (\old(t1_st) <= t1_st && ((((2 <= t2_st && 1 == t2_pc) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t1_pc)) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 2 <= t1_st) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t2_pc) && (m_pc == 1 && m_st == \old(m_st)) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && t1_pc <= 0) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((((((2 <= t2_st && 1 == t2_pc) && t1_pc <= 0) && 2 <= t3_st) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && (m_pc == 1 && m_st == \old(m_st)) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && 2 <= t1_st) && \old(t3_st) <= t3_st) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || 0 < \old(t1_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((m_st == \old(m_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 0 == \old(m_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && t1_st == 0) && 2 <= t3_st) && 2 <= E_2) && token <= local) && local <= token)) || \old(t2_st) < 2) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || ((token <= local + 1 && (((((1 == t1_pc && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && local + 1 <= token)) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 2 && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 2 <= t1_st)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && local + 3 <= token) && 1 <= \old(t2_pc)) && 1 == t2_pc) && 2 <= t3_st) && 2 <= E_2) && 0 == m_st) && token <= local + 3) && 2 <= t1_st) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1))) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_3)) || 1 == \old(E_1)) || \old(t2_st) < 2) || 0 == \old(E_3)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= t3_st) && ((m_pc == 1 && m_st == \old(m_st)) && m_st == 2) && (((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && (m_pc == 1 && m_st == \old(m_st)) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || !(\old(t1_pc) == 1)) || ((m_st == \old(m_st) && ((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && !(M_E == 1)) && !(T2_E == 1)) && !(t3_pc == 1)) && !(E_1 == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(E_3 == 1)) && !(m_pc == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || 0 == \old(E_1)) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 == \old(m_st))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((E_1 == 2 && E_3 == 2) && E_M == 2) && t1_st == 2)) || !(2 == \old(E_3))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || T1_E == 1) || !(2 == \old(E_1))) || \old(E_2) < 2) || ((((((((((((((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_3 == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(T1_E == 1)) && !(T3_E == 1)) && 1 == t3_pc) && !(M_E == 1)) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && !(E_3 == 1)) && !(m_st == 0)) && !(m_pc == 1))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 204 locations, 1 error locations. SAFE Result, 263.7s OverallTime, 36 OverallIterations, 8 TraceHistogramMax, 58.4s AutomataDifference, 0.0s DeadEndRemovalTime, 182.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 11198 SDtfs, 15426 SDslu, 34011 SDs, 0 SdLazy, 22310 SolverSat, 4596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 10327 GetRequests, 9559 SyntacticMatches, 69 SemanticMatches, 699 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26309 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10221occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 14 AbstIntIterations, 4 AbstIntStrong, 0.9927469920256597 AbsIntWeakeningRatio, 0.5773195876288659 AbsIntAvgWeakeningVarsNumRemoved, 18.007137192704203 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 1644 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 30990 PreInvPairs, 36403 NumberOfFragments, 93726 HoareAnnotationTreeSize, 30990 FomulaSimplifications, 16649413 FormulaSimplificationTreeSizeReduction, 18.8s HoareSimplificationTime, 80 FomulaSimplificationsInter, 5490774 FormulaSimplificationTreeSizeReductionInter, 163.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 12445 NumberOfCodeBlocks, 12445 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 16654 ConstructedInterpolants, 0 QuantifiedInterpolants, 8116590 SizeOfPredicates, 14 NumberOfNonLiveVariables, 16963 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 56 InterpolantComputations, 32 PerfectInterpolantSequences, 21092/21971 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...