./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer --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 Automizer --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-1dbac8b [2018-11-10 02:08:44,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:08:44,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:08:44,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:08:44,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:08:44,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:08:44,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:08:44,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:08:44,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:08:44,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:08:44,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:08:44,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:08:44,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:08:44,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:08:44,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:08:44,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:08:44,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:08:44,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:08:44,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:08:44,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:08:44,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:08:44,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:08:44,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:08:44,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:08:44,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:08:44,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:08:44,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:08:44,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:08:44,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:08:44,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:08:44,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:08:44,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:08:44,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:08:44,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:08:44,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:08:44,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:08:44,486 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 02:08:44,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:08:44,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:08:44,494 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:08:44,494 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 02:08:44,494 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:08:44,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:08:44,495 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:08:44,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:08:44,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:08:44,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:08:44,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:08:44,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:08:44,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:08:44,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:08:44,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:08:44,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:08:44,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:08:44,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:08:44,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:08:44,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:08:44,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:08:44,497 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:08:44,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:08:44,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 460c5a2466ddacef0b654abb4130c31f8265660c [2018-11-10 02:08:44,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:08:44,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:08:44,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:08:44,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:08:44,536 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:08:44,537 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-10 02:08:44,576 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/data/f32e6cf99/d291c887723d43ab9ac9c46894a3eead/FLAG78c3b60c6 [2018-11-10 02:08:44,881 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:08:44,881 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-10 02:08:44,887 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/data/f32e6cf99/d291c887723d43ab9ac9c46894a3eead/FLAG78c3b60c6 [2018-11-10 02:08:44,896 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/data/f32e6cf99/d291c887723d43ab9ac9c46894a3eead [2018-11-10 02:08:44,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:08:44,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 02:08:44,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:08:44,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:08:44,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:08:44,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:08:44" (1/1) ... [2018-11-10 02:08:44,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549999d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:44, skipping insertion in model container [2018-11-10 02:08:44,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:08:44" (1/1) ... [2018-11-10 02:08:44,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:08:44,940 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:08:45,062 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:08:45,066 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:08:45,090 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:08:45,100 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:08:45,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45 WrapperNode [2018-11-10 02:08:45,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:08:45,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:08:45,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:08:45,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:08:45,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... [2018-11-10 02:08:45,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:08:45,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:08:45,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:08:45,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:08:45,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-10 02:08:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 02:08:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 02:08:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:08:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 02:08:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 02:08:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 02:08:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 02:08:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 02:08:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:08:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:08:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:08:45,646 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:08:45,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:08:45 BoogieIcfgContainer [2018-11-10 02:08:45,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:08:45,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:08:45,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:08:45,649 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:08:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:08:44" (1/3) ... [2018-11-10 02:08:45,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d5fd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:08:45, skipping insertion in model container [2018-11-10 02:08:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:08:45" (2/3) ... [2018-11-10 02:08:45,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d5fd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:08:45, skipping insertion in model container [2018-11-10 02:08:45,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:08:45" (3/3) ... [2018-11-10 02:08:45,651 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-10 02:08:45,656 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:08:45,662 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:08:45,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:08:45,691 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:08:45,692 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:08:45,692 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:08:45,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:08:45,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:08:45,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:08:45,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:08:45,693 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:08:45,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:08:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-11-10 02:08:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:45,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:45,719 INFO L375 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, 1, 1] [2018-11-10 02:08:45,721 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:45,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 520324493, now seen corresponding path program 1 times [2018-11-10 02:08:45,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:45,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:45,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:08:45,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:08:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:08:45,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:08:45,940 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-11-10 02:08:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:46,095 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2018-11-10 02:08:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:08:46,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 02:08:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:46,106 INFO L225 Difference]: With dead ends: 403 [2018-11-10 02:08:46,106 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 02:08:46,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:08:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 02:08:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-10 02:08:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2018-11-10 02:08:46,153 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 274 transitions. Word has length 107 [2018-11-10 02:08:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:46,154 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 274 transitions. [2018-11-10 02:08:46,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:08:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 274 transitions. [2018-11-10 02:08:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:46,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:46,157 INFO L375 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, 1, 1] [2018-11-10 02:08:46,157 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:46,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1834060789, now seen corresponding path program 1 times [2018-11-10 02:08:46,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:46,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:46,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:46,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:46,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:46,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:46,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:46,282 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. Second operand 5 states. [2018-11-10 02:08:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:46,672 INFO L93 Difference]: Finished difference Result 416 states and 586 transitions. [2018-11-10 02:08:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:46,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:46,677 INFO L225 Difference]: With dead ends: 416 [2018-11-10 02:08:46,677 INFO L226 Difference]: Without dead ends: 236 [2018-11-10 02:08:46,679 INFO L605 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-11-10 02:08:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-10 02:08:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2018-11-10 02:08:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2018-11-10 02:08:46,701 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 107 [2018-11-10 02:08:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:46,701 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2018-11-10 02:08:46,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2018-11-10 02:08:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:46,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:46,703 INFO L375 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, 1, 1] [2018-11-10 02:08:46,703 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:46,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -509204595, now seen corresponding path program 1 times [2018-11-10 02:08:46,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:46,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:46,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:46,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:46,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:46,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:46,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:46,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:46,778 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand 5 states. [2018-11-10 02:08:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:47,073 INFO L93 Difference]: Finished difference Result 414 states and 580 transitions. [2018-11-10 02:08:47,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:47,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:47,076 INFO L225 Difference]: With dead ends: 414 [2018-11-10 02:08:47,076 INFO L226 Difference]: Without dead ends: 234 [2018-11-10 02:08:47,077 INFO L605 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-11-10 02:08:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-10 02:08:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2018-11-10 02:08:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 272 transitions. [2018-11-10 02:08:47,094 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 272 transitions. Word has length 107 [2018-11-10 02:08:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:47,095 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 272 transitions. [2018-11-10 02:08:47,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 272 transitions. [2018-11-10 02:08:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:47,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:47,096 INFO L375 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, 1, 1] [2018-11-10 02:08:47,097 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:47,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1057553355, now seen corresponding path program 1 times [2018-11-10 02:08:47,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:47,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:47,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:47,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:47,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:47,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:47,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:47,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:47,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:47,183 INFO L87 Difference]: Start difference. First operand 201 states and 272 transitions. Second operand 5 states. [2018-11-10 02:08:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:47,423 INFO L93 Difference]: Finished difference Result 412 states and 574 transitions. [2018-11-10 02:08:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:47,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:47,426 INFO L225 Difference]: With dead ends: 412 [2018-11-10 02:08:47,426 INFO L226 Difference]: Without dead ends: 232 [2018-11-10 02:08:47,427 INFO L605 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-11-10 02:08:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-10 02:08:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2018-11-10 02:08:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2018-11-10 02:08:47,443 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 107 [2018-11-10 02:08:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:47,443 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2018-11-10 02:08:47,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2018-11-10 02:08:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:47,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:47,444 INFO L375 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, 1, 1] [2018-11-10 02:08:47,445 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:47,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash -284723, now seen corresponding path program 1 times [2018-11-10 02:08:47,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:47,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:47,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:47,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:47,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:47,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:47,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:47,518 INFO L87 Difference]: Start difference. First operand 201 states and 271 transitions. Second operand 5 states. [2018-11-10 02:08:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:47,746 INFO L93 Difference]: Finished difference Result 434 states and 608 transitions. [2018-11-10 02:08:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:47,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:47,748 INFO L225 Difference]: With dead ends: 434 [2018-11-10 02:08:47,749 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 02:08:47,749 INFO L605 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-11-10 02:08:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 02:08:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2018-11-10 02:08:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 270 transitions. [2018-11-10 02:08:47,763 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 270 transitions. Word has length 107 [2018-11-10 02:08:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:47,763 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 270 transitions. [2018-11-10 02:08:47,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 270 transitions. [2018-11-10 02:08:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:47,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:47,764 INFO L375 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, 1, 1] [2018-11-10 02:08:47,765 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:47,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1142787189, now seen corresponding path program 1 times [2018-11-10 02:08:47,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:47,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:47,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:47,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:47,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:47,817 INFO L87 Difference]: Start difference. First operand 201 states and 270 transitions. Second operand 5 states. [2018-11-10 02:08:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:48,092 INFO L93 Difference]: Finished difference Result 427 states and 596 transitions. [2018-11-10 02:08:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:48,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:48,094 INFO L225 Difference]: With dead ends: 427 [2018-11-10 02:08:48,094 INFO L226 Difference]: Without dead ends: 247 [2018-11-10 02:08:48,095 INFO L605 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-11-10 02:08:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-10 02:08:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 201. [2018-11-10 02:08:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 269 transitions. [2018-11-10 02:08:48,109 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 269 transitions. Word has length 107 [2018-11-10 02:08:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:48,109 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 269 transitions. [2018-11-10 02:08:48,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 269 transitions. [2018-11-10 02:08:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:48,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:48,111 INFO L375 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, 1, 1] [2018-11-10 02:08:48,111 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:48,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -902547443, now seen corresponding path program 1 times [2018-11-10 02:08:48,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:48,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:48,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:48,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:48,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:48,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:48,165 INFO L87 Difference]: Start difference. First operand 201 states and 269 transitions. Second operand 5 states. [2018-11-10 02:08:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:48,421 INFO L93 Difference]: Finished difference Result 430 states and 596 transitions. [2018-11-10 02:08:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:48,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:48,423 INFO L225 Difference]: With dead ends: 430 [2018-11-10 02:08:48,423 INFO L226 Difference]: Without dead ends: 250 [2018-11-10 02:08:48,424 INFO L605 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-11-10 02:08:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-10 02:08:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 201. [2018-11-10 02:08:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 268 transitions. [2018-11-10 02:08:48,437 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 268 transitions. Word has length 107 [2018-11-10 02:08:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:48,437 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 268 transitions. [2018-11-10 02:08:48,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 268 transitions. [2018-11-10 02:08:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:48,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:48,438 INFO L375 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, 1, 1] [2018-11-10 02:08:48,438 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:48,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash -63513781, now seen corresponding path program 1 times [2018-11-10 02:08:48,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:48,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:48,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:48,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:48,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:48,490 INFO L87 Difference]: Start difference. First operand 201 states and 268 transitions. Second operand 5 states. [2018-11-10 02:08:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:48,708 INFO L93 Difference]: Finished difference Result 428 states and 590 transitions. [2018-11-10 02:08:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:48,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 02:08:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:48,709 INFO L225 Difference]: With dead ends: 428 [2018-11-10 02:08:48,709 INFO L226 Difference]: Without dead ends: 248 [2018-11-10 02:08:48,710 INFO L605 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-11-10 02:08:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-10 02:08:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 201. [2018-11-10 02:08:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 02:08:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2018-11-10 02:08:48,732 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 267 transitions. Word has length 107 [2018-11-10 02:08:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:48,733 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 267 transitions. [2018-11-10 02:08:48,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 267 transitions. [2018-11-10 02:08:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 02:08:48,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:48,734 INFO L375 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, 1, 1] [2018-11-10 02:08:48,734 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:48,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:48,734 INFO L82 PathProgramCache]: Analyzing trace with hash -36448179, now seen corresponding path program 1 times [2018-11-10 02:08:48,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:48,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:08:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:48,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:08:48,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:08:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:08:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:08:48,784 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. Second operand 4 states. [2018-11-10 02:08:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:48,911 INFO L93 Difference]: Finished difference Result 551 states and 764 transitions. [2018-11-10 02:08:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:08:48,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 02:08:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:48,913 INFO L225 Difference]: With dead ends: 551 [2018-11-10 02:08:48,913 INFO L226 Difference]: Without dead ends: 372 [2018-11-10 02:08:48,914 INFO L605 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-11-10 02:08:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-10 02:08:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-10 02:08:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-10 02:08:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 492 transitions. [2018-11-10 02:08:48,935 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 492 transitions. Word has length 107 [2018-11-10 02:08:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:48,936 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 492 transitions. [2018-11-10 02:08:48,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:08:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 492 transitions. [2018-11-10 02:08:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 02:08:48,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:48,938 INFO L375 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, 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] [2018-11-10 02:08:48,938 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:48,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1931539683, now seen corresponding path program 1 times [2018-11-10 02:08:48,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:48,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:48,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 02:08:48,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:08:48,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:49,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 02:08:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:08:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 02:08:49,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:08:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:08:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:08:49,131 INFO L87 Difference]: Start difference. First operand 371 states and 492 transitions. Second operand 7 states. [2018-11-10 02:08:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:49,312 INFO L93 Difference]: Finished difference Result 1088 states and 1544 transitions. [2018-11-10 02:08:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:08:49,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2018-11-10 02:08:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:49,316 INFO L225 Difference]: With dead ends: 1088 [2018-11-10 02:08:49,317 INFO L226 Difference]: Without dead ends: 739 [2018-11-10 02:08:49,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:08:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-11-10 02:08:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 706. [2018-11-10 02:08:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-11-10 02:08:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 965 transitions. [2018-11-10 02:08:49,397 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 965 transitions. Word has length 173 [2018-11-10 02:08:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:49,397 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 965 transitions. [2018-11-10 02:08:49,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:08:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 965 transitions. [2018-11-10 02:08:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 02:08:49,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:49,401 INFO L375 BasicCegarLoop]: trace histogram [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, 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-11-10 02:08:49,401 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:49,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1431704031, now seen corresponding path program 1 times [2018-11-10 02:08:49,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 02:08:49,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:08:49,496 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:49,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:49,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 02:08:49,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:08:49,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-10 02:08:49,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:49,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:49,654 INFO L87 Difference]: Start difference. First operand 706 states and 965 transitions. Second operand 5 states. [2018-11-10 02:08:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:50,201 INFO L93 Difference]: Finished difference Result 2849 states and 4204 transitions. [2018-11-10 02:08:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:08:50,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-11-10 02:08:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:50,213 INFO L225 Difference]: With dead ends: 2849 [2018-11-10 02:08:50,213 INFO L226 Difference]: Without dead ends: 2170 [2018-11-10 02:08:50,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:08:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2018-11-10 02:08:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2154. [2018-11-10 02:08:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2018-11-10 02:08:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2953 transitions. [2018-11-10 02:08:50,406 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2953 transitions. Word has length 195 [2018-11-10 02:08:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:50,406 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 2953 transitions. [2018-11-10 02:08:50,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2953 transitions. [2018-11-10 02:08:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 02:08:50,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:50,410 INFO L375 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, 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] [2018-11-10 02:08:50,411 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:50,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1400569579, now seen corresponding path program 1 times [2018-11-10 02:08:50,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:50,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:50,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:50,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:50,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 02:08:50,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:50,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:08:50,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:08:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:08:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:08:50,476 INFO L87 Difference]: Start difference. First operand 2154 states and 2953 transitions. Second operand 4 states. [2018-11-10 02:08:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:50,706 INFO L93 Difference]: Finished difference Result 3763 states and 5130 transitions. [2018-11-10 02:08:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:08:50,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-11-10 02:08:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:50,713 INFO L225 Difference]: With dead ends: 3763 [2018-11-10 02:08:50,714 INFO L226 Difference]: Without dead ends: 1631 [2018-11-10 02:08:50,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:08:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-11-10 02:08:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2018-11-10 02:08:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-11-10 02:08:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2204 transitions. [2018-11-10 02:08:50,847 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2204 transitions. Word has length 173 [2018-11-10 02:08:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:50,847 INFO L481 AbstractCegarLoop]: Abstraction has 1631 states and 2204 transitions. [2018-11-10 02:08:50,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:08:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2204 transitions. [2018-11-10 02:08:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 02:08:50,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:50,850 INFO L375 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, 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-11-10 02:08:50,850 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:50,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1103455203, now seen corresponding path program 1 times [2018-11-10 02:08:50,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:50,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:50,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:50,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:50,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 02:08:50,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:08:50,899 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:50,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 02:08:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:08:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 02:08:51,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:08:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:08:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:08:51,064 INFO L87 Difference]: Start difference. First operand 1631 states and 2204 transitions. Second operand 7 states. [2018-11-10 02:08:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:51,280 INFO L93 Difference]: Finished difference Result 3467 states and 4835 transitions. [2018-11-10 02:08:51,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:08:51,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-11-10 02:08:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:51,289 INFO L225 Difference]: With dead ends: 3467 [2018-11-10 02:08:51,289 INFO L226 Difference]: Without dead ends: 1858 [2018-11-10 02:08:51,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:08:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2018-11-10 02:08:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2018-11-10 02:08:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-11-10 02:08:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2459 transitions. [2018-11-10 02:08:51,431 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2459 transitions. Word has length 174 [2018-11-10 02:08:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:51,432 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 2459 transitions. [2018-11-10 02:08:51,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:08:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2459 transitions. [2018-11-10 02:08:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 02:08:51,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:51,438 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:08:51,439 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:51,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash 73473507, now seen corresponding path program 1 times [2018-11-10 02:08:51,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:51,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:51,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-10 02:08:51,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:08:51,503 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:51,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 02:08:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:08:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-10 02:08:51,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:51,766 INFO L87 Difference]: Start difference. First operand 1858 states and 2459 transitions. Second operand 5 states. [2018-11-10 02:08:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:52,344 INFO L93 Difference]: Finished difference Result 5469 states and 7746 transitions. [2018-11-10 02:08:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:08:52,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-10 02:08:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:52,359 INFO L225 Difference]: With dead ends: 5469 [2018-11-10 02:08:52,359 INFO L226 Difference]: Without dead ends: 3633 [2018-11-10 02:08:52,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2018-11-10 02:08:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3603. [2018-11-10 02:08:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3603 states. [2018-11-10 02:08:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 4763 transitions. [2018-11-10 02:08:52,671 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 4763 transitions. Word has length 228 [2018-11-10 02:08:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:52,671 INFO L481 AbstractCegarLoop]: Abstraction has 3603 states and 4763 transitions. [2018-11-10 02:08:52,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 4763 transitions. [2018-11-10 02:08:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 02:08:52,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:52,679 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:08:52,679 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:52,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1991134642, now seen corresponding path program 1 times [2018-11-10 02:08:52,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:52,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:52,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:52,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 02:08:52,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:52,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:52,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:52,776 INFO L87 Difference]: Start difference. First operand 3603 states and 4763 transitions. Second operand 5 states. [2018-11-10 02:08:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:53,807 INFO L93 Difference]: Finished difference Result 8934 states and 12069 transitions. [2018-11-10 02:08:53,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:08:53,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-10 02:08:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:53,829 INFO L225 Difference]: With dead ends: 8934 [2018-11-10 02:08:53,829 INFO L226 Difference]: Without dead ends: 5354 [2018-11-10 02:08:53,839 INFO L605 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-11-10 02:08:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5354 states. [2018-11-10 02:08:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5354 to 4886. [2018-11-10 02:08:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2018-11-10 02:08:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6351 transitions. [2018-11-10 02:08:54,235 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6351 transitions. Word has length 228 [2018-11-10 02:08:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:54,235 INFO L481 AbstractCegarLoop]: Abstraction has 4886 states and 6351 transitions. [2018-11-10 02:08:54,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6351 transitions. [2018-11-10 02:08:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 02:08:54,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:54,245 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:08:54,245 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:54,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1379865584, now seen corresponding path program 1 times [2018-11-10 02:08:54,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:54,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:54,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 02:08:54,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:54,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:54,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:54,330 INFO L87 Difference]: Start difference. First operand 4886 states and 6351 transitions. Second operand 5 states. [2018-11-10 02:08:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:55,144 INFO L93 Difference]: Finished difference Result 9747 states and 12742 transitions. [2018-11-10 02:08:55,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:55,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-10 02:08:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:55,158 INFO L225 Difference]: With dead ends: 9747 [2018-11-10 02:08:55,158 INFO L226 Difference]: Without dead ends: 4886 [2018-11-10 02:08:55,168 INFO L605 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-11-10 02:08:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2018-11-10 02:08:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4886. [2018-11-10 02:08:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2018-11-10 02:08:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6297 transitions. [2018-11-10 02:08:55,410 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6297 transitions. Word has length 228 [2018-11-10 02:08:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:55,410 INFO L481 AbstractCegarLoop]: Abstraction has 4886 states and 6297 transitions. [2018-11-10 02:08:55,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6297 transitions. [2018-11-10 02:08:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 02:08:55,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:55,416 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:08:55,416 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:55,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -25326094, now seen corresponding path program 1 times [2018-11-10 02:08:55,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:55,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:55,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 02:08:55,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:55,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:55,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:55,478 INFO L87 Difference]: Start difference. First operand 4886 states and 6297 transitions. Second operand 5 states. [2018-11-10 02:08:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:55,915 INFO L93 Difference]: Finished difference Result 9747 states and 12634 transitions. [2018-11-10 02:08:55,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:08:55,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-10 02:08:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:55,929 INFO L225 Difference]: With dead ends: 9747 [2018-11-10 02:08:55,929 INFO L226 Difference]: Without dead ends: 4886 [2018-11-10 02:08:55,938 INFO L605 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-11-10 02:08:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2018-11-10 02:08:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4886. [2018-11-10 02:08:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2018-11-10 02:08:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6243 transitions. [2018-11-10 02:08:56,207 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6243 transitions. Word has length 228 [2018-11-10 02:08:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:56,207 INFO L481 AbstractCegarLoop]: Abstraction has 4886 states and 6243 transitions. [2018-11-10 02:08:56,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6243 transitions. [2018-11-10 02:08:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 02:08:56,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:56,217 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:08:56,217 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:56,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1869007792, now seen corresponding path program 1 times [2018-11-10 02:08:56,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:56,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:56,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:56,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 02:08:56,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:08:56,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:08:56,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:08:56,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:08:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:08:56,299 INFO L87 Difference]: Start difference. First operand 4886 states and 6243 transitions. Second operand 5 states. [2018-11-10 02:08:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:56,841 INFO L93 Difference]: Finished difference Result 9539 states and 12767 transitions. [2018-11-10 02:08:56,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:08:56,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-11-10 02:08:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:56,852 INFO L225 Difference]: With dead ends: 9539 [2018-11-10 02:08:56,853 INFO L226 Difference]: Without dead ends: 4678 [2018-11-10 02:08:56,862 INFO L605 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-11-10 02:08:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2018-11-10 02:08:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4436. [2018-11-10 02:08:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2018-11-10 02:08:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 5512 transitions. [2018-11-10 02:08:57,054 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 5512 transitions. Word has length 228 [2018-11-10 02:08:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:57,054 INFO L481 AbstractCegarLoop]: Abstraction has 4436 states and 5512 transitions. [2018-11-10 02:08:57,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:08:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 5512 transitions. [2018-11-10 02:08:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-10 02:08:57,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:57,062 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 02:08:57,062 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:57,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash 387486292, now seen corresponding path program 1 times [2018-11-10 02:08:57,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:57,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:57,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-11-10 02:08:57,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:08:57,156 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:57,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:57,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-10 02:08:57,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:08:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 02:08:57,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:08:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:08:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:08:57,404 INFO L87 Difference]: Start difference. First operand 4436 states and 5512 transitions. Second operand 8 states. [2018-11-10 02:08:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:58,072 INFO L93 Difference]: Finished difference Result 9617 states and 12462 transitions. [2018-11-10 02:08:58,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:08:58,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 359 [2018-11-10 02:08:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:08:58,089 INFO L225 Difference]: With dead ends: 9617 [2018-11-10 02:08:58,089 INFO L226 Difference]: Without dead ends: 5204 [2018-11-10 02:08:58,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:08:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2018-11-10 02:08:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4586. [2018-11-10 02:08:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4586 states. [2018-11-10 02:08:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4586 states to 4586 states and 5705 transitions. [2018-11-10 02:08:58,408 INFO L78 Accepts]: Start accepts. Automaton has 4586 states and 5705 transitions. Word has length 359 [2018-11-10 02:08:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:08:58,409 INFO L481 AbstractCegarLoop]: Abstraction has 4586 states and 5705 transitions. [2018-11-10 02:08:58,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:08:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4586 states and 5705 transitions. [2018-11-10 02:08:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-10 02:08:58,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:08:58,418 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 02:08:58,418 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:08:58,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:08:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 760668880, now seen corresponding path program 1 times [2018-11-10 02:08:58,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:08:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:08:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:58,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:08:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-11-10 02:08:58,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:08:58,594 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:08:58,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:08:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:08:58,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:08:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-10 02:08:58,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:08:58,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 02:08:58,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:08:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:08:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:08:58,857 INFO L87 Difference]: Start difference. First operand 4586 states and 5705 transitions. Second operand 8 states. [2018-11-10 02:08:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:08:59,991 INFO L93 Difference]: Finished difference Result 11738 states and 17995 transitions. [2018-11-10 02:08:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:08:59,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 359 [2018-11-10 02:08:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:00,020 INFO L225 Difference]: With dead ends: 11738 [2018-11-10 02:09:00,020 INFO L226 Difference]: Without dead ends: 7177 [2018-11-10 02:09:00,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 366 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-11-10 02:09:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2018-11-10 02:09:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 5423. [2018-11-10 02:09:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5423 states. [2018-11-10 02:09:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5423 states to 5423 states and 6488 transitions. [2018-11-10 02:09:00,507 INFO L78 Accepts]: Start accepts. Automaton has 5423 states and 6488 transitions. Word has length 359 [2018-11-10 02:09:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:00,507 INFO L481 AbstractCegarLoop]: Abstraction has 5423 states and 6488 transitions. [2018-11-10 02:09:00,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:09:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5423 states and 6488 transitions. [2018-11-10 02:09:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-10 02:09:00,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:00,513 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 02:09:00,513 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:00,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:00,513 INFO L82 PathProgramCache]: Analyzing trace with hash 912549147, now seen corresponding path program 1 times [2018-11-10 02:09:00,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:00,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:00,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-11-10 02:09:00,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:09:00,609 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:09:00,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:00,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:09:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-10 02:09:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:09:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-10 02:09:00,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 02:09:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:09:00,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:09:00,791 INFO L87 Difference]: Start difference. First operand 5423 states and 6488 transitions. Second operand 12 states. [2018-11-10 02:09:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:01,080 INFO L93 Difference]: Finished difference Result 9262 states and 11168 transitions. [2018-11-10 02:09:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:09:01,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 362 [2018-11-10 02:09:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:01,089 INFO L225 Difference]: With dead ends: 9262 [2018-11-10 02:09:01,089 INFO L226 Difference]: Without dead ends: 3864 [2018-11-10 02:09:01,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:09:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2018-11-10 02:09:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3574. [2018-11-10 02:09:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2018-11-10 02:09:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4162 transitions. [2018-11-10 02:09:01,369 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4162 transitions. Word has length 362 [2018-11-10 02:09:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:01,370 INFO L481 AbstractCegarLoop]: Abstraction has 3574 states and 4162 transitions. [2018-11-10 02:09:01,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 02:09:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4162 transitions. [2018-11-10 02:09:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-10 02:09:01,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:01,374 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:09:01,374 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:01,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1969994056, now seen corresponding path program 1 times [2018-11-10 02:09:01,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:01,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 02:09:01,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:09:01,441 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:09:01,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:01,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:09:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 02:09:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:09:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-10 02:09:01,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:09:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:09:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:09:01,665 INFO L87 Difference]: Start difference. First operand 3574 states and 4162 transitions. Second operand 6 states. [2018-11-10 02:09:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:02,917 INFO L93 Difference]: Finished difference Result 16302 states and 20250 transitions. [2018-11-10 02:09:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:09:02,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2018-11-10 02:09:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:02,944 INFO L225 Difference]: With dead ends: 16302 [2018-11-10 02:09:02,944 INFO L226 Difference]: Without dead ends: 12879 [2018-11-10 02:09:02,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:09:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12879 states. [2018-11-10 02:09:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12879 to 11410. [2018-11-10 02:09:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2018-11-10 02:09:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 13738 transitions. [2018-11-10 02:09:03,799 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 13738 transitions. Word has length 253 [2018-11-10 02:09:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:03,800 INFO L481 AbstractCegarLoop]: Abstraction has 11410 states and 13738 transitions. [2018-11-10 02:09:03,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:09:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 13738 transitions. [2018-11-10 02:09:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-10 02:09:03,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:03,812 INFO L375 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, 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] [2018-11-10 02:09:03,813 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:03,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:03,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1582131361, now seen corresponding path program 1 times [2018-11-10 02:09:03,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:03,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:03,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:03,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:03,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 02:09:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:09:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:09:03,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:09:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:09:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:09:03,891 INFO L87 Difference]: Start difference. First operand 11410 states and 13738 transitions. Second operand 4 states. [2018-11-10 02:09:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:04,546 INFO L93 Difference]: Finished difference Result 22040 states and 26429 transitions. [2018-11-10 02:09:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:09:04,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2018-11-10 02:09:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:04,572 INFO L225 Difference]: With dead ends: 22040 [2018-11-10 02:09:04,572 INFO L226 Difference]: Without dead ends: 10810 [2018-11-10 02:09:04,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:09:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10810 states. [2018-11-10 02:09:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10810 to 10804. [2018-11-10 02:09:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10804 states. [2018-11-10 02:09:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10804 states to 10804 states and 12876 transitions. [2018-11-10 02:09:05,297 INFO L78 Accepts]: Start accepts. Automaton has 10804 states and 12876 transitions. Word has length 254 [2018-11-10 02:09:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:05,298 INFO L481 AbstractCegarLoop]: Abstraction has 10804 states and 12876 transitions. [2018-11-10 02:09:05,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:09:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10804 states and 12876 transitions. [2018-11-10 02:09:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-10 02:09:05,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:05,306 INFO L375 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, 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] [2018-11-10 02:09:05,307 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:05,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1698505659, now seen corresponding path program 1 times [2018-11-10 02:09:05,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:05,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:05,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:05,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 02:09:05,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:09:05,417 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:09:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:05,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:09:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 02:09:05,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:09:05,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 02:09:05,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:09:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:09:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:09:05,558 INFO L87 Difference]: Start difference. First operand 10804 states and 12876 transitions. Second operand 6 states. [2018-11-10 02:09:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:06,073 INFO L93 Difference]: Finished difference Result 18623 states and 22717 transitions. [2018-11-10 02:09:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:09:06,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2018-11-10 02:09:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:06,087 INFO L225 Difference]: With dead ends: 18623 [2018-11-10 02:09:06,087 INFO L226 Difference]: Without dead ends: 7939 [2018-11-10 02:09:06,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:09:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7939 states. [2018-11-10 02:09:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7939 to 7860. [2018-11-10 02:09:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7860 states. [2018-11-10 02:09:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7860 states to 7860 states and 9106 transitions. [2018-11-10 02:09:06,526 INFO L78 Accepts]: Start accepts. Automaton has 7860 states and 9106 transitions. Word has length 256 [2018-11-10 02:09:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:06,527 INFO L481 AbstractCegarLoop]: Abstraction has 7860 states and 9106 transitions. [2018-11-10 02:09:06,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:09:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 7860 states and 9106 transitions. [2018-11-10 02:09:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-10 02:09:06,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:06,532 INFO L375 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, 2, 2, 2, 2, 2, 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] [2018-11-10 02:09:06,532 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:06,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1370333605, now seen corresponding path program 1 times [2018-11-10 02:09:06,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:06,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:06,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-11-10 02:09:06,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:09:06,602 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/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-11-10 02:09:06,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:06,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:09:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-10 02:09:06,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:09:06,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-10 02:09:06,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:09:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:09:06,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:09:06,807 INFO L87 Difference]: Start difference. First operand 7860 states and 9106 transitions. Second operand 6 states. [2018-11-10 02:09:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:07,567 INFO L93 Difference]: Finished difference Result 13721 states and 15810 transitions. [2018-11-10 02:09:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:09:07,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-11-10 02:09:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:07,583 INFO L225 Difference]: With dead ends: 13721 [2018-11-10 02:09:07,583 INFO L226 Difference]: Without dead ends: 6784 [2018-11-10 02:09:07,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:09:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2018-11-10 02:09:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 6682. [2018-11-10 02:09:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6682 states. [2018-11-10 02:09:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6682 states to 6682 states and 7525 transitions. [2018-11-10 02:09:07,915 INFO L78 Accepts]: Start accepts. Automaton has 6682 states and 7525 transitions. Word has length 318 [2018-11-10 02:09:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:07,916 INFO L481 AbstractCegarLoop]: Abstraction has 6682 states and 7525 transitions. [2018-11-10 02:09:07,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:09:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6682 states and 7525 transitions. [2018-11-10 02:09:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-11-10 02:09:07,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:07,920 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 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, 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] [2018-11-10 02:09:07,920 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:07,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2043928983, now seen corresponding path program 1 times [2018-11-10 02:09:07,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:07,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:07,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:07,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 72 proven. 44 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-11-10 02:09:08,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:09:08,049 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:09:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:08,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:09:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-10 02:09:08,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:09:08,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-10 02:09:08,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:09:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:09:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:09:08,292 INFO L87 Difference]: Start difference. First operand 6682 states and 7525 transitions. Second operand 4 states. [2018-11-10 02:09:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:08,770 INFO L93 Difference]: Finished difference Result 11864 states and 13834 transitions. [2018-11-10 02:09:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:09:08,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 495 [2018-11-10 02:09:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:08,779 INFO L225 Difference]: With dead ends: 11864 [2018-11-10 02:09:08,779 INFO L226 Difference]: Without dead ends: 5252 [2018-11-10 02:09:08,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 494 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-11-10 02:09:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2018-11-10 02:09:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 5240. [2018-11-10 02:09:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5240 states. [2018-11-10 02:09:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 5846 transitions. [2018-11-10 02:09:09,096 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 5846 transitions. Word has length 495 [2018-11-10 02:09:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:09,096 INFO L481 AbstractCegarLoop]: Abstraction has 5240 states and 5846 transitions. [2018-11-10 02:09:09,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:09:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 5846 transitions. [2018-11-10 02:09:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-11-10 02:09:09,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:09,100 INFO L375 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, 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, 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] [2018-11-10 02:09:09,100 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:09,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:09,100 INFO L82 PathProgramCache]: Analyzing trace with hash -719635531, now seen corresponding path program 1 times [2018-11-10 02:09:09,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:09,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:09,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:09,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:09,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-11-10 02:09:09,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:09:09,217 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:09:09,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:09,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:09:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-10 02:09:09,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:09:09,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-10 02:09:09,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:09:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:09:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:09:09,509 INFO L87 Difference]: Start difference. First operand 5240 states and 5846 transitions. Second operand 10 states. [2018-11-10 02:09:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:10,153 INFO L93 Difference]: Finished difference Result 7320 states and 8173 transitions. [2018-11-10 02:09:10,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 02:09:10,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 514 [2018-11-10 02:09:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:10,156 INFO L225 Difference]: With dead ends: 7320 [2018-11-10 02:09:10,156 INFO L226 Difference]: Without dead ends: 1055 [2018-11-10 02:09:10,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-10 02:09:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-11-10 02:09:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1044. [2018-11-10 02:09:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-11-10 02:09:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1097 transitions. [2018-11-10 02:09:10,223 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1097 transitions. Word has length 514 [2018-11-10 02:09:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:10,224 INFO L481 AbstractCegarLoop]: Abstraction has 1044 states and 1097 transitions. [2018-11-10 02:09:10,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:09:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1097 transitions. [2018-11-10 02:09:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-11-10 02:09:10,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:09:10,226 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 02:09:10,226 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:09:10,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:09:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash -97431788, now seen corresponding path program 1 times [2018-11-10 02:09:10,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:09:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:09:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:09:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:09:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:09:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-10 02:09:10,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:09:10,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 02:09:10,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:09:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:09:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:09:10,424 INFO L87 Difference]: Start difference. First operand 1044 states and 1097 transitions. Second operand 8 states. [2018-11-10 02:09:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:09:11,026 INFO L93 Difference]: Finished difference Result 1044 states and 1097 transitions. [2018-11-10 02:09:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 02:09:11,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 385 [2018-11-10 02:09:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:09:11,027 INFO L225 Difference]: With dead ends: 1044 [2018-11-10 02:09:11,027 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 02:09:11,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:09:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 02:09:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 02:09:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 02:09:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 02:09:11,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 385 [2018-11-10 02:09:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:09:11,030 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:09:11,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:09:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:09:11,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 02:09:11,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 02:09:11,651 WARN L179 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 260 [2018-11-10 02:09:11,820 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 172 [2018-11-10 02:09:12,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:12,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:13,355 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 260 [2018-11-10 02:09:14,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:14,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:15,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 02:09:17,622 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 122 [2018-11-10 02:09:21,140 WARN L179 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 398 DAG size of output: 229 [2018-11-10 02:09:22,529 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 172 DAG size of output: 125 [2018-11-10 02:09:22,840 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 117 [2018-11-10 02:09:26,492 WARN L179 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 328 DAG size of output: 141 [2018-11-10 02:09:29,718 WARN L179 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 221 DAG size of output: 120 [2018-11-10 02:09:30,457 WARN L179 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 112 [2018-11-10 02:09:31,145 WARN L179 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 137 [2018-11-10 02:09:31,673 WARN L179 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 144 [2018-11-10 02:09:31,889 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 103 [2018-11-10 02:09:32,594 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2018-11-10 02:09:32,891 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 1 [2018-11-10 02:09:35,221 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 177 DAG size of output: 118 [2018-11-10 02:09:38,696 WARN L179 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 206 DAG size of output: 118 [2018-11-10 02:09:39,007 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 122 [2018-11-10 02:09:40,630 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 275 DAG size of output: 180 [2018-11-10 02:09:44,177 WARN L179 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 398 DAG size of output: 229 [2018-11-10 02:09:46,031 WARN L179 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 166 DAG size of output: 125 [2018-11-10 02:09:47,961 WARN L179 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2018-11-10 02:09:51,890 WARN L179 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 232 DAG size of output: 146 [2018-11-10 02:09:52,215 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2018-11-10 02:09:55,859 WARN L179 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 228 DAG size of output: 142 [2018-11-10 02:09:55,965 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2018-11-10 02:09:57,209 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 244 DAG size of output: 165 [2018-11-10 02:10:01,943 WARN L179 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 269 DAG size of output: 169 [2018-11-10 02:10:02,372 WARN L179 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 94 [2018-11-10 02:10:03,728 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 230 DAG size of output: 108 [2018-11-10 02:10:06,610 WARN L179 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 238 DAG size of output: 164 [2018-11-10 02:10:07,872 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 167 DAG size of output: 116 [2018-11-10 02:10:09,368 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 165 DAG size of output: 114 [2018-11-10 02:10:09,731 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 117 [2018-11-10 02:10:11,401 WARN L179 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2018-11-10 02:10:11,721 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 1 [2018-11-10 02:10:15,141 WARN L179 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 292 DAG size of output: 128 [2018-11-10 02:10:17,254 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 171 DAG size of output: 121 [2018-11-10 02:10:17,384 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2018-11-10 02:10:17,523 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 109 [2018-11-10 02:10:19,056 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 159 DAG size of output: 111 [2018-11-10 02:10:19,291 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2018-11-10 02:10:19,429 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 109 [2018-11-10 02:10:19,850 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2018-11-10 02:10:26,673 WARN L179 SmtUtils]: Spent 6.82 s on a formula simplification. DAG size of input: 300 DAG size of output: 190 [2018-11-10 02:10:27,933 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 159 DAG size of output: 114 [2018-11-10 02:10:28,071 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2018-11-10 02:10:28,406 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 117 [2018-11-10 02:10:28,715 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 122 [2018-11-10 02:10:30,952 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 195 DAG size of output: 131 [2018-11-10 02:10:32,450 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 165 DAG size of output: 114 [2018-11-10 02:10:32,827 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 117 [2018-11-10 02:10:32,970 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 1 [2018-11-10 02:10:33,556 WARN L179 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 120 [2018-11-10 02:10:36,568 WARN L179 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 208 DAG size of output: 135 [2018-11-10 02:10:38,106 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 262 DAG size of output: 181 [2018-11-10 02:10:38,838 WARN L179 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 107 [2018-11-10 02:10:39,076 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 78 [2018-11-10 02:10:39,384 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 122 [2018-11-10 02:10:43,170 WARN L179 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 228 DAG size of output: 142 [2018-11-10 02:10:43,281 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 1 [2018-11-10 02:10:43,386 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2018-11-10 02:10:46,157 WARN L179 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 179 DAG size of output: 122 [2018-11-10 02:10:46,509 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 122 [2018-11-10 02:10:47,834 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 227 DAG size of output: 175 [2018-11-10 02:10:48,409 WARN L179 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-11-10 02:10:49,971 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 159 DAG size of output: 113 [2018-11-10 02:10:50,171 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2018-11-10 02:10:50,699 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 144 [2018-11-10 02:10:52,182 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 194 DAG size of output: 158 [2018-11-10 02:10:52,312 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2018-11-10 02:10:52,444 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2018-11-10 02:10:54,762 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 168 DAG size of output: 116 [2018-11-10 02:10:54,764 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-10 02:10:54,765 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 86 121) the Hoare annotation is: (let ((.cse50 (= ~t1_pc~0 1))) (let ((.cse26 (= 1 ~t2_pc~0)) (.cse34 (= 1 ~m_pc~0)) (.cse47 (<= 2 ~t3_st~0)) (.cse27 (= |old(~t1_pc~0)| 1)) (.cse48 (<= 2 ~m_st~0)) (.cse37 (= 0 ~t2_st~0)) (.cse41 (not .cse50)) (.cse42 (= ~m_st~0 0)) (.cse49 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse43 (= ~token~0 |old(~token~0)|)) (.cse44 (= |old(~E_2~0)| ~E_2~0)) (.cse45 (= |old(~t3_st~0)| ~t3_st~0)) (.cse46 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse36 (and .cse41 .cse42 .cse49 .cse43 .cse44 .cse45 .cse46)) (.cse31 (and .cse41 .cse48 .cse44 .cse37 .cse45 .cse46)) (.cse11 (and .cse50 .cse48 .cse49 .cse43 .cse44 .cse45 .cse46)) (.cse40 (and .cse50 .cse48 .cse44 .cse37 .cse45 .cse46)) (.cse15 (not .cse27)) (.cse16 (not (= 0 |old(~t3_st~0)|))) (.cse35 (and .cse48 .cse47 .cse44 .cse46)) (.cse39 (and .cse41 .cse48 .cse49 .cse44 .cse45 .cse46)) (.cse13 (< |old(~t2_st~0)| 2)) (.cse4 (< |old(~m_st~0)| 2)) (.cse22 (not .cse34)) (.cse33 (and .cse42 .cse47 .cse44 .cse46)) (.cse18 (not .cse26)) (.cse23 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse38 (and .cse41 .cse42 .cse43 .cse44 .cse37 .cse45 .cse46)) (.cse7 (= 1 |old(~E_2~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 |old(~E_2~0)|)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (< ~E_1~0 2)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse28 (not (= 1 ~t3_pc~0))) (.cse29 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse20 (not (= ~m_i~0 1))) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse21 (< ~E_3~0 2)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse28 .cse29 .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse29 .cse17 .cse19 .cse32 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse33 .cse34) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 .cse8 .cse9 .cse10 .cse12 .cse29 .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse36 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse27 .cse28 .cse29 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse23 .cse24 .cse25 .cse36 .cse34) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse37 .cse8 .cse9 .cse10 .cse12 .cse29 .cse17 .cse19 .cse32 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse31 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse16 .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse38 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse27 .cse16 .cse17 .cse19 .cse32 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse39 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse40 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse28 .cse29 .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse40 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse12 .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7 .cse22 .cse8 .cse35 .cse23 .cse24 .cse25 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse39 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse27 .cse28 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse29 .cse37 .cse17 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse12 .cse0 .cse1 .cse3 .cse29 .cse5 .cse33 .cse6 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse7 .cse8 .cse23 .cse24 .cse25 .cse9 .cse10 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse38 .cse26 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse27 .cse28 .cse29 .cse17 .cse19 .cse32 .cse20 .cse30 .cse21 .cse24 .cse25 .cse34))))) [2018-11-10 02:10:54,765 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-10 02:10:54,766 INFO L421 ceAbstractionStarter]: At program point L94(lines 89 120) the Hoare annotation is: (let ((.cse30 (= 1 ~t2_pc~0)) (.cse21 (= 1 ~m_pc~0)) (.cse34 (= 0 ~t2_st~0)) (.cse39 (= ~t1_pc~0 1)) (.cse41 (= |old(~t3_st~0)| ~t3_st~0)) (.cse40 (<= 2 ~m_st~0)) (.cse36 (<= 2 ~t3_st~0)) (.cse37 (= |old(~E_2~0)| ~E_2~0)) (.cse38 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse28 (and .cse40 .cse36 .cse37 .cse38)) (.cse35 (and .cse39 .cse40 (= ~t2_st~0 |old(~t2_st~0)|) (= ~token~0 |old(~token~0)|) .cse37 .cse41 .cse38)) (.cse31 (and .cse39 .cse40 .cse37 .cse34 .cse41 .cse38)) (.cse22 (< |old(~m_st~0)| 2)) (.cse15 (not (= 0 |old(~t2_st~0)|))) (.cse27 (not .cse21)) (.cse20 (and (= ~m_st~0 0) .cse36 .cse37 .cse38)) (.cse29 (not (= 0 |old(~t3_st~0)|))) (.cse17 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse32 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse5 (= 1 |old(~E_2~0)|)) (.cse6 (not (= 1 ~t1_i~0))) (.cse7 (= 0 |old(~E_2~0)|)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (< ~E_1~0 2)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse33 (< |old(~token~0)| ~local~0)) (.cse24 (= |old(~t1_pc~0)| 1)) (.cse25 (not (= 1 ~t3_pc~0))) (.cse10 (< |old(~t3_st~0)| 2)) (.cse11 (= 1 ~E_M~0)) (.cse26 (not .cse30)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= 0 |old(~m_st~0)|))) (.cse14 (not (= ~m_i~0 1))) (.cse16 (< ~E_3~0 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse24 .cse25 .cse10 .cse11 .cse26 .cse12 .cse14 .cse16 .cse27 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse24 .cse29 .cse11 .cse26 .cse12 .cse14 .cse16 .cse27 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse30 .cse5 .cse31 .cse6 .cse7 .cse8 .cse9 .cse29 .cse11 .cse12 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse33 .cse24 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse25 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse33 .cse24 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse32 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse33 .cse25 .cse10 .cse11 .cse26 .cse12 .cse14 .cse16 .cse27 .cse18 .cse19 .cse35) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse29 .cse11 .cse12 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19) (or .cse9 .cse0 .cse1 .cse2 .cse22 .cse10 .cse3 .cse4 .cse11 .cse26 .cse12 .cse14 .cse16 .cse5 .cse27 .cse6 .cse28 .cse17 .cse18 .cse19 .cse7 .cse8) (or .cse0 .cse1 .cse32 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse35 .cse9 .cse23 .cse33 .cse29 .cse11 .cse26 .cse12 .cse14 .cse16 .cse27 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse31 .cse2 .cse22 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse34 .cse11 .cse12 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse20 .cse4 .cse11 .cse26 .cse12 .cse13 .cse14 .cse16 .cse5 .cse6 .cse17 .cse18 .cse19 .cse7 .cse8 .cse21) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse33 .cse24 .cse29 .cse11 .cse26 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse33 .cse24 .cse25 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19 .cse21)))) [2018-11-10 02:10:54,766 INFO L421 ceAbstractionStarter]: At program point L115(lines 86 121) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0)) (.cse29 (<= 2 ~t3_st~0)) (.cse35 (= 1 ~t2_pc~0)) (.cse37 (<= 2 ~m_st~0)) (.cse31 (= 0 ~t2_st~0)) (.cse26 (= ~m_st~0 0)) (.cse38 (= ~t1_pc~0 1)) (.cse46 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse27 (not (= ~E_2~0 1))) (.cse28 (not (= ~E_2~0 0))) (.cse30 (not (= 0 ~t1_st~0))) (.cse47 (= ~token~0 |old(~token~0)|)) (.cse39 (= |old(~t3_st~0)| ~t3_st~0))) (let ((.cse14 (and .cse26 .cse38 .cse46 .cse27 .cse28 .cse30 .cse47 .cse39)) (.cse42 (and .cse26 .cse38 .cse27 .cse28 .cse30 .cse47 .cse31 .cse39)) (.cse44 (and .cse38 .cse37 .cse46 .cse27 .cse28 .cse30 .cse39)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse36 (not (= 1 ~t3_pc~0))) (.cse43 (and .cse38 .cse37 .cse27 (<= ~token~0 (+ |old(~token~0)| 1)) .cse28 .cse30 .cse31 .cse39 (<= (+ ~local~0 1) ~token~0))) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse41 (and .cse37 .cse38 .cse46 .cse27 .cse28 .cse30 .cse39)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse12 (< |old(~token~0)| ~local~0)) (.cse15 (not (= 0 |old(~t3_st~0)|))) (.cse17 (not .cse35)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse34 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_2~0)|)) (.cse7 (not (= 1 ~t1_i~0))) (.cse8 (= 0 |old(~E_2~0)|)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse45 (and .cse37 .cse27 .cse28 .cse29 .cse30)) (.cse10 (< ~E_1~0 2)) (.cse32 (< |old(~t3_st~0)| 2)) (.cse16 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse21 (< ~E_3~0 2)) (.cse40 (not .cse25)) (.cse22 (< 0 ~t3_pc~0)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse16 .cse18 .cse19 .cse20 .cse33 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse34 .cse4 .cse5 .cse35 .cse6 .cse7 .cse8 .cse9 .cse10 .cse36 .cse32 .cse16 (and .cse37 .cse38 .cse27 .cse28 .cse30 .cse31 .cse39) .cse18 .cse20 .cse33 .cse21 .cse40 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse34 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse41 .cse20 .cse21 .cse40 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse35 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse42 .cse20 .cse33 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse34 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse16 .cse18 .cse20 .cse33 .cse21 .cse40 .cse22 .cse23 .cse24 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse34 .cse4 .cse5 .cse43 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse32 .cse16 .cse17 .cse18 .cse20 .cse21 .cse40 .cse23 .cse24 .cse44) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse36 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse10 .cse0 .cse45 .cse1 .cse3 .cse34 .cse32 .cse4 .cse5 .cse16 .cse17 .cse18 .cse20 .cse21 .cse6 .cse40 .cse7 .cse22 .cse23 .cse24 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse35 .cse6 .cse7 .cse42 .cse8 .cse9 .cse10 .cse12 .cse13 .cse36 .cse32 .cse16 .cse18 .cse19 .cse20 .cse33 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse34 .cse4 .cse5 .cse44 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse36 .cse32 .cse16 .cse17 .cse18 .cse20 .cse21 .cse40 .cse23 .cse24) (or (and .cse38 .cse37 .cse27 .cse28 .cse30 .cse31 .cse39) .cse0 .cse1 .cse3 .cse34 .cse4 .cse5 .cse35 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse18 .cse20 .cse33 .cse21 .cse40 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse43 .cse2 .cse3 .cse34 .cse4 .cse5 .cse6 .cse41 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse40 .cse22 .cse23 .cse24) (or .cse10 .cse0 .cse1 (and .cse26 .cse27 .cse28 .cse29 .cse30) .cse3 .cse32 .cse4 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse6 .cse7 .cse22 .cse23 .cse24 .cse8 .cse9 .cse25) (or .cse0 .cse1 .cse3 .cse34 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse45 .cse10 .cse32 .cse16 .cse18 .cse20 .cse33 .cse21 .cse40 .cse22 .cse23 .cse24)))) [2018-11-10 02:10:54,766 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 86 121) no Hoare annotation was computed. [2018-11-10 02:10:54,767 INFO L421 ceAbstractionStarter]: At program point L111(line 111) the Hoare annotation is: (let ((.cse33 (= 1 ~t2_pc~0)) (.cse31 (= 1 ~m_pc~0)) (.cse38 (= 0 ~t2_st~0)) (.cse39 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (not (= ~E_2~0 0))) (.cse40 (= |old(~t3_st~0)| ~t3_st~0)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse36 (and .cse39 .cse3 (= ~t2_st~0 |old(~t2_st~0)|) (<= ~token~0 (+ |old(~token~0)| 1)) .cse4 .cse40 .cse6 (<= (+ ~local~0 1) ~token~0))) (.cse37 (and .cse39 .cse3 .cse4 .cse38 .cse40 .cse6)) (.cse30 (= ~m_st~0 0)) (.cse28 (not (= 0 |old(~t3_st~0)|))) (.cse8 (< |old(~m_st~0)| 2)) (.cse5 (<= 2 ~t3_st~0)) (.cse35 (not (= 0 |old(~t2_st~0)|))) (.cse18 (not .cse31)) (.cse20 (< 0 ~t3_pc~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse32 (< ~local~0 |old(~token~0)|)) (.cse7 (= ~T3_E~0 0)) (.cse10 (= ~T2_E~0 0)) (.cse11 (= 1 ~M_E~0)) (.cse17 (= 1 |old(~E_2~0)|)) (.cse19 (not (= 1 ~t1_i~0))) (.cse23 (= 0 |old(~E_2~0)|)) (.cse24 (= |old(~t1_st~0)| 0)) (.cse0 (< ~E_1~0 2)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse34 (< |old(~token~0)| ~local~0)) (.cse26 (= |old(~t1_pc~0)| 1)) (.cse27 (not (= 1 ~t3_pc~0))) (.cse9 (< |old(~t3_st~0)| 2)) (.cse12 (= 1 ~E_M~0)) (.cse13 (not .cse33)) (.cse14 (= ~T1_E~0 1)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse15 (not (= ~m_i~0 1))) (.cse16 (< ~E_3~0 2)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse25 .cse26 .cse27 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22) (or .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse25 .cse26 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 (and .cse30 .cse4 .cse5 .cse6) .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31) (or .cse1 .cse2 .cse32 .cse7 .cse10 .cse11 .cse33 .cse17 .cse19 .cse23 .cse24 .cse0 .cse34 .cse26 .cse28 .cse12 .cse14 .cse29 .cse15 .cse35 .cse16 .cse20 .cse21 .cse22 .cse31) (or .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse33 .cse17 .cse19 .cse23 .cse24 .cse0 .cse26 .cse27 .cse9 .cse12 .cse14 .cse15 .cse35 .cse16 .cse18 .cse21 .cse22) (or .cse1 .cse2 .cse32 .cse7 .cse8 .cse10 .cse36 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse25 .cse34 .cse27 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22) (or .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse33 .cse17 .cse19 .cse23 .cse24 .cse37 .cse0 .cse28 .cse12 .cse14 .cse15 .cse35 .cse16 .cse18 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse32 .cse7 .cse8 .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse25 .cse36 .cse34 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse32 .cse7 .cse10 .cse11 .cse33 .cse17 .cse19 .cse23 .cse24 .cse0 .cse34 .cse26 .cse27 .cse9 .cse12 .cse14 .cse29 .cse15 .cse35 .cse16 .cse21 .cse22 .cse31) (or .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse33 .cse17 .cse19 .cse23 .cse24 .cse0 .cse26 .cse28 .cse12 .cse14 .cse15 .cse35 .cse16 .cse18 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse33 .cse17 .cse19 .cse23 .cse24 .cse37 .cse0 .cse27 .cse9 .cse12 .cse14 .cse15 .cse35 .cse16 .cse18 .cse21 .cse22) (or .cse1 (and .cse30 .cse4 .cse5 .cse38 .cse6) .cse2 .cse7 .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse9 .cse12 .cse14 .cse29 .cse15 .cse35 .cse16 .cse20 .cse21 .cse22 .cse31) (or .cse1 .cse2 .cse32 .cse7 .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse25 .cse34 .cse26 .cse28 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse20 .cse21 .cse22 .cse31) (or .cse1 .cse2 .cse7 .cse8 (and .cse3 .cse4 .cse5 .cse38 .cse6) .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse9 .cse12 .cse14 .cse15 .cse35 .cse16 .cse18 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse32 .cse7 .cse10 .cse11 .cse17 .cse19 .cse23 .cse24 .cse0 .cse25 .cse34 .cse26 .cse27 .cse9 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse21 .cse22 .cse31)))) [2018-11-10 02:10:54,767 INFO L425 ceAbstractionStarter]: For program point L111-1(line 111) no Hoare annotation was computed. [2018-11-10 02:10:54,767 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 114) no Hoare annotation was computed. [2018-11-10 02:10:54,768 INFO L421 ceAbstractionStarter]: At program point L101-2(lines 89 120) the Hoare annotation is: (let ((.cse46 (= 0 ~t1_st~0)) (.cse59 (= ~m_st~0 0)) (.cse43 (not (= ~E_2~0 1))) (.cse44 (not (= ~E_2~0 0))) (.cse47 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse57 (and .cse59 .cse43 .cse44 .cse47)) (.cse56 (and .cse59 .cse43 .cse44 .cse46)) (.cse51 (= ~t1_pc~0 1)) (.cse42 (<= 2 ~m_st~0)) (.cse39 (= 0 ~t2_st~0))) (let ((.cse41 (and .cse42 .cse43 .cse44 .cse39 .cse47)) (.cse40 (and .cse42 .cse43 .cse44 .cse46 .cse39)) (.cse32 (and .cse42 .cse43 .cse44 .cse47)) (.cse31 (and .cse42 .cse43 .cse44 .cse46)) (.cse45 (<= 2 ~t3_st~0)) (.cse58 (= ~m_i~0 1)) (.cse6 (= 1 ~t2_pc~0)) (.cse25 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T3_E~0 0)) (.cse18 (= ~T1_E~0 1)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse52 (not .cse51)) (.cse53 (<= ~token~0 ~local~0)) (.cse55 (or .cse57 .cse56)) (.cse33 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse54 (<= ~local~0 ~token~0)) (.cse34 (= |old(~t3_st~0)| ~t3_st~0))) (let ((.cse8 (and .cse52 .cse53 .cse55 .cse33 .cse54 .cse34)) (.cse37 (and (and (<= 2 ~t2_st~0) (let ((.cse60 (<= 2 ~E_3~0)) (.cse61 (not .cse4)) (.cse62 (not .cse1)) (.cse63 (not (= ~E_M~0 0))) (.cse64 (not (= ~M_E~0 1))) (.cse65 (= ~t2_i~0 1)) (.cse66 (<= 2 ~E_1~0)) (.cse67 (not (= ~E_M~0 1))) (.cse68 (not .cse18)) (.cse69 (not .cse3)) (.cse70 (not .cse0)) (.cse71 (<= ~t3_pc~0 0))) (or (and .cse60 .cse61 .cse62 .cse42 .cse58 .cse63 .cse43 .cse64 .cse65 .cse66 .cse44 .cse67 .cse68 .cse6 .cse46 .cse69 .cse70 .cse71 .cse25) (and .cse60 .cse61 .cse62 .cse42 .cse58 .cse63 .cse43 .cse64 .cse65 .cse66 .cse44 .cse67 .cse68 .cse6 .cse69 .cse70 .cse71 .cse47 .cse25))) (= ~t1_i~0 1) .cse33) (= 0 ~t3_st~0) .cse34)) (.cse27 (or (and .cse59 .cse43 .cse44 .cse45 .cse46) (and .cse59 .cse43 .cse44 .cse45 .cse47))) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse38 (and (and (or .cse32 .cse31) .cse33) .cse34)) (.cse29 (< |old(~m_st~0)| 2)) (.cse49 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse50 (<= (+ ~local~0 1) ~token~0)) (.cse48 (or .cse41 .cse40)) (.cse35 (not .cse25)) (.cse36 (not (= 0 |old(~t3_st~0)|))) (.cse28 (< 0 ~t3_pc~0)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 |old(~E_2~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 |old(~E_2~0)|)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse12 (< ~E_1~0 2)) (.cse30 (< |old(~t2_st~0)| 2)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse14 (= |old(~t1_pc~0)| 1)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse16 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse26 (not .cse6)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse20 (not .cse58)) (.cse22 (< ~E_3~0 2)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse12 .cse0 .cse1 .cse3 .cse16 .cse4 .cse5 .cse17 .cse26 .cse18 .cse19 .cse20 .cse22 .cse7 .cse9 .cse27 .cse28 .cse23 .cse24 .cse10 .cse11 .cse25) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse20 .cse22 (and (and (or .cse31 .cse32) .cse33) .cse34) .cse35 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse36 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse28 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse36 .cse17 .cse26 .cse18 .cse20 .cse22 .cse35 .cse28 .cse23 .cse24 .cse37) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse35 .cse38 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse39 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse36 .cse17 .cse18 (and (or .cse40 .cse41) .cse34) .cse20 .cse21 .cse22 .cse35 .cse28 .cse23 .cse24) (or .cse12 .cse0 .cse1 .cse3 .cse29 .cse16 .cse4 .cse5 .cse17 .cse26 .cse18 .cse20 .cse22 .cse7 .cse35 (or (and .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse42 .cse43 .cse44 .cse45 .cse47)) .cse9 .cse28 .cse23 .cse24 .cse10 .cse11) (or .cse0 .cse1 (and .cse48 .cse49 .cse50 .cse51 .cse34) .cse2 .cse3 .cse29 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse36 .cse17 .cse26 .cse18 .cse20 .cse22 .cse35 .cse28 .cse23 .cse24 .cse37) (or .cse0 (or (and .cse42 .cse43 .cse44 .cse45 .cse39 .cse47) (and .cse42 .cse43 .cse44 .cse45 .cse46 .cse39)) .cse1 .cse3 .cse29 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse35 .cse28 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28 .cse23 .cse24 .cse25) (or .cse38 .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 (and .cse49 .cse50 .cse51 .cse48 .cse34) .cse30 .cse13 .cse15 .cse16 .cse17 .cse26 .cse18 .cse20 .cse22 .cse35 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 (and .cse52 .cse53 .cse33 .cse54 .cse55 .cse34) .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse36 .cse17 .cse26 .cse18 .cse19 .cse20 .cse22 .cse28 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20 .cse22 (and .cse52 (or .cse56 .cse57) .cse53 .cse33 .cse54 .cse34) .cse23 .cse24 .cse25)))))) [2018-11-10 02:10:54,768 INFO L421 ceAbstractionStarter]: At program point transmit3ENTRY(lines 158 193) the Hoare annotation is: (let ((.cse7 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse38 (= ~t1_pc~0 1)) (.cse45 (= ~m_st~0 0)) (.cse41 (= 1 ~m_pc~0)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse33 (= ~token~0 |old(~token~0)|)) (.cse30 (<= 2 ~m_st~0)) (.cse32 (= |old(~E_M~0)| ~E_M~0)) (.cse46 (= 0 ~t2_st~0)) (.cse34 (= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (<= ~t3_pc~0 0))) (let ((.cse3 (and .cse30 .cse32 .cse46 .cse34 .cse35 .cse36)) (.cse37 (and .cse30 .cse32 .cse33 .cse46 .cse34 .cse35 .cse36)) (.cse4 (< |old(~m_st~0)| 2)) (.cse24 (and .cse30 .cse31 .cse32 .cse34 .cse35 .cse36)) (.cse20 (not .cse41)) (.cse39 (and .cse45 .cse32 .cse33 .cse46 .cse34 .cse35 .cse36)) (.cse18 (not (= 0 |old(~t2_st~0)|))) (.cse13 (not .cse38)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse27 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse28 (not .cse11)) (.cse8 (= 1 ~E_2~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse44 (and .cse45 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)) (.cse12 (< ~E_1~0 2)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse14 (= 0 |old(~t3_st~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse26 (not .cse7)) (.cse16 (= ~T1_E~0 1)) (.cse40 (not (= 0 |old(~m_st~0)|))) (.cse17 (not (= ~m_i~0 1))) (.cse19 (< ~E_3~0 2)) (.cse21 (< 0 |old(~t3_pc~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse25 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse12 .cse25 .cse29 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse37 .cse9 .cse10 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse28 .cse7 .cse8 .cse3 .cse9 .cse10 .cse12 .cse38 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse39 .cse1 .cse27 .cse2 .cse5 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse12 .cse29 .cse38 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse41) (let ((.cse42 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse42) .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse42 |old(~token~0)|) .cse21 .cse22 .cse23)) (let ((.cse43 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse4 .cse5 (and (= 1 ~t3_pc~0) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 (< .cse43 |old(~token~0)|) .cse13 (not (= 1 |old(~t3_pc~0)|)) .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23 (< |old(~token~0)| .cse43))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse28 .cse8 .cse24 .cse9 .cse10 .cse12 .cse25 .cse38 .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse2 .cse39 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse41) (or .cse0 .cse1 .cse27 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse29 .cse13 .cse14 .cse15 .cse26 .cse16 .cse40 .cse17 .cse19 .cse44 .cse21 .cse22 .cse23 .cse41) (or .cse0 .cse1 .cse27 .cse2 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse44 .cse12 .cse25 .cse29 .cse38 .cse14 .cse15 .cse26 .cse16 .cse40 .cse17 .cse19 .cse21 .cse22 .cse23 .cse41)))) [2018-11-10 02:10:54,768 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-10 02:10:54,769 INFO L421 ceAbstractionStarter]: At program point L166(lines 161 192) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse27 (= ~t1_pc~0 1)) (.cse10 (= |old(~t1_st~0)| 0))) (let ((.cse26 (not .cse10)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse25 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_2~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 ~E_2~0)) (.cse11 (< ~E_1~0 2)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse12 (< |old(~token~0)| ~local~0)) (.cse13 (not .cse27)) (.cse14 (= 0 |old(~t3_st~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse30 (not .cse6)) (.cse16 (= ~T1_E~0 1)) (.cse18 (not (= ~m_i~0 1))) (.cse20 (< ~E_3~0 2)) (.cse28 (not .cse24)) (.cse21 (< 0 |old(~t3_pc~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse11 .cse27 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse8 .cse9 .cse11 .cse29 .cse27 .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse27 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 (< |old(~token~0)| .cse31) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 (< .cse31 |old(~token~0)|) .cse21 .cse22 .cse23)) (let ((.cse32 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse25 .cse4 (and (= 1 ~t3_pc~0) (<= 2 ~m_st~0) (= ~t2_st~0 |old(~t2_st~0)|) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0)) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 (< .cse32 |old(~token~0)|) .cse13 (not (= 1 |old(~t3_pc~0)|)) .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse22 .cse23 (< |old(~token~0)| .cse32))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23)))) [2018-11-10 02:10:54,769 INFO L421 ceAbstractionStarter]: At program point L187(lines 158 193) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse13 (= ~t1_pc~0 1)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse42 (= ~m_st~0 0)) (.cse38 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse47 (= ~token~0 |old(~token~0)|)) (.cse35 (= 1 ~t3_pc~0)) (.cse36 (<= 2 ~m_st~0)) (.cse46 (= |old(~E_M~0)| ~E_M~0)) (.cse40 (<= 2 ~t3_st~0)) (.cse48 (= 0 ~t2_st~0)) (.cse41 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse0 (and .cse35 .cse36 .cse46 .cse40 .cse48 .cse41)) (.cse27 (and .cse35 .cse42 .cse38 .cse46 .cse40 .cse47 .cse41)) (.cse34 (and .cse35 .cse36 .cse46 .cse40 .cse47 .cse48 .cse41)) (.cse45 (and .cse35 .cse42 .cse46 .cse40 .cse47 .cse48 .cse41)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse18 (not (= 0 |old(~t2_st~0)|))) (.cse44 (and .cse35 .cse36 .cse38 .cse46 .cse40 .cse41)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not .cse31)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse12 (< ~E_1~0 2)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse26 (< |old(~token~0)| ~local~0)) (.cse32 (not .cse13)) (.cse14 (= 0 |old(~t3_st~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse28 (not .cse8)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse19 (< ~E_3~0 2)) (.cse20 (not .cse30)) (.cse21 (< 0 |old(~t3_pc~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse26 .cse27 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse17 .cse19 .cse21 .cse22 .cse23 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse0 .cse32 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse33 (+ ~local~0 1))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse33) .cse9 .cse10 .cse11 .cse31 .cse34 .cse12 .cse32 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse33 |old(~token~0)|) .cse21 .cse22 .cse23)) (let ((.cse37 (not (= ~E_M~0 0))) (.cse39 (not (= ~E_M~0 1))) (.cse43 (+ ~local~0 2))) (or .cse1 .cse2 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse31 (and .cse35 .cse42 .cse37 .cse38 .cse39 .cse40 (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) .cse41) .cse12 .cse25 (< .cse43 |old(~token~0)|) .cse32 (not (= 1 |old(~t3_pc~0)|)) .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23 (< |old(~token~0)| .cse43))) (or .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse9 .cse10 .cse11 .cse31 .cse12 .cse25 .cse26 .cse32 .cse14 .cse15 .cse28 .cse16 .cse29 .cse27 .cse17 .cse19 .cse21 .cse22 .cse23 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse31 .cse12 .cse25 .cse32 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse44 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse45 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30) (or .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse32 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse26 .cse32 .cse14 .cse45 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse44 .cse25 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse24 (and .cse35 .cse36 .cse38 .cse46 .cse40 .cse47 .cse41) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse26 .cse32 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2018-11-10 02:10:54,770 INFO L421 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse27 (= ~t1_pc~0 1)) (.cse10 (= |old(~t1_st~0)| 0))) (let ((.cse26 (not .cse10)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse25 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_2~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 ~E_2~0)) (.cse11 (< ~E_1~0 2)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse12 (< |old(~token~0)| ~local~0)) (.cse13 (not .cse27)) (.cse14 (= 0 |old(~t3_st~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse30 (not .cse6)) (.cse16 (= ~T1_E~0 1)) (.cse18 (not (= ~m_i~0 1))) (.cse20 (< ~E_3~0 2)) (.cse28 (not .cse24)) (.cse21 (< 0 |old(~t3_pc~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse11 .cse27 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse8 .cse9 .cse11 .cse29 .cse27 .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse27 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 (< |old(~token~0)| .cse31) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 (< .cse31 |old(~token~0)|) .cse21 .cse22 .cse23)) (let ((.cse32 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse25 (and (= 1 ~t3_pc~0) (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (= ~t2_st~0 |old(~t2_st~0)|) (<= ~token~0 (+ ~local~0 3)) (= |old(~t3_st~0)| ~t3_st~0) (<= (+ |old(~token~0)| 1) ~token~0) (= |old(~t1_st~0)| ~t1_st~0)) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 (< .cse32 |old(~token~0)|) .cse13 (not (= 1 |old(~t3_pc~0)|)) .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse22 .cse23 (< |old(~token~0)| .cse32))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse18 .cse20 .cse28 .cse21 .cse22 .cse23)))) [2018-11-10 02:10:54,770 INFO L425 ceAbstractionStarter]: For program point L183-1(line 183) no Hoare annotation was computed. [2018-11-10 02:10:54,770 INFO L425 ceAbstractionStarter]: For program point transmit3EXIT(lines 158 193) no Hoare annotation was computed. [2018-11-10 02:10:54,770 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 186) no Hoare annotation was computed. [2018-11-10 02:10:54,771 INFO L421 ceAbstractionStarter]: At program point L173-2(lines 161 192) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse44 (= 1 ~t3_pc~0)) (.cse60 (not (= ~t2_pc~0 1))) (.cse54 (not .cse4)) (.cse41 (<= 2 ~m_st~0)) (.cse42 (= 0 ~t2_st~0)) (.cse55 (not .cse2)) (.cse56 (not .cse0)) (.cse43 (<= ~t3_pc~0 0))) (let ((.cse52 (or (and .cse60 .cse54 .cse44 .cse41 .cse42 .cse55 .cse56) (and .cse60 .cse54 .cse41 .cse42 .cse55 .cse56 .cse43))) (.cse11 (= |old(~t1_st~0)| 0)) (.cse28 (= ~t1_pc~0 1)) (.cse49 (not (= ~E_M~0 0))) (.cse48 (= ~m_st~0 0)) (.cse34 (<= ~token~0 ~local~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse32 (= |old(~t3_st~0)| ~t3_st~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse53 (= ~m_i~0 1)) (.cse40 (= 1 ~m_pc~0)) (.cse57 (not (= ~E_3~0 0))) (.cse59 (not (= ~E_2~0 0))) (.cse33 (= |old(~t1_st~0)| ~t1_st~0)) (.cse37 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse24 (and .cse31 .cse32 (or (and .cse7 .cse54 .cse44 .cse41 .cse53 .cse55 .cse56 .cse40 .cse57 .cse59) (and .cse7 .cse54 .cse41 .cse53 .cse55 .cse56 .cse43 .cse40 .cse57 .cse59)) .cse33 .cse37)) (.cse38 (and (or (and .cse7 .cse54 .cse48 .cse53 .cse55 .cse56 .cse43 .cse57 .cse59) (and .cse7 .cse54 .cse44 .cse48 .cse53 .cse55 .cse56 .cse57 .cse59)) .cse31 .cse32 .cse33 .cse34 .cse36 .cse37)) (.cse46 (and .cse32 (or (and .cse60 .cse54 .cse48 .cse42 .cse55 .cse56 .cse43 .cse59) (and .cse60 .cse54 .cse44 .cse48 .cse42 .cse55 .cse56 .cse59)) .cse33 .cse34 .cse36 .cse37)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse25 (< |old(~t2_st~0)| 2)) (.cse35 (let ((.cse58 (= ~t2_i~0 1))) (or (and .cse7 .cse54 .cse44 .cse41 .cse53 .cse49 .cse55 .cse56 .cse40 .cse57 .cse58 .cse59) (and .cse7 .cse54 .cse41 .cse53 .cse49 .cse55 .cse56 .cse43 .cse40 .cse57 .cse58 .cse59)))) (.cse26 (not .cse7)) (.cse29 (< ~local~0 |old(~token~0)|)) (.cse30 (< |old(~token~0)| ~local~0)) (.cse13 (not .cse28)) (.cse1 (= ~T2_E~0 1)) (.cse3 (< |old(~m_st~0)| 2)) (.cse6 (= 1 ~M_E~0)) (.cse27 (not .cse11)) (.cse8 (= 1 ~E_2~0)) (.cse5 (and .cse32 .cse52 .cse33 .cse37)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_2~0)) (.cse12 (< ~E_1~0 2)) (.cse14 (= 0 |old(~t3_st~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not .cse53)) (.cse18 (not (= 0 |old(~t2_st~0)|))) (.cse19 (< ~E_3~0 2)) (.cse20 (not .cse40)) (.cse21 (< 0 |old(~t3_pc~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse9 .cse10 .cse12 .cse25 .cse28 .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse24 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse9 .cse10 .cse12 .cse25 .cse30 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)) (or .cse0 .cse1 .cse29 .cse2 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse30 .cse13 .cse14 .cse38 .cse15 .cse26 .cse16 .cse39 .cse17 .cse19 .cse21 .cse22 .cse23 .cse40) (or .cse0 .cse1 .cse29 .cse2 .cse4 .cse6 .cse27 .cse8 .cse9 .cse10 .cse12 .cse25 .cse30 .cse28 .cse14 .cse15 .cse26 .cse16 .cse39 .cse17 .cse19 .cse38 .cse21 .cse22 .cse23 .cse40) (let ((.cse45 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (and (= ~token~0 |old(~token~0)|) .cse32 .cse33 (or (and .cse41 .cse42 .cse43) (and .cse44 .cse41 .cse42)) .cse37) (< |old(~token~0)| .cse45) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse45 |old(~token~0)|) .cse21 .cse22 .cse23)) (or .cse0 .cse1 .cse46 .cse29 .cse2 .cse4 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse30 .cse28 .cse14 .cse15 .cse16 .cse39 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse40) (or .cse0 .cse1 .cse29 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse46 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse39 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse40) (let ((.cse50 (not (= ~E_M~0 1))) (.cse51 (+ ~local~0 2))) (or .cse0 (let ((.cse47 (+ |old(~token~0)| 1))) (and .cse31 .cse32 (<= .cse47 ~token~0) (<= ~token~0 .cse47) .cse33 (or (and .cse44 .cse48 .cse49) (and .cse48 .cse49 .cse43)) .cse50)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 (and .cse31 .cse32 .cse33 .cse35 .cse50) (< .cse51 |old(~token~0)|) .cse13 (not (= 1 |old(~t3_pc~0)|)) .cse14 .cse15 .cse26 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23 (< |old(~token~0)| .cse51))) (or .cse0 .cse1 (and .cse32 .cse52 .cse33 .cse34 .cse36 .cse37) .cse29 .cse2 .cse3 .cse4 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse27 .cse7 .cse8 .cse5 .cse9 .cse10 .cse12 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))))) [2018-11-10 02:10:54,771 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2018-11-10 02:10:54,771 INFO L421 ceAbstractionStarter]: At program point L151(lines 122 157) the Hoare annotation is: (let ((.cse43 (= 1 ~m_pc~0)) (.cse38 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_3~0)) (.cse41 (= ~m_st~0 0)) (.cse27 (= |old(~t1_st~0)| 0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse47 (= ~token~0 |old(~token~0)|)) (.cse46 (= |old(~t3_st~0)| ~t3_st~0)) (.cse32 (<= 2 ~t2_st~0)) (.cse48 (<= |old(~E_3~0)| ~E_3~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse5 (<= 2 ~t3_st~0)) (.cse6 (= 0 ~t1_st~0)) (.cse37 (and .cse3 .cse4 .cse47 .cse46 .cse32 .cse48 .cse16)) (.cse39 (and .cse3 .cse4 .cse46 .cse32 .cse48 .cse16)) (.cse44 (and .cse48 .cse16)) (.cse34 (not .cse27)) (.cse33 (< ~local~0 |old(~token~0)|)) (.cse35 (= 1 |old(~t2_pc~0)|)) (.cse36 (< |old(~token~0)| ~local~0)) (.cse29 (not (= 1 ~t3_pc~0))) (.cse15 (< |old(~t3_st~0)| 2)) (.cse45 (and .cse41 .cse4 .cse47 .cse46 .cse32 .cse48 .cse16)) (.cse42 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse7 (= ~T3_E~0 0)) (.cse25 (= 0 |old(~t2_st~0)|)) (.cse8 (< |old(~m_st~0)| 2)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 ~E_2~0)) (.cse30 (and .cse2 .cse3 .cse4 .cse46 .cse32 .cse16)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_2~0)) (.cse14 (< ~E_1~0 2)) (.cse28 (not .cse38)) (.cse40 (not (= 0 |old(~t3_st~0)|))) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (< |old(~E_3~0)| 2)) (.cse21 (not .cse43)) (.cse22 (< 0 ~t3_pc~0)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse2 .cse3 .cse4 .cse5 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse25 .cse8 .cse9 .cse10 (< |old(~token~0)| .cse26) .cse11 .cse12 .cse13 .cse27 .cse14 .cse28 .cse29 .cse15 .cse17 .cse30 (let ((.cse31 (+ ~local~0 2))) (and .cse2 .cse3 (<= ~token~0 .cse31) .cse4 (= 0 ~t3_st~0) .cse32 .cse16 (<= .cse31 ~token~0))) .cse18 .cse19 .cse20 .cse21 (< .cse26 |old(~token~0)|) .cse23 .cse24)) (or .cse0 .cse1 .cse33 .cse7 .cse25 .cse8 .cse9 .cse10 .cse34 .cse35 .cse11 .cse12 .cse13 .cse14 .cse36 .cse28 .cse37 .cse29 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (or .cse0 .cse1 .cse7 .cse25 .cse8 .cse9 .cse10 .cse34 .cse35 .cse11 .cse12 .cse13 .cse14 .cse38 .cse29 .cse15 .cse17 .cse18 .cse39 .cse19 .cse20 .cse21 .cse23 .cse24) (or .cse0 .cse1 .cse7 .cse25 .cse8 .cse9 .cse10 .cse34 .cse35 .cse11 .cse39 .cse12 .cse13 .cse14 .cse38 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse39 .cse0 .cse1 .cse7 .cse25 .cse8 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse27 .cse14 .cse28 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse7 .cse9 .cse10 (and .cse2 .cse41 .cse4 .cse5 .cse16) .cse11 .cse12 .cse13 (and .cse2 .cse41 .cse4 .cse5 .cse6) .cse14 .cse15 .cse17 .cse18 .cse42 .cse19 .cse20 .cse22 .cse23 .cse24 .cse43) (or .cse14 .cse0 .cse1 .cse7 .cse15 .cse9 .cse44 .cse10 .cse17 .cse18 .cse42 .cse19 .cse35 .cse20 .cse11 .cse12 .cse22 .cse23 .cse24 .cse13 .cse43) (or .cse45 .cse0 .cse1 .cse33 .cse7 .cse25 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse27 .cse14 .cse36 .cse28 .cse40 .cse17 .cse18 .cse42 .cse19 .cse20 .cse22 .cse23 .cse24 .cse43) (or .cse0 .cse1 .cse33 .cse7 .cse25 .cse8 .cse9 .cse10 .cse34 .cse35 .cse11 .cse37 .cse12 .cse13 .cse14 .cse36 .cse28 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse7 .cse25 .cse8 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse27 .cse14 .cse28 .cse29 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse39) (or .cse14 .cse0 .cse1 .cse7 .cse8 .cse15 .cse44 .cse9 .cse10 .cse17 .cse18 .cse19 .cse35 .cse20 .cse11 .cse21 .cse12 .cse22 .cse23 .cse24 .cse13) (or .cse0 .cse1 .cse33 .cse7 .cse25 .cse9 .cse10 .cse34 .cse35 .cse11 .cse12 .cse13 .cse14 .cse45 .cse36 .cse38 .cse29 .cse15 .cse17 .cse18 .cse42 .cse19 .cse20 .cse23 .cse24 .cse43) (or .cse0 .cse45 .cse1 .cse33 .cse7 .cse25 .cse9 .cse10 .cse34 .cse35 .cse11 .cse12 .cse13 .cse14 .cse36 .cse38 .cse40 .cse17 .cse18 .cse42 .cse19 .cse20 .cse22 .cse23 .cse24 .cse43) (or .cse0 .cse1 .cse33 .cse7 .cse25 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse27 .cse14 .cse36 .cse28 .cse29 .cse15 .cse45 .cse17 .cse18 .cse42 .cse19 .cse20 .cse23 .cse24 .cse43) (or .cse0 .cse1 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse27 .cse14 .cse28 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2018-11-10 02:10:54,772 INFO L421 ceAbstractionStarter]: At program point L147(line 147) the Hoare annotation is: (let ((.cse34 (= ~t1_pc~0 1)) (.cse36 (= 1 ~m_pc~0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse33 (not .cse16)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse9 (= |old(~t3_st~0)| ~t3_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse37 (<= 2 ~t3_st~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (not (= ~E_3~0 0))) (.cse4 (< |old(~m_st~0)| 2)) (.cse31 (not (= 1 ~t3_pc~0))) (.cse32 (< |old(~t3_st~0)| 2)) (.cse24 (not .cse36)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse12 (= 1 ~M_E~0)) (.cse29 (= 1 |old(~t2_pc~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 ~E_2~0)) (.cse17 (< ~E_1~0 2)) (.cse30 (< |old(~token~0)| ~local~0)) (.cse18 (not .cse34)) (.cse19 (not (= 0 |old(~t3_st~0)|))) (.cse20 (= 1 ~E_M~0)) (.cse21 (= ~T1_E~0 1)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse22 (not (= ~m_i~0 1))) (.cse23 (< |old(~E_3~0)| 2)) (.cse25 (< 0 ~t3_pc~0)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse12 .cse29 .cse13 .cse14 .cse15 .cse17 .cse30 .cse18 .cse31 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse12 .cse33 .cse29 .cse13 .cse14 .cse15 .cse17 .cse30 .cse34 .cse31 .cse32 .cse20 .cse21 .cse35 .cse22 .cse23 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse33 .cse29 .cse13 .cse14 .cse15 .cse17 .cse34 .cse31 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse12 .cse29 .cse13 .cse14 .cse15 .cse17 .cse30 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse17 .cse0 .cse1 .cse2 .cse4 .cse32 .cse5 .cse12 (and .cse6 .cse8 .cse37 .cse10 .cse11) .cse20 .cse21 .cse22 .cse23 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27 .cse15) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse31 .cse32 .cse20 .cse21 .cse35 .cse22 .cse23 .cse26 .cse27 .cse36) (or .cse17 .cse0 .cse1 .cse2 .cse4 .cse32 .cse5 .cse12 .cse20 .cse21 .cse22 .cse29 .cse23 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse33 .cse29 .cse13 .cse14 .cse15 .cse17 .cse34 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse17 .cse0 .cse1 .cse2 .cse32 .cse5 .cse12 .cse20 .cse21 .cse35 .cse22 .cse29 .cse23 .cse13 .cse14 .cse25 .cse26 .cse27 .cse15 .cse36) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse12 .cse33 .cse29 .cse13 .cse14 .cse15 .cse17 .cse30 .cse34 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse25 .cse26 .cse27 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (let ((.cse38 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 (< |old(~token~0)| .cse38) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse32 .cse20 .cse21 .cse22 .cse23 (let ((.cse39 (+ ~local~0 2))) (and .cse6 .cse7 (<= ~token~0 .cse39) .cse8 .cse9 .cse10 .cse11 (<= .cse39 ~token~0))) .cse24 (< .cse38 |old(~token~0)|) .cse26 .cse27)) (or .cse17 .cse0 .cse1 .cse2 (and (= ~m_st~0 0) .cse8 .cse37 .cse10 .cse11) .cse32 .cse5 .cse12 .cse20 .cse21 .cse35 .cse22 .cse23 .cse13 .cse14 .cse25 .cse26 .cse27 .cse15 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27) (or .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse25 .cse26 .cse27 .cse36)))) [2018-11-10 02:10:54,772 INFO L425 ceAbstractionStarter]: For program point L147-1(line 147) no Hoare annotation was computed. [2018-11-10 02:10:54,772 INFO L425 ceAbstractionStarter]: For program point transmit2EXIT(lines 122 157) no Hoare annotation was computed. [2018-11-10 02:10:54,772 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 150) no Hoare annotation was computed. [2018-11-10 02:10:54,772 INFO L421 ceAbstractionStarter]: At program point L137-2(lines 125 156) the Hoare annotation is: (let ((.cse5 (= ~T2_E~0 0)) (.cse45 (= ~m_i~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0))) (let ((.cse25 (= 1 ~m_pc~0)) (.cse35 (= |old(~t1_st~0)| 0)) (.cse15 (= ~t1_pc~0 1)) (.cse30 (<= 2 ~E_3~0)) (.cse31 (<= 2 ~m_st~0)) (.cse32 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse41 (and (not .cse5) (= ~m_st~0 0) .cse45 (not (= ~E_M~0 0)) (not .cse3) (not .cse0) (not (= ~E_3~0 0)) (not (= ~E_2~0 0)))) (.cse47 (= ~token~0 |old(~token~0)|)) (.cse46 (= |old(~t3_st~0)| ~t3_st~0)) (.cse26 (<= |old(~E_3~0)| ~E_3~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse38 (not (= 1 ~t3_pc~0))) (.cse10 (and .cse32 .cse41 .cse47 .cse46 .cse26 .cse28)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse36 (and .cse30 .cse31 .cse32 .cse46 .cse28)) (.cse43 (and .cse31 .cse32 .cse47 .cse46 .cse26 .cse28)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse37 (not .cse15)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse7 (not .cse35)) (.cse8 (= 1 |old(~t2_pc~0)|)) (.cse44 (and .cse31 .cse32 .cse46 .cse26 .cse28)) (.cse16 (not (= 0 |old(~t3_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse29 (< |old(~m_st~0)| 2)) (.cse6 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 ~E_2~0)) (.cse13 (< ~E_1~0 2)) (.cse27 (< |old(~t3_st~0)| 2)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse20 (not .cse45)) (.cse21 (< |old(~E_3~0)| 2)) (.cse39 (not .cse25)) (.cse40 (<= 2 ~t3_st~0)) (.cse42 (= 0 ~t1_st~0)) (.cse22 (< 0 ~t3_pc~0)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse13 .cse0 .cse1 .cse26 .cse3 .cse27 .cse5 .cse6 .cse17 .cse18 .cse19 .cse20 .cse8 .cse21 .cse9 .cse11 .cse22 .cse23 .cse24 .cse12 .cse25) (or .cse13 .cse0 .cse1 .cse3 .cse27 .cse5 .cse6 .cse17 .cse18 .cse19 .cse28 .cse20 .cse8 .cse21 .cse9 .cse11 .cse22 .cse23 .cse24 .cse12 .cse25) (let ((.cse34 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 (let ((.cse33 (+ ~local~0 2))) (and .cse30 .cse31 .cse32 (<= ~token~0 .cse33) (= 0 ~t3_st~0) .cse28 (<= .cse33 ~token~0))) (< |old(~token~0)| .cse34) .cse9 .cse11 .cse12 .cse35 .cse13 .cse36 .cse37 .cse38 .cse27 .cse17 .cse18 .cse20 .cse21 .cse39 (< .cse34 |old(~token~0)|) .cse23 .cse24)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse35 .cse13 .cse14 .cse37 .cse38 .cse27 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or (and .cse30 .cse40 .cse28 .cse41) .cse0 .cse1 .cse3 .cse5 .cse6 .cse9 .cse11 .cse12 .cse13 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse30 .cse40 .cse42 .cse41) .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse43 .cse11 .cse12 .cse13 .cse14 .cse37 .cse38 .cse27 .cse17 .cse18 .cse20 .cse21 .cse39 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse44 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse35 .cse13 .cse37 .cse38 .cse27 .cse17 .cse18 .cse20 .cse21 .cse39 .cse23 .cse24) (or .cse44 .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse35 .cse13 .cse37 .cse16 .cse17 .cse18 .cse20 .cse21 .cse39 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse38 .cse27 .cse17 .cse18 .cse20 .cse21 .cse39 .cse44 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse38 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse10 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse8 .cse9 .cse11 .cse12 .cse35 .cse13 .cse14 .cse37 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse13 .cse0 .cse1 .cse3 .cse29 .cse27 .cse5 (and .cse26 .cse28) .cse6 .cse17 .cse18 .cse20 .cse8 .cse21 .cse9 .cse39 .cse11 .cse22 .cse23 .cse24 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse9 .cse11 .cse12 .cse35 .cse13 .cse37 .cse16 .cse36 .cse17 .cse18 .cse20 .cse21 .cse39 .cse22 .cse23 .cse24) (or .cse0 .cse43 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse37 .cse16 .cse17 .cse18 .cse20 .cse21 .cse39 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse44 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse39 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse29 .cse5 .cse6 .cse9 .cse11 .cse12 .cse13 (and .cse30 .cse40 .cse31 .cse28) .cse27 .cse17 .cse18 .cse20 .cse21 .cse39 (and .cse30 .cse40 .cse31 .cse42) .cse22 .cse23 .cse24))))) [2018-11-10 02:10:54,773 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 133) no Hoare annotation was computed. [2018-11-10 02:10:54,773 INFO L421 ceAbstractionStarter]: At program point transmit2ENTRY(lines 122 157) the Hoare annotation is: (let ((.cse40 (= 1 ~m_pc~0)) (.cse28 (= 1 |old(~t2_pc~0)|)) (.cse42 (= ~t1_pc~0 1)) (.cse38 (= ~m_st~0 0)) (.cse33 (= |old(~t1_st~0)| 0)) (.cse37 (not (= ~t2_pc~0 1))) (.cse4 (<= 2 ~m_st~0)) (.cse35 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse45 (= ~token~0 |old(~token~0)|)) (.cse7 (= |old(~E_3~0)| ~E_3~0)) (.cse36 (= |old(~t3_st~0)| ~t3_st~0)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse32 (and .cse37 .cse4 .cse35 .cse45 .cse7 .cse36 .cse8)) (.cse6 (<= 2 ~t3_st~0)) (.cse27 (not .cse33)) (.cse41 (and .cse37 .cse38 .cse35 .cse45 .cse7 .cse36 .cse8)) (.cse25 (< ~local~0 |old(~token~0)|)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse43 (and .cse37 .cse4 .cse35 .cse7 .cse36 .cse8)) (.cse34 (not (= 0 |old(~t3_st~0)|))) (.cse21 (< 0 ~t3_pc~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse26 (= 0 |old(~t2_st~0)|)) (.cse9 (< |old(~m_st~0)| 2)) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 1 ~M_E~0)) (.cse18 (= 1 ~E_2~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse24 (= 0 ~E_2~0)) (.cse0 (< ~E_1~0 2)) (.cse30 (not .cse42)) (.cse5 (= 1 ~t2_pc~0)) (.cse31 (not (= 1 ~t3_pc~0))) (.cse10 (< |old(~t3_st~0)| 2)) (.cse13 (= 1 ~E_M~0)) (.cse14 (not .cse28)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= ~m_i~0 1))) (.cse17 (< |old(~E_3~0)| 2)) (.cse19 (not .cse40)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~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) (or .cse1 .cse2 .cse25 .cse3 .cse26 .cse9 .cse11 .cse12 .cse27 .cse28 .cse18 .cse20 .cse24 .cse0 .cse29 .cse30 .cse31 .cse10 .cse32 .cse13 .cse15 .cse16 .cse17 .cse19 .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse26 .cse9 .cse11 .cse12 .cse18 .cse20 .cse24 .cse33 .cse0 .cse30 .cse34 .cse13 .cse14 .cse15 (and .cse4 .cse35 .cse5 .cse7 .cse36 .cse8) .cse16 .cse17 .cse19 .cse21 .cse22 .cse23) (or .cse0 .cse1 (and .cse37 .cse38 .cse6 .cse7 .cse8) .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse39 .cse16 .cse28 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse40) (or .cse41 .cse1 .cse2 .cse25 .cse3 .cse26 .cse11 .cse12 .cse28 .cse18 .cse20 .cse24 .cse33 .cse0 .cse29 .cse30 .cse34 .cse13 .cse15 .cse39 .cse16 .cse17 .cse21 .cse22 .cse23 .cse40) (or .cse1 .cse2 .cse3 .cse26 .cse9 .cse11 .cse12 .cse27 .cse28 .cse18 .cse20 .cse24 .cse0 .cse42 .cse43 .cse31 .cse10 .cse13 .cse15 .cse16 .cse17 .cse19 .cse22 .cse23) (or .cse1 .cse2 .cse25 .cse3 .cse26 .cse9 .cse11 .cse12 .cse27 .cse28 .cse18 .cse20 .cse24 .cse0 .cse29 .cse30 .cse34 .cse13 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23 .cse32) (or .cse1 .cse2 .cse3 .cse26 .cse9 .cse11 .cse12 .cse27 .cse28 .cse18 .cse20 .cse24 .cse0 .cse43 .cse42 .cse34 .cse13 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse37 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 (and .cse38 .cse5 .cse6 .cse7 .cse8) .cse12 .cse13 .cse14 .cse15 .cse39 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse40) (or .cse1 .cse2 .cse25 .cse3 .cse26 .cse11 .cse12 .cse27 .cse28 .cse18 .cse20 .cse24 .cse0 .cse29 .cse42 .cse31 .cse10 .cse13 .cse15 .cse39 .cse41 .cse16 .cse17 .cse22 .cse23 .cse40) (or .cse1 .cse2 .cse25 .cse3 .cse26 .cse11 .cse12 .cse27 .cse28 .cse18 .cse20 .cse24 .cse0 .cse41 .cse29 .cse42 .cse34 .cse13 .cse15 .cse39 .cse16 .cse17 .cse21 .cse22 .cse23 .cse40) (or .cse1 .cse2 .cse3 .cse26 .cse9 .cse11 .cse12 .cse28 .cse18 .cse20 .cse24 .cse33 .cse0 .cse30 .cse31 .cse10 .cse43 .cse13 .cse15 .cse16 .cse17 .cse19 .cse22 .cse23) (or .cse41 .cse1 .cse2 .cse25 .cse3 .cse26 .cse11 .cse12 .cse28 .cse18 .cse20 .cse24 .cse33 .cse0 .cse29 .cse30 .cse31 .cse10 .cse13 .cse15 .cse39 .cse16 .cse17 .cse22 .cse23 .cse40) (or .cse1 .cse2 .cse3 .cse26 .cse9 .cse11 .cse12 .cse28 .cse18 .cse20 .cse24 .cse33 .cse43 .cse0 .cse30 .cse34 .cse13 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23) (let ((.cse44 (+ ~local~0 1))) (or .cse1 .cse2 .cse3 .cse26 .cse9 .cse11 .cse12 (< |old(~token~0)| .cse44) .cse18 .cse20 .cse24 .cse33 .cse0 .cse30 (and .cse4 .cse35 .cse5 .cse45 .cse7 .cse36 .cse8) .cse31 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (< .cse44 |old(~token~0)|) .cse22 .cse23))))) [2018-11-10 02:10:54,774 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-10 02:10:54,775 INFO L421 ceAbstractionStarter]: At program point L130(lines 125 156) the Hoare annotation is: (let ((.cse31 (= ~t1_pc~0 1)) (.cse33 (= 1 ~m_pc~0)) (.cse35 (= |old(~t1_st~0)| 0))) (let ((.cse30 (not .cse35)) (.cse24 (<= 2 ~m_st~0)) (.cse36 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse37 (= |old(~t3_st~0)| ~t3_st~0)) (.cse25 (= 1 ~t2_pc~0)) (.cse26 (<= 2 ~t3_st~0)) (.cse27 (= |old(~E_3~0)| ~E_3~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (< |old(~m_st~0)| 2)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse16 (< |old(~t3_st~0)| 2)) (.cse21 (not .cse33)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (= ~T3_E~0 0)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 |old(~t2_pc~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (= 0 ~E_2~0)) (.cse12 (< ~E_1~0 2)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse14 (not .cse31)) (.cse34 (not (= 0 |old(~t3_st~0)|))) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= ~m_i~0 1))) (.cse20 (< |old(~E_3~0)| 2)) (.cse29 (< 0 ~t3_pc~0)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse12 .cse0 .cse1 .cse3 (and .cse24 .cse25 .cse26 .cse27 .cse28) .cse5 .cse16 .cse6 .cse7 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse29 .cse22 .cse23 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse33) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse33) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse35 .cse12 .cse14 .cse34 .cse17 .cse18 (and .cse24 .cse36 .cse25 .cse27 .cse37 .cse28) .cse19 .cse20 .cse21 .cse29 .cse22 .cse23) (or .cse12 .cse0 .cse1 .cse3 .cse5 .cse16 .cse6 .cse7 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse21 .cse10 .cse29 .cse22 .cse23 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23) (or .cse12 .cse0 .cse1 .cse3 .cse16 .cse6 .cse7 .cse17 .cse18 .cse32 .cse19 .cse8 .cse20 .cse9 .cse10 .cse29 .cse22 .cse23 .cse11 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse34 .cse17 .cse18 .cse32 .cse19 .cse20 .cse29 .cse22 .cse23 .cse33) (let ((.cse38 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse38) .cse9 .cse10 .cse11 .cse35 .cse12 .cse14 (and .cse24 .cse36 .cse25 (= ~token~0 |old(~token~0)|) .cse27 .cse37 .cse28) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< .cse38 |old(~token~0)|) .cse22 .cse23)) (or .cse12 .cse0 .cse1 .cse3 .cse16 .cse6 (and (= ~m_st~0 0) .cse25 .cse26 .cse27 .cse28) .cse7 .cse17 .cse18 .cse32 .cse19 .cse20 .cse9 .cse10 .cse29 .cse22 .cse23 .cse11 .cse33) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse14 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse34 .cse17 .cse18 .cse32 .cse19 .cse20 .cse29 .cse22 .cse23 .cse33)))) [2018-11-10 02:10:54,776 INFO L425 ceAbstractionStarter]: For program point L718(line 718) no Hoare annotation was computed. [2018-11-10 02:10:54,778 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 712 723) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (not (= ~m_i~0 1)) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~m_i~0)| 1) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (= 1 |old(~t2_i~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 02:10:54,778 INFO L421 ceAbstractionStarter]: At program point L717(line 717) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (not (= ~m_i~0 1)) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~m_i~0)| 1) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (= 1 |old(~t2_i~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 02:10:54,778 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 712 723) no Hoare annotation was computed. [2018-11-10 02:10:54,779 INFO L421 ceAbstractionStarter]: At program point L717-1(line 717) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (= ~m_i~0 1) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_i~0 1) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= |old(~m_i~0)| 1) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (= 1 |old(~t2_i~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 02:10:54,779 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 712 723) no Hoare annotation was computed. [2018-11-10 02:10:54,779 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-10 02:10:54,780 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-10 02:10:54,780 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-10 02:10:54,780 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-10 02:10:54,780 INFO L428 ceAbstractionStarter]: At program point L640(line 640) the Hoare annotation is: true [2018-11-10 02:10:54,780 INFO L425 ceAbstractionStarter]: For program point L640-1(line 640) no Hoare annotation was computed. [2018-11-10 02:10:54,780 INFO L428 ceAbstractionStarter]: At program point L649(lines 638 651) the Hoare annotation is: true [2018-11-10 02:10:54,780 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 634 652) no Hoare annotation was computed. [2018-11-10 02:10:54,780 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 634 652) the Hoare annotation is: true [2018-11-10 02:10:54,780 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2018-11-10 02:10:54,781 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 634 652) no Hoare annotation was computed. [2018-11-10 02:10:54,781 INFO L421 ceAbstractionStarter]: At program point L247(lines 235 249) the Hoare annotation is: (let ((.cse36 (= 0 ~t2_st~0)) (.cse30 (= 1 ~m_pc~0)) (.cse42 (= 1 ~t2_pc~0))) (let ((.cse6 (= ~t1_pc~0 1)) (.cse39 (= 0 ~t3_st~0)) (.cse26 (< 0 ~t3_pc~0)) (.cse31 (= ~t1_st~0 0)) (.cse22 (not .cse42)) (.cse35 (not .cse30)) (.cse15 (= ~T1_E~0 0)) (.cse16 (= ~T2_E~0 1)) (.cse17 (= 0 ~E_3~0)) (.cse18 (= ~T3_E~0 0)) (.cse34 (not (= 1 ~t3_pc~0))) (.cse19 (= ~T2_E~0 0)) (.cse20 (= 1 ~M_E~0)) (.cse21 (= 1 ~E_M~0)) (.cse23 (= ~T1_E~0 1)) (.cse25 (not (= ~m_i~0 1))) (.cse43 (not .cse36)) (.cse44 (= 0 ~E_1~0)) (.cse27 (not (= 1 ~t2_i~0))) (.cse28 (= 0 ~E_M~0)) (.cse29 (= 0 ~E_2~0))) (let ((.cse40 (or .cse15 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21 .cse23 .cse25 .cse42 .cse43 .cse44 .cse27 .cse28 .cse29 .cse30)) (.cse9 (or .cse15 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse35 .cse44 .cse27 .cse28 .cse29)) (.cse32 (or .cse15 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse44 .cse27 .cse28 .cse29 .cse30)) (.cse10 (< ~local~0 ~token~0)) (.cse8 (not .cse31)) (.cse12 (< ~token~0 ~local~0)) (.cse1 (< ~t2_st~0 2)) (.cse5 (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse44 .cse26 .cse27 .cse28 .cse29 .cse30)) (.cse7 (not .cse39)) (.cse24 (not (= 0 ~m_st~0))) (.cse14 (< ~E_1~0 2)) (.cse33 (< ~m_st~0 2)) (.cse11 (not .cse6)) (.cse0 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse2 (< ~E_3~0 2)) (.cse3 (= 1 ~E_2~0)) (.cse41 (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse25 .cse42 .cse43 .cse44 .cse26 .cse27 .cse28 .cse29 .cse30)) (.cse4 (not (= 1 ~t1_i~0))) (.cse13 (< ~t3_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse9 .cse10 .cse0 .cse11 .cse12 .cse4 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse13 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse0 .cse4 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse1 .cse2 .cse3 .cse11 .cse4 .cse13 .cse31 .cse32 .cse0) (or .cse15 .cse16 .cse18 .cse33 .cse19 .cse3 .cse4 .cse29 .cse31 .cse0 .cse14 .cse1 .cse11 .cse34 .cse13 .cse21 .cse22 .cse23 .cse25 .cse2 .cse35 .cse27 .cse28) (or .cse2 .cse3 .cse0 .cse4 .cse5 .cse13) (let ((.cse37 (+ ~local~0 2))) (or .cse15 .cse16 .cse18 .cse36 .cse33 .cse19 .cse20 .cse3 .cse4 .cse29 .cse31 .cse14 .cse17 (< .cse37 ~token~0) .cse11 .cse34 .cse13 .cse0 .cse21 .cse22 .cse23 .cse25 .cse35 .cse27 .cse28 (< ~token~0 .cse37))) (or .cse15 .cse16 .cse18 .cse36 .cse33 .cse19 .cse20 .cse3 .cse0 .cse4 .cse29 .cse31 .cse14 .cse17 .cse11 .cse7 .cse21 .cse22 .cse23 .cse25 .cse35 .cse26 .cse27 .cse28) (or .cse1 .cse2 .cse3 .cse0 .cse4 .cse6 .cse13 .cse32 .cse8) (or .cse14 .cse15 .cse16 .cse18 .cse33 .cse13 .cse19 .cse0 .cse21 .cse22 .cse23 .cse25 .cse2 .cse3 .cse35 .cse4 .cse26 .cse27 .cse28 .cse29) (let ((.cse38 (+ ~local~0 3))) (or (not .cse21) .cse15 .cse16 .cse18 .cse19 .cse20 (< .cse38 ~token~0) .cse3 .cse4 .cse29 .cse31 .cse14 .cse0 .cse1 .cse11 .cse34 .cse39 .cse22 .cse23 .cse24 .cse25 .cse2 .cse35 .cse27 (< ~token~0 .cse38))) (or .cse2 .cse0 .cse3 .cse40 .cse4 .cse6 .cse13 .cse8) (or .cse2 .cse3 .cse11 .cse41 .cse4 .cse31 .cse7 .cse0) (or (or .cse14 .cse15 .cse16 .cse18 .cse33 .cse19 .cse20 .cse21 .cse23 .cse25 .cse42 .cse43 .cse2 .cse35 .cse26 .cse27 .cse28 .cse29) .cse11 .cse4 .cse0 .cse7) (or .cse2 .cse3 .cse40 .cse10 .cse11 .cse12 .cse4 .cse13 .cse0) (or .cse2 .cse3 .cse10 .cse0 .cse12 .cse41 .cse4 .cse7 .cse8) (or .cse2 .cse3 .cse40 .cse11 .cse4 .cse13 .cse31 .cse0) (or .cse1 .cse0 .cse2 .cse3 .cse9 .cse11 .cse4 .cse13 .cse31) (or .cse15 .cse16 .cse18 .cse33 .cse19 .cse20 .cse3 .cse4 .cse29 .cse31 .cse14 .cse1 .cse11 .cse34 .cse39 .cse22 .cse0 .cse23 .cse25 .cse2 .cse35 .cse27 .cse28) (or .cse1 .cse2 .cse3 .cse0 .cse10 .cse12 .cse4 .cse5 .cse7 .cse8) (or .cse2 .cse0 .cse3 .cse41 .cse4 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse4 .cse13 .cse32 .cse0) (or .cse14 .cse15 .cse16 .cse0 .cse18 .cse13 .cse19 .cse8 .cse21 .cse23 .cse24 .cse25 .cse42 .cse43 .cse2 .cse3 .cse4 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse15 .cse16 .cse10 .cse18 .cse19 .cse8 .cse42 .cse3 .cse0 .cse4 .cse29 .cse14 .cse12 .cse6 .cse7 .cse21 .cse23 .cse24 .cse25 .cse43 .cse2 .cse26 .cse27 .cse28 .cse30) (or .cse14 .cse15 .cse0 .cse16 .cse17 .cse18 .cse33 .cse13 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse3 .cse35 .cse4 .cse26 .cse27 .cse28 .cse29) (or .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse31 .cse0 .cse7) (or .cse0 (or .cse14 .cse15 .cse16 .cse18 .cse33 .cse13 .cse19 .cse20 .cse21 .cse23 .cse25 .cse42 .cse43 .cse2 .cse35 .cse26 .cse27 .cse28 .cse29) .cse4) (or (or .cse14 .cse15 .cse16 .cse18 .cse13 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse42 .cse43 .cse2 .cse26 .cse27 .cse28 .cse29 .cse30) .cse4 .cse0) (or (or .cse14 .cse15 .cse16 .cse18 .cse33 .cse13 .cse34 .cse19 .cse20 .cse21 .cse23 .cse25 .cse42 .cse43 .cse2 .cse35 .cse27 .cse28 .cse29) .cse11 .cse4 .cse0) (or .cse0 .cse2 .cse3 .cse41 .cse4 .cse13))))) [2018-11-10 02:10:54,782 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 232 250) no Hoare annotation was computed. [2018-11-10 02:10:54,784 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2018-11-10 02:10:54,784 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 245) no Hoare annotation was computed. [2018-11-10 02:10:54,784 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 245) no Hoare annotation was computed. [2018-11-10 02:10:54,784 INFO L428 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 232 250) the Hoare annotation is: true [2018-11-10 02:10:54,784 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 232 250) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 415 462) the Hoare annotation is: (let ((.cse27 (= ~t1_st~0 0)) (.cse22 (= 1 ~m_pc~0)) (.cse7 (= 1 ~t2_pc~0))) (let ((.cse23 (< ~m_st~0 2)) (.cse12 (= ~t1_pc~0 1)) (.cse25 (not .cse7)) (.cse26 (not .cse22)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (= |old(~T3_E~0)| 0)) (.cse4 (= |old(~T2_E~0)| 0)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse6 (not .cse27)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 |old(~E_2~0)|)) (.cse11 (< |old(~E_1~0)| 2)) (.cse24 (< ~t3_st~0 2)) (.cse13 (= 1 |old(~E_M~0)|)) (.cse14 (= |old(~T1_E~0)| 1)) (.cse15 (not (= 0 ~m_st~0))) (.cse1 (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))) (.cse16 (not (= ~m_i~0 1))) (.cse17 (not (= 0 ~t2_st~0))) (.cse18 (< |old(~E_3~0)| 2)) (.cse19 (< 0 ~t3_pc~0)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 ~local~0) .cse12 (not (= 0 ~t3_st~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse11 .cse0 .cse2 .cse3 .cse23 .cse24 .cse4 .cse5 .cse13 .cse25 .cse14 .cse16 .cse18 .cse8 .cse26 .cse9 .cse1 .cse19 .cse20 .cse21 .cse10 .cse27) (or .cse0 .cse2 .cse1 .cse3 .cse23 .cse4 .cse5 .cse8 .cse9 .cse10 .cse27 .cse11 (< ~t2_st~0 2) (not .cse12) (not (= 1 ~t3_pc~0)) .cse24 .cse13 .cse25 .cse14 .cse16 .cse18 .cse26 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L434-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L449-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 415 462) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 415 462) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point L419-1(lines 418 461) no Hoare annotation was computed. [2018-11-10 02:10:54,785 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 194 212) no Hoare annotation was computed. [2018-11-10 02:10:54,787 INFO L421 ceAbstractionStarter]: At program point L209(lines 197 211) the Hoare annotation is: (let ((.cse33 (= 1 ~t2_pc~0)) (.cse31 (= 1 ~m_pc~0)) (.cse25 (= ~t1_pc~0 1)) (.cse39 (= 0 ~t2_st~0)) (.cse37 (= 0 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse42 (+ ~local~0 1))) (let ((.cse6 (< ~token~0 .cse42)) (.cse22 (< .cse42 ~token~0)) (.cse12 (< ~t2_st~0 2)) (.cse29 (= 0 ~E_1~0)) (.cse34 (< ~local~0 ~token~0)) (.cse27 (not .cse10)) (.cse35 (< ~token~0 ~local~0)) (.cse26 (not .cse37)) (.cse32 (not .cse39)) (.cse3 (< ~m_st~0 2)) (.cse28 (= 1 ~E_2~0)) (.cse40 (= 0 ~E_3~0)) (.cse13 (not .cse25)) (.cse14 (not (= 1 ~t3_pc~0))) (.cse21 (not .cse31)) (.cse11 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse15 (< ~t3_st~0 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse16 (= 1 ~E_M~0)) (.cse17 (not .cse33)) (.cse18 (= ~T1_E~0 1)) (.cse38 (not (= 0 ~m_st~0))) (.cse19 (not (= ~m_i~0 1))) (.cse20 (< ~E_3~0 2)) (.cse7 (= 0 is_master_triggered_~__retres1~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse30 (< 0 ~t3_pc~0)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse9 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse12 .cse1 .cse2 .cse25 .cse4 .cse26 .cse5 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse29 .cse8 .cse30 .cse23 .cse24 .cse9 .cse7 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse28 .cse8 .cse9 .cse10 .cse7 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse30 .cse23 .cse24) (or .cse7 .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse16 .cse18 .cse19 .cse32 .cse20 .cse28 .cse29 .cse8 .cse30 .cse23 .cse24 .cse9 .cse31) (or .cse11 .cse7 .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse18 .cse19 .cse32 .cse20 .cse21 .cse8 .cse30 .cse23 .cse24 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse25 .cse4 .cse26 .cse5 .cse27 .cse16 .cse18 .cse19 .cse33 .cse32 .cse20 .cse28 .cse29 .cse8 .cse30 .cse23 .cse24 .cse9 .cse7 .cse31) (or .cse0 .cse1 .cse34 .cse2 .cse4 .cse5 .cse33 .cse28 .cse8 .cse9 .cse10 .cse7 .cse35 .cse13 .cse26 .cse16 .cse18 .cse19 .cse32 .cse20 .cse29 .cse30 .cse23 .cse24 .cse31) (or .cse0 .cse7 .cse1 .cse34 .cse2 .cse4 .cse5 .cse28 .cse8 .cse9 .cse10 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse27 .cse28 .cse8 .cse9 .cse12 .cse7 .cse25 .cse15 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse23 .cse24 .cse31) (or .cse0 .cse7 .cse1 .cse34 .cse2 .cse4 .cse5 .cse28 .cse8 .cse9 .cse10 .cse12 .cse35 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse30 .cse23 .cse24 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse32 .cse20 .cse21 .cse7 .cse23 .cse24) (let ((.cse36 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse36 ~token~0) .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse7 (< ~token~0 .cse36))) (or .cse11 .cse0 .cse1 .cse2 .cse15 .cse4 .cse27 .cse16 .cse18 .cse38 .cse19 .cse33 .cse32 .cse20 .cse28 .cse8 .cse30 .cse23 .cse24 .cse9 .cse7 .cse31) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse27 .cse33 .cse28 .cse8 .cse9 .cse25 .cse15 .cse14 .cse16 .cse18 .cse7 .cse19 .cse32 .cse20 .cse29 .cse23 .cse24 .cse31) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse8 .cse30 .cse23 .cse24 .cse9 .cse10 .cse7) (or .cse0 .cse1 .cse2 .cse39 .cse3 .cse4 .cse5 .cse28 .cse8 .cse7 .cse9 .cse10 .cse11 .cse40 .cse13 .cse26 .cse16 .cse17 .cse18 .cse19 .cse21 .cse30 .cse23 .cse24) (or .cse11 .cse0 .cse1 .cse40 .cse7 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse19 .cse28 .cse21 .cse8 .cse30 .cse23 .cse24 .cse9) (or .cse11 .cse0 .cse1 .cse40 .cse2 .cse7 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse38 .cse19 .cse28 .cse8 .cse30 .cse23 .cse24 .cse9 .cse31) (or .cse0 .cse1 .cse34 .cse2 .cse4 .cse5 .cse33 .cse28 .cse8 .cse9 .cse10 .cse35 .cse13 .cse14 .cse15 .cse7 .cse16 .cse18 .cse19 .cse32 .cse20 .cse29 .cse23 .cse24 .cse31) (or .cse0 .cse1 .cse2 .cse7 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse29 .cse8 .cse30 .cse23 .cse24 .cse9 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse8 .cse9 .cse10 .cse11 .cse13 .cse26 .cse16 .cse18 .cse19 .cse32 .cse20 .cse7 .cse21 .cse30 .cse23 .cse24) (or .cse11 .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse16 .cse18 .cse38 .cse19 .cse32 .cse20 .cse8 .cse30 .cse23 .cse24 .cse9 .cse7 .cse10 .cse31) (or .cse0 .cse1 .cse34 .cse2 .cse7 .cse4 .cse27 .cse33 .cse28 .cse8 .cse9 .cse11 .cse35 .cse25 .cse26 .cse16 .cse18 .cse38 .cse19 .cse32 .cse20 .cse30 .cse23 .cse24 .cse31) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse16 .cse17 .cse18 .cse19 .cse20 .cse7 .cse28 .cse21 .cse8 .cse30 .cse23 .cse24 .cse9) (let ((.cse41 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse39 .cse3 .cse4 .cse5 .cse28 .cse8 .cse9 .cse10 .cse11 .cse40 (< .cse41 ~token~0) .cse13 .cse14 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24 (< ~token~0 .cse41))) (or .cse11 .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse38 .cse19 .cse20 .cse7 .cse8 .cse30 .cse23 .cse24 .cse9 .cse10 .cse31)))) [2018-11-10 02:10:54,789 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 194 212) no Hoare annotation was computed. [2018-11-10 02:10:54,791 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 204) no Hoare annotation was computed. [2018-11-10 02:10:54,791 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 207) no Hoare annotation was computed. [2018-11-10 02:10:54,791 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 194 212) the Hoare annotation is: true [2018-11-10 02:10:54,791 INFO L425 ceAbstractionStarter]: For program point L198-2(lines 198 207) no Hoare annotation was computed. [2018-11-10 02:10:54,791 INFO L425 ceAbstractionStarter]: For program point L578-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 574 621) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L603-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L608-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L598-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 574 621) the Hoare annotation is: (let ((.cse9 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (= |old(~T3_E~0)| 0)) (.cse4 (< ~m_st~0 2)) (.cse10 (< ~t3_st~0 2)) (.cse5 (= |old(~T2_E~0)| 0)) (.cse0 (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))) (.cse11 (= 1 |old(~E_M~0)|)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse13 (= |old(~T1_E~0)| 1)) (.cse14 (not (= ~m_i~0 1))) (.cse15 (< |old(~E_3~0)| 2)) (.cse6 (= 1 |old(~E_2~0)|)) (.cse16 (not (= 1 ~m_pc~0))) (.cse7 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse8 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t1_st~0 0) .cse9 (< ~t2_st~0 2) (not (= ~t1_pc~0 1)) (not (= 1 ~t3_pc~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse16 .cse7 (< 0 ~t3_pc~0) .cse17 .cse18 .cse8))) [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 577 620) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 574 621) no Hoare annotation was computed. [2018-11-10 02:10:54,792 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 554 564) no Hoare annotation was computed. [2018-11-10 02:10:54,793 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 554 564) the Hoare annotation is: (let ((.cse6 (= 1 ~t2_pc~0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse40 (= 0 |old(~t3_st~0)|)) (.cse23 (= 0 |old(~t2_st~0)|)) (.cse36 (= ~t1_pc~0 1)) (.cse32 (= 1 ~m_pc~0)) (.cse54 (+ ~local~0 1)) (.cse52 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse49 (<= 2 ~t3_st~0)) (.cse48 (<= 2 ~m_st~0)) (.cse30 (= 0 ~t2_st~0)) (.cse53 (= |old(~t3_st~0)| ~t3_st~0)) (.cse50 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (and .cse48 .cse30 .cse53 .cse50)) (.cse12 (not (= 1 ~t3_pc~0))) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse38 (and (= ~m_st~0 0) .cse49 .cse50)) (.cse46 (and .cse49 .cse50)) (.cse51 (and .cse48 .cse49 .cse50)) (.cse25 (= 0 ~E_3~0)) (.cse13 (< |old(~t3_st~0)| 2)) (.cse28 (and .cse48 .cse52 .cse53 .cse50)) (.cse3 (< |old(~m_st~0)| 2)) (.cse41 (< ~token~0 .cse54)) (.cse10 (< ~E_1~0 2)) (.cse20 (not .cse32)) (.cse42 (< .cse54 ~token~0)) (.cse43 (< ~local~0 ~token~0)) (.cse45 (and .cse30 .cse53 .cse50)) (.cse44 (< ~token~0 ~local~0)) (.cse11 (not .cse36)) (.cse18 (not .cse23)) (.cse0 (= ~T1_E~0 0)) (.cse35 (< |old(~t2_st~0)| 2)) (.cse34 (and .cse52 .cse53 .cse50)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse26 (not .cse40)) (.cse5 (= 1 ~M_E~0)) (.cse33 (not .cse9)) (.cse14 (= 1 ~E_M~0)) (.cse27 (not .cse6)) (.cse15 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse19 (< ~E_3~0 2)) (.cse24 (= 1 ~E_2~0)) (.cse37 (= 0 ~E_1~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse29 (< 0 ~t3_pc~0)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse8 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse28 .cse20 .cse29 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse30 .cse5 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9 .cse32) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse33 .cse24 .cse7 .cse8 .cse34 .cse35 .cse36 .cse13 .cse12 .cse14 .cse27 .cse15 .cse17 .cse19 .cse37 .cse21 .cse22 .cse32) (or .cse10 .cse0 .cse1 .cse25 .cse2 .cse38 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse31 .cse17 .cse24 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (let ((.cse39 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse39 ~token~0) .cse24 .cse7 .cse8 .cse9 .cse10 .cse35 .cse11 .cse12 .cse40 .cse28 .cse27 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse39))) (or .cse0 .cse1 .cse30 .cse2 .cse13 .cse4 .cse5 .cse14 .cse15 .cse17 .cse18 .cse19 .cse24 .cse37 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse31 .cse17 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9 .cse38 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse41 .cse7 .cse8 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse42 .cse21 .cse22) (or .cse0 .cse1 .cse43 .cse2 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse35 .cse44 .cse11 .cse12 .cse13 .cse34 .cse14 .cse27 .cse15 .cse17 .cse19 .cse37 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse33 .cse45 .cse6 .cse24 .cse7 .cse8 .cse36 .cse13 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse37 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse45 .cse43 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse44 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse37 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse46 .cse14 .cse15 .cse17 .cse18 .cse19 .cse24 .cse37 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (let ((.cse47 (+ ~local~0 2))) (or .cse28 .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 (< .cse47 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse20 .cse21 .cse22 (< ~token~0 .cse47))) (or .cse10 (and .cse48 .cse49 .cse30 .cse50) .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (or .cse45 .cse0 .cse1 .cse2 .cse36 .cse4 .cse26 .cse5 .cse33 .cse14 .cse15 .cse17 .cse6 .cse18 .cse19 .cse24 .cse37 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse51 .cse5 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse38 .cse9 .cse32) (or .cse0 .cse1 .cse43 .cse2 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse35 .cse44 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse19 .cse34 .cse37 .cse29 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse2 .cse46 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse37 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse51 .cse10 .cse0 .cse1 .cse25 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse17 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse41 .cse7 .cse8 .cse9 .cse10 .cse35 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse42 .cse29 .cse21 .cse22) (or .cse0 .cse1 .cse43 .cse2 .cse45 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse44 .cse11 .cse26 .cse14 .cse15 .cse17 .cse18 .cse19 .cse37 .cse29 .cse21 .cse22 .cse32) (or .cse0 .cse35 .cse34 .cse1 .cse2 .cse36 .cse4 .cse26 .cse5 .cse33 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse37 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32)))) [2018-11-10 02:10:54,794 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 554 564) no Hoare annotation was computed. [2018-11-10 02:10:54,794 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2018-11-10 02:10:54,795 INFO L425 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-11-10 02:10:54,795 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 511 553) no Hoare annotation was computed. [2018-11-10 02:10:54,795 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 541) no Hoare annotation was computed. [2018-11-10 02:10:54,795 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-10 02:10:54,796 INFO L421 ceAbstractionStarter]: At program point L537-2(lines 537 541) the Hoare annotation is: (let ((.cse50 (= 0 ~t1_st~0)) (.cse48 (<= 2 ~m_st~0)) (.cse41 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (= activate_threads_~tmp___1~0 0))) (let ((.cse33 (= 1 ~t2_pc~0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse30 (= 1 ~m_pc~0)) (.cse56 (= 0 |old(~t2_st~0)|)) (.cse35 (= ~t1_pc~0 1)) (.cse37 (= ~m_st~0 0)) (.cse54 (= 0 |old(~t3_st~0)|)) (.cse68 (+ ~local~0 1)) (.cse64 (and .cse48 .cse41 .cse42)) (.cse63 (and .cse48 .cse50 .cse42)) (.cse49 (<= 2 ~t3_st~0)) (.cse55 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse38 (= activate_threads_~tmp___0~0 0)) (.cse40 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= activate_threads_~tmp~1 0)) (.cse0 (= 0 ~t2_st~0))) (let ((.cse45 (and .cse38 .cse40 .cse39 .cse0 .cse41 .cse42)) (.cse44 (and .cse55 .cse38 .cse39 .cse40 .cse41 .cse42)) (.cse29 (and .cse49 .cse50 .cse39 .cse42)) (.cse27 (and .cse49 .cse39 .cse41 .cse42)) (.cse57 (or .cse64 .cse63)) (.cse59 (and .cse48 .cse50 .cse0)) (.cse58 (and .cse48 .cse0 .cse41)) (.cse60 (< ~token~0 .cse68)) (.cse36 (not .cse54)) (.cse61 (< .cse68 ~token~0)) (.cse26 (and .cse48 .cse55 .cse38 .cse40 .cse41 .cse42)) (.cse51 (= 0 ~E_3~0)) (.cse62 (and .cse37 .cse49 .cse50 .cse39 .cse42)) (.cse66 (and .cse37 .cse49 .cse39 .cse0 .cse41 .cse42)) (.cse43 (not (= 0 |old(~m_st~0)|))) (.cse31 (< ~local~0 ~token~0)) (.cse34 (< ~token~0 ~local~0)) (.cse23 (not .cse35)) (.cse67 (and .cse38 .cse39 .cse0 .cse40 .cse41 .cse42)) (.cse15 (not .cse56)) (.cse10 (< ~E_1~0 2)) (.cse4 (< |old(~m_st~0)| 2)) (.cse46 (and .cse48 .cse49 .cse50 .cse42)) (.cse47 (and .cse48 .cse49 .cse41 .cse42)) (.cse17 (not .cse30)) (.cse18 (< 0 ~t3_pc~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse32 (not .cse9)) (.cse21 (= 1 ~E_2~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse8 (= 0 ~E_2~0)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse11 (< |old(~t3_st~0)| 2)) (.cse24 (not (= 1 ~t3_pc~0))) (.cse12 (= 1 ~E_M~0)) (.cse25 (not .cse33)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse16 (< ~E_3~0 2)) (.cse28 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23 .cse24 .cse11 .cse12 .cse25 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20 .cse26) (or .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse27 .cse28 .cse7 .cse18 .cse19 .cse20 .cse8 .cse29 .cse30) (or .cse1 .cse2 .cse31 .cse3 .cse5 .cse32 .cse33 .cse21 .cse7 .cse8 .cse10 .cse34 .cse35 .cse36 (and .cse37 .cse38 .cse39 .cse0 .cse40 .cse41 .cse42) .cse12 .cse13 .cse43 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse30) (or .cse1 .cse22 .cse2 .cse44 .cse3 .cse35 .cse5 .cse36 .cse6 .cse32 .cse12 .cse25 .cse13 .cse14 .cse16 .cse21 .cse28 .cse7 .cse18 .cse19 .cse20 .cse8 .cse30) (or .cse1 .cse2 .cse45 .cse3 .cse35 .cse5 .cse36 .cse6 .cse32 .cse12 .cse13 .cse14 .cse33 .cse15 .cse16 .cse21 .cse28 .cse7 .cse18 .cse19 .cse20 .cse8 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse46 .cse47) (or (and .cse48 .cse49 .cse50 .cse0) (and .cse48 .cse49 .cse0 .cse41)) .cse12 .cse25 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse31 .cse3 .cse5 .cse6 .cse45 .cse33 .cse21 .cse7 .cse8 .cse9 (and .cse50 .cse40 .cse39 .cse0 .cse42) .cse34 .cse23 .cse36 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse18 .cse19 .cse20 .cse30) (or .cse10 .cse1 .cse2 .cse51 .cse3 .cse4 .cse11 .cse5 .cse47 .cse6 .cse12 .cse25 .cse13 .cse14 .cse46 .cse21 .cse17 .cse7 .cse18 .cse19 .cse20 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse9 (and .cse38 (or (and .cse48 .cse0 .cse41 .cse42) (and .cse48 .cse50 .cse0 .cse42)) .cse40) .cse10 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20) (or .cse10 (let ((.cse52 (and .cse37 (<= 2 ~E_1~0) .cse39 .cse42))) (or (and .cse49 .cse52 .cse50) (and .cse49 .cse41 .cse52))) .cse1 .cse2 (or (and .cse37 .cse49 .cse50 .cse39 .cse0) (and .cse37 .cse49 .cse39 .cse0 .cse41)) .cse3 .cse11 .cse5 .cse6 .cse12 .cse25 .cse13 .cse43 .cse14 .cse16 .cse7 .cse18 .cse19 .cse20 .cse8 .cse9 .cse30) (let ((.cse53 (+ ~local~0 3))) (or .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse53 ~token~0) .cse21 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23 .cse24 .cse54 (and .cse37 .cse55 .cse38 .cse40 .cse12 .cse41 .cse42) .cse25 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20 (< ~token~0 .cse53))) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse43 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse0 .cse30) (or .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse26 .cse10 .cse51 .cse23 .cse36 .cse12 .cse25 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse31 .cse3 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse22 .cse34 .cse23 (and .cse55 .cse50 .cse39 .cse40 .cse42) .cse36 .cse12 .cse25 .cse13 .cse14 .cse16 .cse28 .cse18 .cse19 .cse20 .cse44 .cse30) (or .cse1 .cse2 .cse31 .cse3 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse22 .cse39 .cse34 .cse23 .cse24 .cse11 .cse12 .cse25 .cse13 .cse14 .cse16 .cse28 .cse19 .cse20 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse29 .cse12 .cse25 .cse13 .cse14 .cse16 .cse21 .cse28 .cse7 .cse18 .cse19 .cse20 .cse8 .cse27 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse33 .cse7 (and .cse38 .cse57 .cse55 .cse40) .cse8 .cse9 .cse10 .cse23 .cse36 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse38 (or .cse58 .cse59) .cse40) (and .cse38 .cse55 .cse57 .cse40) .cse60 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23 .cse24 .cse11 .cse12 .cse25 .cse13 .cse14 .cse16 .cse17 .cse61 .cse19 .cse20) (or .cse1 .cse2 .cse31 .cse3 .cse5 (and .cse55 .cse38 .cse40 .cse41 .cse42) .cse6 .cse21 .cse7 .cse8 .cse9 (and .cse55 .cse50 .cse40 .cse42) .cse22 .cse34 .cse23 .cse24 .cse11 .cse12 .cse25 .cse13 .cse14 .cse16 .cse28 .cse19 .cse20) (or .cse10 .cse1 .cse2 .cse51 .cse3 .cse11 .cse5 .cse6 .cse62 .cse12 .cse25 .cse13 .cse43 .cse14 .cse21 .cse7 .cse18 .cse19 .cse20 .cse8 (and .cse37 .cse49 .cse39 .cse41 .cse42) .cse30) (or .cse1 .cse2 .cse3 (and .cse38 (or .cse59 .cse58) .cse40) .cse4 .cse5 .cse6 .cse60 .cse7 .cse8 .cse9 .cse10 (and (or .cse63 .cse64) .cse38 .cse55 .cse40) .cse22 .cse23 .cse36 .cse12 .cse25 .cse13 .cse14 .cse16 .cse17 .cse61 .cse18 .cse19 .cse20) (let ((.cse65 (+ ~local~0 2))) (or .cse1 .cse2 .cse3 .cse56 .cse26 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse51 (< .cse65 ~token~0) .cse23 .cse24 .cse11 .cse12 .cse25 .cse13 .cse14 .cse17 .cse19 .cse20 (< ~token~0 .cse65))) (or .cse1 .cse2 .cse3 .cse11 .cse5 .cse0 .cse6 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse28 .cse7 .cse18 .cse19 .cse20 .cse8 .cse30) (or .cse10 .cse1 .cse2 .cse3 .cse11 .cse66 .cse5 .cse32 .cse12 .cse13 .cse43 .cse14 .cse33 .cse15 .cse16 .cse21 .cse7 .cse18 .cse19 .cse20 .cse8 .cse30) (or .cse10 .cse1 .cse2 (or .cse62 .cse66) .cse3 .cse11 .cse5 .cse6 .cse12 .cse13 .cse43 .cse14 .cse33 .cse15 .cse16 .cse7 .cse18 .cse19 .cse20 .cse8 .cse9 .cse30) (or .cse1 .cse2 .cse31 .cse3 (and .cse50 .cse39 .cse0 .cse40 .cse42) .cse5 .cse6 .cse33 .cse21 .cse7 .cse8 .cse9 .cse34 .cse23 .cse24 .cse11 .cse67 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse30) (or .cse10 .cse1 .cse2 .cse3 .cse4 .cse11 (or .cse47 .cse46) .cse5 .cse6 .cse12 .cse13 .cse14 .cse33 .cse15 .cse16 .cse17 .cse7 .cse18 .cse19 .cse20 .cse8 .cse9) (or .cse1 .cse2 .cse3 .cse5 .cse67 .cse6 .cse32 .cse33 .cse21 .cse7 .cse8 .cse35 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse30) (or .cse10 .cse1 .cse2 .cse3 .cse4 .cse11 .cse46 .cse5 .cse47 .cse12 .cse25 .cse13 .cse14 .cse16 .cse21 .cse17 .cse7 .cse18 .cse19 .cse20 .cse8) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse32 .cse21 .cse7 .cse8 .cse22 .cse35 .cse11 .cse24 .cse12 .cse25 .cse13 .cse14 (and .cse55 .cse38 .cse40 .cse39 .cse41 .cse42) .cse16 .cse28 .cse19 .cse20 .cse30))))) [2018-11-10 02:10:54,800 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2018-11-10 02:10:54,800 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-10 02:10:54,800 INFO L421 ceAbstractionStarter]: At program point L529-2(lines 529 533) the Hoare annotation is: (let ((.cse28 (= 1 ~t2_pc~0)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse31 (= 1 ~m_pc~0)) (.cse54 (= ~t1_pc~0 1)) (.cse41 (<= 2 ~m_st~0)) (.cse55 (= ~m_st~0 0)) (.cse62 (= 0 |old(~t3_st~0)|)) (.cse63 (+ ~local~0 1)) (.cse50 (= activate_threads_~tmp___0~0 0)) (.cse43 (= 0 ~t2_st~0)) (.cse44 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (<= 2 ~t3_st~0)) (.cse51 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse45 (= 0 ~t1_st~0)) (.cse48 (= |old(~t3_st~0)| ~t3_st~0)) (.cse47 (= activate_threads_~tmp~1 0))) (let ((.cse37 (and .cse51 .cse45 .cse48 .cse47)) (.cse33 (< ~local~0 ~token~0)) (.cse35 (< ~token~0 ~local~0)) (.cse52 (and .cse42 .cse45 .cse47)) (.cse53 (and .cse42 .cse47 .cse44)) (.cse49 (and .cse50 .cse48 .cse47 .cse43 .cse44)) (.cse57 (< ~token~0 .cse63)) (.cse15 (not .cse62)) (.cse58 (< .cse63 ~token~0)) (.cse24 (and .cse55 .cse42 .cse47 .cse43 .cse44)) (.cse39 (and .cse41 .cse42 .cse45)) (.cse40 (and .cse41 .cse42 .cse44)) (.cse13 (= 0 ~E_3~0)) (.cse5 (< |old(~m_st~0)| 2)) (.cse14 (not .cse54)) (.cse4 (and .cse41 .cse51 .cse50 .cse48 .cse44)) (.cse20 (not .cse31)) (.cse32 (and .cse51 .cse50 .cse48 .cse47 .cse44)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse26 (not .cse11)) (.cse8 (= 1 ~E_2~0)) (.cse46 (and .cse50 .cse47 .cse43 .cse48 .cse44)) (.cse36 (not (= 1 ~t3_pc~0))) (.cse29 (not .cse3)) (.cse38 (= 0 ~E_1~0)) (.cse12 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse25 (< |old(~t3_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse16 (= 1 ~E_M~0)) (.cse17 (not .cse28)) (.cse18 (= ~T1_E~0 1)) (.cse27 (not (= 0 |old(~m_st~0)|))) (.cse59 (and .cse55 .cse42 .cse45 .cse47)) (.cse60 (and .cse55 .cse42 .cse47 .cse44)) (.cse19 (not (= ~m_i~0 1))) (.cse30 (< ~E_3~0 2)) (.cse9 (not (= 1 ~t1_i~0))) (.cse21 (< 0 ~t3_pc~0)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0)) (.cse10 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse12 .cse0 .cse24 .cse1 .cse2 .cse25 .cse6 .cse26 .cse16 .cse18 .cse27 .cse19 .cse28 .cse29 .cse30 .cse8 .cse9 .cse21 .cse22 .cse23 .cse10 .cse31) (or .cse0 .cse32 .cse1 .cse33 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse35 .cse14 .cse36 .cse25 .cse16 .cse17 .cse18 .cse37 .cse19 .cse30 .cse38 .cse22 .cse23 .cse31) (or .cse12 .cse39 .cse0 .cse40 .cse1 .cse13 .cse2 .cse5 .cse25 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse21 .cse22 .cse23 .cse10) (or .cse12 .cse0 .cse1 .cse2 .cse5 .cse25 .cse6 .cse7 .cse16 .cse18 .cse19 .cse29 .cse30 .cse20 (or (and .cse41 .cse42 .cse43 .cse44) (and .cse41 .cse42 .cse45 .cse43)) .cse9 .cse21 .cse22 .cse23 .cse10 .cse11) (or .cse0 .cse37 .cse1 .cse33 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse32 .cse35 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse38 .cse21 .cse22 .cse23 .cse31) (or .cse0 .cse1 .cse46 .cse33 .cse2 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 (and .cse45 .cse47 .cse43 .cse48) .cse35 .cse14 .cse36 .cse25 .cse16 .cse18 .cse19 .cse29 .cse30 .cse38 .cse22 .cse23 .cse31) (or .cse0 .cse1 .cse33 .cse2 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse11 .cse35 .cse14 .cse15 (and .cse45 .cse48 .cse47 .cse43) .cse16 .cse18 .cse19 .cse29 .cse30 .cse38 .cse21 .cse22 .cse23 .cse49 .cse31) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse28 (and (or (and .cse41 .cse45) (and .cse41 .cse44)) .cse50 .cse51 .cse48) .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse29 .cse30 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse52 .cse1 .cse2 .cse25 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse53 .cse30 .cse8 .cse38 .cse9 .cse21 .cse22 .cse23 .cse10 .cse31) (or .cse0 .cse1 .cse33 .cse2 .cse6 .cse26 .cse28 .cse8 .cse9 .cse10 .cse12 .cse35 .cse54 .cse15 (and .cse55 .cse50 .cse47 .cse43 .cse48 .cse44) .cse16 .cse18 .cse27 .cse19 .cse29 .cse30 .cse21 .cse22 .cse23 .cse31) (let ((.cse56 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse13 (< .cse56 ~token~0) .cse14 .cse36 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 (< ~token~0 .cse56))) (or .cse0 .cse1 .cse43 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse21 .cse22 .cse23) (or .cse0 (and .cse51 .cse50 .cse48 .cse44) .cse1 .cse33 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse35 .cse14 .cse36 .cse25 .cse16 .cse17 .cse18 .cse19 .cse30 .cse38 (and .cse51 .cse45 .cse48) .cse22 .cse23) (or .cse0 .cse34 .cse1 .cse32 .cse2 .cse54 .cse6 .cse15 .cse7 .cse26 .cse16 .cse17 .cse18 .cse19 .cse30 .cse8 .cse38 .cse9 .cse21 .cse22 .cse23 .cse10 .cse31) (or .cse52 .cse0 .cse1 .cse2 .cse25 .cse6 .cse7 .cse16 .cse18 .cse19 .cse29 .cse30 .cse8 .cse38 .cse9 .cse21 .cse22 .cse23 .cse10 .cse53 .cse31) (or .cse0 .cse1 .cse2 .cse54 .cse6 .cse49 .cse15 .cse7 .cse26 .cse16 .cse18 .cse19 .cse28 .cse29 .cse30 .cse8 .cse38 .cse9 .cse21 .cse22 .cse23 .cse10 .cse31) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse4 .cse57 .cse9 .cse10 .cse11 .cse12 .cse34 .cse14 .cse36 .cse25 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse58 .cse22 .cse23) (or .cse12 .cse0 .cse1 .cse43 .cse2 .cse25 .cse6 .cse7 .cse16 .cse18 .cse27 .cse19 .cse29 .cse30 .cse9 .cse21 .cse22 .cse23 .cse10 .cse11 .cse31) (or .cse0 .cse1 .cse2 .cse5 .cse6 (and .cse50 (or (and .cse41 .cse45 .cse43) (and .cse41 .cse43 .cse44)) .cse48) .cse7 .cse28 .cse9 .cse10 .cse11 .cse12 .cse14 .cse36 .cse25 .cse16 .cse18 .cse19 .cse29 .cse30 .cse20 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse4 .cse57 .cse9 .cse10 .cse11 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse58 .cse21 .cse22 .cse23) (or .cse12 .cse0 .cse1 .cse40 .cse2 .cse39 .cse5 .cse25 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse9 .cse21 .cse22 .cse23 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse4 .cse9 .cse10 .cse11 .cse12 .cse34 .cse14 .cse36 .cse25 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse22 .cse23) (or .cse12 .cse0 .cse1 .cse2 .cse25 .cse6 .cse7 .cse16 .cse18 .cse27 .cse19 .cse29 .cse30 .cse9 .cse21 .cse22 .cse23 .cse10 .cse11 (or .cse59 .cse24) .cse31) (or .cse12 .cse0 .cse1 .cse2 .cse5 .cse25 .cse6 .cse39 .cse16 .cse17 .cse18 .cse40 .cse19 .cse30 .cse8 .cse20 .cse9 .cse21 .cse22 .cse23 .cse10) (or .cse12 .cse0 .cse1 .cse13 .cse2 .cse25 .cse6 .cse60 .cse7 .cse16 .cse17 .cse18 .cse27 .cse59 .cse19 .cse8 .cse9 .cse21 .cse22 .cse23 .cse10 .cse31) (let ((.cse61 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 (< .cse61 ~token~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse14 .cse36 .cse4 .cse62 .cse17 .cse18 (and .cse55 .cse51 .cse50 .cse48 .cse16 .cse44) .cse19 .cse30 .cse20 .cse22 .cse23 (< ~token~0 .cse61))) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse32 .cse34 .cse54 .cse25 .cse36 .cse16 .cse17 .cse18 .cse19 .cse30 .cse38 .cse22 .cse23 .cse31) (or .cse0 .cse43 .cse1 .cse2 .cse25 .cse6 .cse7 .cse16 .cse18 .cse19 .cse29 .cse30 .cse8 .cse38 .cse9 .cse21 .cse22 .cse23 .cse10 .cse31) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse26 .cse28 .cse8 .cse9 .cse10 .cse46 .cse54 .cse25 .cse36 .cse16 .cse18 .cse19 .cse29 .cse30 .cse38 .cse22 .cse23 .cse31) (or .cse12 .cse0 .cse1 .cse2 .cse25 .cse6 .cse7 .cse16 .cse17 .cse18 .cse27 (or .cse59 .cse60) .cse19 .cse30 .cse9 .cse21 .cse22 .cse23 .cse10 .cse11 .cse31)))) [2018-11-10 02:10:54,801 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 525) no Hoare annotation was computed. [2018-11-10 02:10:54,803 INFO L421 ceAbstractionStarter]: At program point L519(line 519) the Hoare annotation is: (let ((.cse6 (= 1 ~t2_pc~0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse45 (= 0 |old(~t3_st~0)|)) (.cse23 (= 0 |old(~t2_st~0)|)) (.cse36 (= ~t1_pc~0 1)) (.cse32 (= 1 ~m_pc~0)) (.cse55 (+ ~local~0 1)) (.cse54 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse37 (= ~m_st~0 0)) (.cse50 (<= 2 ~t3_st~0)) (.cse52 (<= 2 ~m_st~0)) (.cse30 (= 0 ~t2_st~0)) (.cse38 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (and .cse52 .cse30 .cse38 .cse39)) (.cse12 (not (= 1 ~t3_pc~0))) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse43 (and .cse37 .cse50 .cse39)) (.cse49 (and .cse50 .cse39)) (.cse53 (and .cse52 .cse50 .cse39)) (.cse25 (= 0 ~E_3~0)) (.cse13 (< |old(~t3_st~0)| 2)) (.cse28 (and .cse52 .cse54 .cse38 .cse39)) (.cse3 (< |old(~m_st~0)| 2)) (.cse46 (< ~token~0 .cse55)) (.cse10 (< ~E_1~0 2)) (.cse20 (not .cse32)) (.cse47 (< .cse55 ~token~0)) (.cse33 (< ~local~0 ~token~0)) (.cse48 (and .cse30 .cse38 .cse39)) (.cse35 (< ~token~0 ~local~0)) (.cse11 (not .cse36)) (.cse18 (not .cse23)) (.cse0 (= ~T1_E~0 0)) (.cse40 (< |old(~t2_st~0)| 2)) (.cse41 (and .cse54 .cse38 .cse39)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse26 (not .cse45)) (.cse5 (= 1 ~M_E~0)) (.cse34 (not .cse9)) (.cse14 (= 1 ~E_M~0)) (.cse27 (not .cse6)) (.cse15 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse19 (< ~E_3~0 2)) (.cse24 (= 1 ~E_2~0)) (.cse42 (= 0 ~E_1~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse29 (< 0 ~t3_pc~0)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse8 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse28 .cse20 .cse29 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse30 .cse5 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9 .cse32) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse34 .cse6 .cse24 .cse7 .cse8 .cse10 .cse35 .cse36 .cse26 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 (and .cse37 .cse30 .cse38 .cse39) .cse32) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse34 .cse24 .cse7 .cse8 .cse41 .cse40 .cse36 .cse13 .cse12 .cse14 .cse27 .cse15 .cse17 .cse19 .cse42 .cse21 .cse22 .cse32) (or .cse10 .cse0 .cse1 .cse25 .cse2 .cse43 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse31 .cse17 .cse24 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse30 .cse2 .cse3 .cse13 .cse4 .cse14 .cse27 .cse15 .cse17 .cse18 .cse19 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (let ((.cse44 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse44 ~token~0) .cse24 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse12 .cse45 .cse28 .cse27 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse44))) (or .cse0 .cse1 .cse30 .cse2 .cse13 .cse4 .cse5 .cse14 .cse15 .cse17 .cse18 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse31 .cse17 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9 .cse43 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse46 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse47 .cse21 .cse22) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse40 .cse35 .cse11 .cse12 .cse13 .cse41 .cse14 .cse27 .cse15 .cse17 .cse19 .cse42 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse34 .cse48 .cse6 .cse24 .cse7 .cse8 .cse36 .cse13 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse48 .cse33 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse49 .cse14 .cse15 .cse17 .cse18 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 (and .cse37 .cse50 .cse30 .cse39) .cse34 .cse14 .cse15 .cse31 .cse17 .cse6 .cse18 .cse19 .cse24 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (let ((.cse51 (+ ~local~0 2))) (or .cse28 .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 (< .cse51 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse20 .cse21 .cse22 (< ~token~0 .cse51))) (or .cse10 (and .cse52 .cse50 .cse30 .cse39) .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (or .cse48 .cse0 .cse1 .cse2 .cse36 .cse4 .cse26 .cse5 .cse34 .cse14 .cse15 .cse17 .cse6 .cse18 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse53 .cse5 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse43 .cse9 .cse32) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse40 .cse35 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse19 .cse41 .cse42 .cse29 .cse21 .cse22 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse53 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8) (or .cse0 .cse1 .cse2 .cse49 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse53 .cse10 .cse0 .cse1 .cse25 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse17 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse46 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse47 .cse29 .cse21 .cse22) (or .cse0 .cse1 .cse33 .cse2 .cse48 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse35 .cse11 .cse26 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse29 .cse21 .cse22 .cse32) (or .cse0 .cse40 .cse41 .cse1 .cse2 .cse36 .cse4 .cse26 .cse5 .cse34 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32)))) [2018-11-10 02:10:54,804 INFO L421 ceAbstractionStarter]: At program point L521-2(lines 521 525) the Hoare annotation is: (let ((.cse21 (= 1 ~m_pc~0)) (.cse37 (= 0 |old(~t2_st~0)|)) (.cse12 (= 1 ~t2_pc~0)) (.cse51 (= 0 |old(~t3_st~0)|)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse30 (= ~t1_pc~0 1)) (.cse53 (<= 2 ~m_st~0)) (.cse49 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse56 (+ ~local~0 1)) (.cse50 (= |old(~t3_st~0)| ~t3_st~0)) (.cse48 (= ~m_st~0 0)) (.cse42 (<= 2 ~t3_st~0)) (.cse43 (= activate_threads_~tmp~1 0)) (.cse44 (= 0 ~t2_st~0)) (.cse45 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and .cse48 .cse42 .cse43 .cse44 .cse45)) (.cse29 (and .cse43 .cse44 .cse50 .cse45)) (.cse40 (< ~token~0 .cse56)) (.cse41 (< .cse56 ~token~0)) (.cse33 (and .cse53 .cse49 .cse50 .cse45)) (.cse54 (and .cse53 .cse44 .cse50 .cse45)) (.cse27 (not (= 1 ~t3_pc~0))) (.cse55 (and .cse48 .cse42 .cse43 .cse45)) (.cse38 (= 0 ~E_3~0)) (.cse52 (and .cse49 .cse43 .cse50 .cse45)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse26 (not .cse30)) (.cse28 (= 0 ~E_1~0)) (.cse46 (and .cse53 .cse42 .cse45)) (.cse22 (= 1 ~M_E~0)) (.cse24 (< ~local~0 ~token~0)) (.cse7 (not .cse23)) (.cse25 (< ~token~0 ~local~0)) (.cse31 (not .cse51)) (.cse10 (not (= 0 |old(~m_st~0)|))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse4 (= ~T3_E~0 0)) (.cse32 (< |old(~m_st~0)| 2)) (.cse5 (< |old(~t3_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse8 (= 1 ~E_M~0)) (.cse35 (not .cse12)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (not .cse37)) (.cse14 (< ~E_3~0 2)) (.cse15 (= 1 ~E_2~0)) (.cse36 (not .cse21)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< 0 ~t3_pc~0)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse22 .cse2 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse21) (or .cse1 .cse3 .cse24 .cse4 .cse6 .cse22 .cse12 .cse15 .cse16 .cse20 .cse23 .cse25 .cse26 .cse27 .cse5 .cse8 .cse9 .cse11 .cse13 .cse14 .cse28 .cse18 .cse19 .cse29 .cse21) (or .cse1 .cse3 .cse4 .cse6 .cse22 .cse7 .cse29 .cse12 .cse15 .cse16 .cse20 .cse30 .cse5 .cse27 .cse8 .cse9 .cse11 .cse13 .cse14 .cse28 .cse18 .cse19 .cse21) (or .cse1 .cse3 .cse24 .cse4 .cse6 .cse22 .cse12 .cse15 .cse29 .cse16 .cse20 .cse23 .cse25 .cse26 .cse31 .cse8 .cse9 .cse11 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21) (or .cse1 .cse3 .cse4 .cse32 .cse6 .cse15 .cse16 .cse33 .cse20 .cse23 .cse0 .cse34 .cse26 .cse27 .cse5 .cse8 .cse35 .cse9 .cse11 .cse14 .cse36 .cse18 .cse19) (let ((.cse39 (+ ~local~0 2))) (or .cse1 .cse3 .cse4 .cse37 .cse32 .cse6 .cse22 .cse15 .cse16 .cse20 .cse23 .cse0 .cse33 .cse38 (< .cse39 ~token~0) .cse26 .cse27 .cse5 .cse8 .cse35 .cse9 .cse11 .cse36 .cse18 .cse19 (< ~token~0 .cse39))) (or .cse1 .cse3 .cse4 .cse37 .cse32 .cse6 .cse22 .cse15 .cse16 .cse20 .cse23 .cse0 .cse38 .cse26 .cse31 .cse8 .cse35 .cse33 .cse9 .cse11 .cse36 .cse17 .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse30 .cse6 .cse31 .cse22 .cse7 .cse8 .cse9 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse4 .cse32 .cse6 .cse22 .cse40 .cse16 .cse20 .cse23 .cse0 .cse34 .cse33 .cse26 .cse27 .cse5 .cse8 .cse35 .cse9 .cse11 .cse14 .cse36 .cse41 .cse18 .cse19) (or .cse1 .cse3 (and .cse42 .cse43 .cse44 .cse45) .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse4 .cse32 .cse6 .cse22 .cse40 .cse16 .cse20 .cse23 .cse0 .cse33 .cse34 .cse26 .cse31 .cse8 .cse35 .cse9 .cse11 .cse14 .cse36 .cse41 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse46 .cse3 .cse38 .cse4 .cse32 .cse5 .cse6 .cse22 .cse8 .cse35 .cse9 .cse11 .cse15 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse47 (+ ~local~0 3))) (or .cse1 .cse3 .cse4 .cse32 .cse6 .cse22 (< .cse47 ~token~0) .cse33 .cse15 .cse16 .cse20 .cse23 .cse0 (and .cse48 .cse49 .cse50 .cse8 .cse45) .cse34 .cse26 .cse27 .cse51 .cse35 .cse9 .cse11 .cse14 .cse36 .cse18 .cse19 (< ~token~0 .cse47))) (or .cse1 .cse34 .cse3 .cse4 .cse52 .cse30 .cse6 .cse31 .cse22 .cse7 .cse8 .cse35 .cse9 .cse11 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse32 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 (and .cse53 .cse42 .cse44 .cse45) .cse13 .cse14 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23) (or .cse1 .cse3 .cse24 .cse4 .cse6 .cse22 .cse15 .cse16 .cse20 .cse23 .cse34 .cse43 .cse25 .cse26 .cse27 .cse5 .cse8 .cse35 .cse9 .cse11 .cse14 .cse28 .cse18 .cse19 .cse21) (or .cse1 .cse3 .cse4 .cse32 .cse6 .cse22 .cse12 .cse16 .cse20 .cse23 .cse0 .cse26 .cse27 .cse5 .cse8 .cse9 .cse11 .cse13 .cse14 .cse36 .cse54 .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse32 .cse6 .cse54 .cse22 .cse12 .cse16 .cse20 .cse23 .cse0 .cse26 .cse31 .cse8 .cse9 .cse11 .cse13 .cse14 .cse36 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse55 .cse3 .cse4 .cse5 .cse6 .cse22 .cse8 .cse35 .cse9 .cse10 .cse11 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse21) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse22 .cse8 .cse35 .cse9 .cse11 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse42 .cse43 .cse45) .cse21) (or .cse1 .cse3 .cse4 .cse6 .cse22 .cse7 .cse15 .cse16 .cse20 .cse34 .cse52 .cse30 .cse5 .cse27 .cse8 .cse35 .cse9 .cse11 .cse14 .cse28 .cse18 .cse19 .cse21) (or (and .cse49 .cse50 .cse45) .cse1 .cse3 .cse24 .cse4 .cse6 .cse22 .cse15 .cse16 .cse20 .cse23 .cse34 .cse25 .cse26 .cse27 .cse5 .cse8 .cse35 .cse9 .cse11 .cse14 .cse28 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse35 .cse9 .cse46 .cse11 .cse14 .cse15 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse55 .cse3 .cse38 .cse4 .cse5 .cse6 .cse22 .cse8 .cse35 .cse9 .cse10 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse24 .cse4 .cse6 .cse52 .cse22 .cse15 .cse16 .cse20 .cse23 .cse34 .cse25 .cse26 .cse31 .cse8 .cse35 .cse9 .cse11 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse46 .cse4 .cse32 .cse5 .cse6 .cse22 .cse8 .cse35 .cse9 .cse11 .cse14 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23) (or .cse1 .cse3 .cse24 .cse4 .cse6 .cse7 .cse12 .cse15 .cse16 .cse20 (and .cse48 .cse43 .cse44 .cse50 .cse45) .cse0 .cse25 .cse30 .cse31 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse44 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse35 .cse9 .cse11 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23)))) [2018-11-10 02:10:54,809 INFO L425 ceAbstractionStarter]: For program point L519-1(line 519) no Hoare annotation was computed. [2018-11-10 02:10:54,810 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 511 553) the Hoare annotation is: (let ((.cse6 (= 1 ~t2_pc~0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse45 (= 0 |old(~t3_st~0)|)) (.cse23 (= 0 |old(~t2_st~0)|)) (.cse36 (= ~t1_pc~0 1)) (.cse32 (= 1 ~m_pc~0)) (.cse55 (+ ~local~0 1)) (.cse54 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse37 (= ~m_st~0 0)) (.cse50 (<= 2 ~t3_st~0)) (.cse52 (<= 2 ~m_st~0)) (.cse30 (= 0 ~t2_st~0)) (.cse38 (= |old(~t3_st~0)| ~t3_st~0)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (and .cse52 .cse30 .cse38 .cse39)) (.cse12 (not (= 1 ~t3_pc~0))) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse43 (and .cse37 .cse50 .cse39)) (.cse49 (and .cse50 .cse39)) (.cse53 (and .cse52 .cse50 .cse39)) (.cse25 (= 0 ~E_3~0)) (.cse13 (< |old(~t3_st~0)| 2)) (.cse28 (and .cse52 .cse54 .cse38 .cse39)) (.cse3 (< |old(~m_st~0)| 2)) (.cse46 (< ~token~0 .cse55)) (.cse10 (< ~E_1~0 2)) (.cse20 (not .cse32)) (.cse47 (< .cse55 ~token~0)) (.cse33 (< ~local~0 ~token~0)) (.cse48 (and .cse30 .cse38 .cse39)) (.cse35 (< ~token~0 ~local~0)) (.cse11 (not .cse36)) (.cse18 (not .cse23)) (.cse0 (= ~T1_E~0 0)) (.cse40 (< |old(~t2_st~0)| 2)) (.cse41 (and .cse54 .cse38 .cse39)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse26 (not .cse45)) (.cse5 (= 1 ~M_E~0)) (.cse34 (not .cse9)) (.cse14 (= 1 ~E_M~0)) (.cse27 (not .cse6)) (.cse15 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse19 (< ~E_3~0 2)) (.cse24 (= 1 ~E_2~0)) (.cse42 (= 0 ~E_1~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse29 (< 0 ~t3_pc~0)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse8 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse28 .cse20 .cse29 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse30 .cse5 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9 .cse32) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse34 .cse6 .cse24 .cse7 .cse8 .cse10 .cse35 .cse36 .cse26 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 (and .cse37 .cse30 .cse38 .cse39) .cse32) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse34 .cse24 .cse7 .cse8 .cse41 .cse40 .cse36 .cse13 .cse12 .cse14 .cse27 .cse15 .cse17 .cse19 .cse42 .cse21 .cse22 .cse32) (or .cse10 .cse0 .cse1 .cse25 .cse2 .cse43 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse31 .cse17 .cse24 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse30 .cse2 .cse3 .cse13 .cse4 .cse14 .cse27 .cse15 .cse17 .cse18 .cse19 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (let ((.cse44 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse44 ~token~0) .cse24 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse12 .cse45 .cse28 .cse27 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 (< ~token~0 .cse44))) (or .cse0 .cse1 .cse30 .cse2 .cse13 .cse4 .cse5 .cse14 .cse15 .cse17 .cse18 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse31 .cse17 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9 .cse43 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse46 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse47 .cse21 .cse22) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse40 .cse35 .cse11 .cse12 .cse13 .cse41 .cse14 .cse27 .cse15 .cse17 .cse19 .cse42 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse34 .cse48 .cse6 .cse24 .cse7 .cse8 .cse36 .cse13 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse48 .cse33 .cse2 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse21 .cse22 .cse32) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse49 .cse14 .cse15 .cse17 .cse18 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 (and .cse37 .cse50 .cse30 .cse39) .cse34 .cse14 .cse15 .cse31 .cse17 .cse6 .cse18 .cse19 .cse24 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (let ((.cse51 (+ ~local~0 2))) (or .cse28 .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 (< .cse51 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse17 .cse20 .cse21 .cse22 (< ~token~0 .cse51))) (or .cse10 (and .cse52 .cse50 .cse30 .cse39) .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (or .cse48 .cse0 .cse1 .cse2 .cse36 .cse4 .cse26 .cse5 .cse34 .cse14 .cse15 .cse17 .cse6 .cse18 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse53 .cse5 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse15 .cse31 .cse17 .cse18 .cse19 .cse7 .cse29 .cse21 .cse22 .cse8 .cse43 .cse9 .cse32) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse40 .cse35 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse19 .cse41 .cse42 .cse29 .cse21 .cse22 .cse32) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse53 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8) (or .cse0 .cse1 .cse2 .cse49 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32) (or .cse53 .cse10 .cse0 .cse1 .cse25 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse27 .cse15 .cse17 .cse24 .cse20 .cse7 .cse29 .cse21 .cse22 .cse8) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse46 .cse7 .cse8 .cse9 .cse10 .cse40 .cse11 .cse26 .cse14 .cse27 .cse15 .cse17 .cse19 .cse20 .cse47 .cse29 .cse21 .cse22) (or .cse0 .cse1 .cse33 .cse2 .cse48 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse35 .cse11 .cse26 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse29 .cse21 .cse22 .cse32) (or .cse0 .cse40 .cse41 .cse1 .cse2 .cse36 .cse4 .cse26 .cse5 .cse34 .cse14 .cse27 .cse15 .cse17 .cse19 .cse24 .cse42 .cse7 .cse29 .cse21 .cse22 .cse8 .cse32)))) [2018-11-10 02:10:54,815 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 511 553) no Hoare annotation was computed. [2018-11-10 02:10:54,815 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 328) no Hoare annotation was computed. [2018-11-10 02:10:54,815 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 306 335) no Hoare annotation was computed. [2018-11-10 02:10:54,815 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 329) no Hoare annotation was computed. [2018-11-10 02:10:54,815 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 330) no Hoare annotation was computed. [2018-11-10 02:10:54,815 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 306 335) the Hoare annotation is: true [2018-11-10 02:10:54,816 INFO L421 ceAbstractionStarter]: At program point L332(lines 309 334) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse10 (= ~t1_st~0 0)) (.cse35 (= ~t1_pc~0 1)) (.cse34 (= 1 ~t2_pc~0)) (.cse38 (+ ~local~0 1))) (let ((.cse36 (< ~token~0 .cse38)) (.cse37 (< .cse38 ~token~0)) (.cse12 (< ~t2_st~0 2)) (.cse18 (not .cse34)) (.cse14 (not .cse35)) (.cse31 (< ~local~0 ~token~0)) (.cse32 (< ~token~0 ~local~0)) (.cse16 (not (= 0 ~t3_st~0))) (.cse29 (not (= 0 ~m_st~0))) (.cse27 (< 0 ~t3_pc~0)) (.cse7 (= exists_runnable_thread_~__retres1~4 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (< ~m_st~0 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse28 (not .cse10)) (.cse6 (= 1 ~E_2~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 ~E_2~0)) (.cse11 (< ~E_1~0 2)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse25 (< ~t3_st~0 2)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse26 (not (= 0 ~t2_st~0))) (.cse21 (< ~E_3~0 2)) (.cse22 (not .cse30)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0))) (and (let ((.cse13 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse13 ~token~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (< ~token~0 .cse13))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse7 .cse25 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse11 .cse0 .cse1 .cse7 .cse2 .cse3 .cse25 .cse4 .cse5 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse6 .cse22 .cse8 .cse27 .cse23 .cse24 .cse9) (or .cse11 .cse0 .cse7 .cse1 .cse2 .cse25 .cse4 .cse5 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse6 .cse8 .cse27 .cse23 .cse24 .cse9 .cse30) (or .cse7 .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse23 .cse24 .cse30) (let ((.cse33 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse4 .cse5 (< .cse33 ~token~0) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse25 .cse7 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24 (< ~token~0 .cse33))) (or .cse0 .cse1 .cse31 .cse7 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse11 .cse12 .cse32 .cse15 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse7 .cse5 .cse34 .cse6 .cse8 .cse9 .cse11 .cse32 .cse14 .cse16 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse35 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse34 .cse6 .cse8 .cse9 .cse11 .cse35 .cse16 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse11 .cse12 .cse7 .cse32 .cse35 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse27 .cse23 .cse24 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse36 .cse6 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse25 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse37 .cse23 .cse24 .cse7) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse7 .cse9 .cse11 .cse12 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse28 .cse34 .cse6 .cse8 .cse9 .cse11 .cse7 .cse32 .cse15 .cse25 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse14 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse27 .cse23 .cse24 .cse7 .cse30) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse7 .cse5 .cse34 .cse6 .cse8 .cse9 .cse10 .cse11 .cse32 .cse14 .cse15 .cse25 .cse17 .cse19 .cse29 .cse20 .cse26 .cse21 .cse23 .cse24 .cse30) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse28 .cse34 .cse6 .cse8 .cse9 .cse11 .cse7 .cse32 .cse35 .cse15 .cse25 .cse17 .cse19 .cse29 .cse20 .cse26 .cse21 .cse23 .cse24 .cse30) (or .cse0 .cse1 .cse31 .cse2 .cse4 .cse5 .cse34 .cse6 .cse8 .cse9 .cse10 .cse7 .cse11 .cse32 .cse14 .cse16 .cse17 .cse19 .cse29 .cse20 .cse26 .cse21 .cse27 .cse23 .cse24 .cse30) (or .cse0 .cse1 .cse31 .cse2 .cse7 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse11 .cse12 .cse32 .cse35 .cse15 .cse25 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse23 .cse24 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse17 .cse19 .cse29 .cse20 .cse26 .cse21 .cse27 .cse23 .cse24 .cse7 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse36 .cse6 .cse8 .cse9 .cse10 .cse11 .cse14 .cse16 .cse17 .cse19 .cse7 .cse20 .cse26 .cse21 .cse22 .cse37 .cse27 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse11 .cse12 .cse35 .cse15 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse7 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse25 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse34 .cse6 .cse8 .cse9 .cse10 .cse7 .cse11 .cse14 .cse16 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse27 .cse23 .cse24) (or .cse0 .cse1 .cse31 .cse2 .cse7 .cse4 .cse5 .cse28 .cse34 .cse6 .cse8 .cse9 .cse11 .cse32 .cse35 .cse16 .cse17 .cse19 .cse29 .cse20 .cse26 .cse21 .cse27 .cse23 .cse24 .cse30) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse34 .cse6 .cse8 .cse9 .cse11 .cse35 .cse15 .cse25 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24)))) [2018-11-10 02:10:54,822 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 327) no Hoare annotation was computed. [2018-11-10 02:10:54,822 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 306 335) no Hoare annotation was computed. [2018-11-10 02:10:54,823 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 213 231) no Hoare annotation was computed. [2018-11-10 02:10:54,823 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-10 02:10:54,823 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 226) no Hoare annotation was computed. [2018-11-10 02:10:54,823 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 213 231) the Hoare annotation is: true [2018-11-10 02:10:54,823 INFO L425 ceAbstractionStarter]: For program point L217-2(lines 217 226) no Hoare annotation was computed. [2018-11-10 02:10:54,823 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 213 231) no Hoare annotation was computed. [2018-11-10 02:10:54,823 INFO L421 ceAbstractionStarter]: At program point L228(lines 216 230) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse10 (= ~t1_pc~0 1)) (.cse40 (+ ~local~0 1)) (.cse31 (= ~t1_st~0 0)) (.cse37 (= 0 ~t3_st~0)) (.cse29 (= 0 ~t2_st~0))) (let ((.cse17 (not .cse29)) (.cse11 (not .cse37)) (.cse4 (not .cse31)) (.cse28 (= 0 ~E_1~0)) (.cse19 (< 0 ~t3_pc~0)) (.cse32 (= 0 ~E_3~0)) (.cse30 (< ~m_st~0 2)) (.cse35 (< ~token~0 .cse40)) (.cse25 (< ~t3_st~0 2)) (.cse36 (< .cse40 ~token~0)) (.cse21 (= 0 ~E_M~0)) (.cse13 (= 1 ~E_M~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse23 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_2~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse8 (= 0 ~E_2~0)) (.cse9 (< ~E_1~0 2)) (.cse24 (< ~t2_st~0 2)) (.cse33 (not .cse10)) (.cse26 (not (= 1 ~t3_pc~0))) (.cse27 (not .cse5)) (.cse14 (= ~T1_E~0 1)) (.cse15 (not (= 0 ~m_st~0))) (.cse16 (not (= ~m_i~0 1))) (.cse18 (< ~E_3~0 2)) (.cse12 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse34 (not .cse22)) (.cse20 (not (= 1 ~t2_i~0)))) (and (or .cse0 .cse1 (< ~local~0 ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 ~local~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse6 .cse7 .cse8 .cse24 .cse10 .cse25 .cse26 .cse12 .cse13 .cse27 .cse14 .cse16 .cse18 .cse28 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse29 .cse30 .cse3 .cse23 .cse12 .cse6 .cse7 .cse8 .cse31 .cse9 .cse32 .cse33 .cse11 .cse13 .cse27 .cse14 .cse16 .cse34 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse23 .cse5 .cse12 .cse7 .cse8 .cse31 .cse9 .cse33 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse23 .cse4 .cse12 .cse13 .cse14 .cse16 .cse5 .cse17 .cse18 .cse6 .cse28 .cse7 .cse19 .cse20 .cse21 .cse8 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse25 .cse26 .cse13 .cse14 .cse16 .cse17 .cse18 .cse28 .cse20 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse23 .cse5 .cse7 .cse8 .cse31 .cse9 .cse33 .cse26 .cse25 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse34 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse23 .cse35 .cse7 .cse8 .cse31 .cse12 .cse9 .cse24 .cse33 .cse11 .cse13 .cse27 .cse14 .cse16 .cse18 .cse34 .cse36 .cse19 .cse20 .cse21) (or .cse0 .cse12 .cse1 .cse2 .cse30 .cse3 .cse6 .cse7 .cse8 .cse31 .cse9 .cse24 .cse33 .cse26 .cse25 .cse13 .cse27 .cse14 .cse16 .cse18 .cse34 .cse20 .cse21) (or .cse0 .cse24 .cse1 .cse2 .cse10 .cse3 .cse11 .cse23 .cse4 .cse13 .cse27 .cse14 .cse16 .cse18 .cse6 .cse28 .cse12 .cse7 .cse19 .cse20 .cse21 .cse8 .cse22) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse23 .cse6 .cse7 .cse8 .cse31 .cse9 .cse12 .cse24 .cse33 .cse26 .cse37 .cse27 .cse14 .cse16 .cse18 .cse34 .cse20 .cse21) (let ((.cse38 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse29 .cse30 .cse3 .cse23 .cse6 .cse7 .cse8 .cse31 .cse9 .cse32 (< .cse38 ~token~0) .cse33 .cse26 .cse25 .cse13 .cse27 .cse14 .cse16 .cse34 .cse20 .cse21 .cse12 (< ~token~0 .cse38))) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse23 .cse35 .cse7 .cse8 .cse31 .cse9 .cse24 .cse33 .cse26 .cse25 .cse13 .cse27 .cse12 .cse14 .cse16 .cse18 .cse34 .cse36 .cse20 .cse21) (let ((.cse39 (+ ~local~0 3))) (or (not .cse13) .cse0 .cse1 .cse2 .cse3 .cse23 (< .cse39 ~token~0) .cse6 .cse7 .cse8 .cse31 .cse9 .cse24 .cse33 .cse26 .cse37 .cse27 .cse14 .cse15 .cse16 .cse18 .cse12 .cse34 .cse20 (< ~token~0 .cse39)))))) [2018-11-10 02:10:54,824 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,824 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 463 510) no Hoare annotation was computed. [2018-11-10 02:10:54,825 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 463 510) the Hoare annotation is: (let ((.cse23 (= ~t1_st~0 0)) (.cse21 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse22 (< ~m_st~0 2)) (.cse4 (< ~t3_st~0 2)) (.cse25 (not .cse12)) (.cse26 (not .cse21)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (= |old(~T3_E~0)| 0)) (.cse5 (= |old(~T2_E~0)| 0)) (.cse7 (not .cse23)) (.cse15 (= 1 |old(~E_2~0)|)) (.cse16 (not (= 1 ~t1_i~0))) (.cse20 (= 0 |old(~E_2~0)|)) (.cse0 (< |old(~E_1~0)| 2)) (.cse24 (= ~t1_pc~0 1)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (= |old(~T1_E~0)| 1)) (.cse10 (not (= 0 ~m_st~0))) (.cse11 (not (= ~m_i~0 1))) (.cse13 (not (= 0 ~t2_st~0))) (.cse14 (< |old(~E_3~0)| 2)) (.cse17 (< 0 ~t3_pc~0)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse6 (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)))) (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 .cse6 .cse1 .cse2 .cse3 .cse22 .cse5 .cse15 .cse16 .cse20 .cse23 .cse0 (< ~t2_st~0 2) (not .cse24) (not (= 1 ~t3_pc~0)) .cse4 .cse8 .cse25 .cse9 .cse11 .cse14 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse11 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse7 .cse12 .cse15 .cse16 .cse20 .cse0 (< ~token~0 ~local~0) .cse24 (not (= 0 ~t3_st~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse6 .cse21)))) [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L467-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L482-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L497-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 463 510) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 466 509) no Hoare annotation was computed. [2018-11-10 02:10:54,830 INFO L425 ceAbstractionStarter]: For program point L287-1(lines 281 304) no Hoare annotation was computed. [2018-11-10 02:10:54,831 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 278 305) no Hoare annotation was computed. [2018-11-10 02:10:54,831 INFO L425 ceAbstractionStarter]: For program point L282-1(lines 281 304) no Hoare annotation was computed. [2018-11-10 02:10:54,831 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 278 305) the Hoare annotation is: (or (= ~T1_E~0 0) (and (= ~m_st~0 0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0)) (= ~T2_E~0 1) (< ~local~0 ~token~0) (= ~T3_E~0 0) (= ~T2_E~0 0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~t2_pc~0) (= 1 ~E_2~0) (not (= 1 ~t1_i~0)) (= 0 ~E_2~0) (< ~E_1~0 2) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (not (= 0 |old(~t3_st~0)|)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< ~E_3~0 2) (< 0 ~t3_pc~0) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2018-11-10 02:10:54,831 INFO L425 ceAbstractionStarter]: For program point L297-1(lines 278 305) no Hoare annotation was computed. [2018-11-10 02:10:54,831 INFO L425 ceAbstractionStarter]: For program point L292-1(lines 281 304) no Hoare annotation was computed. [2018-11-10 02:10:54,832 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 42 85) no Hoare annotation was computed. [2018-11-10 02:10:54,832 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 02:10:54,833 INFO L421 ceAbstractionStarter]: At program point L50(lines 45 84) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1)) (.cse6 (= 1 ~t2_pc~0)) (.cse23 (= |old(~t1_st~0)| 0))) (let ((.cse5 (not .cse23)) (.cse24 (< |old(~t2_st~0)| 2)) (.cse12 (not (= 1 ~t3_pc~0))) (.cse13 (< |old(~t3_st~0)| 2)) (.cse28 (not .cse6)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_2~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 ~E_2~0)) (.cse10 (< |old(~E_1~0)| 2)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse26 (not .cse11)) (.cse27 (not (= 0 |old(~t3_st~0)|))) (.cse14 (= 1 ~E_M~0)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= ~m_i~0 1))) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse18 (< ~E_3~0 2)) (.cse29 (< 0 ~t3_pc~0)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse25 .cse26 .cse27 .cse14 .cse28 .cse15 .cse16 .cse18 .cse29 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse25 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse31 (+ |old(~local~0)| 3))) (or .cse0 .cse1 (let ((.cse30 (+ ~local~0 3))) (and (= |old(~E_1~0)| ~E_1~0) (= ~t2_st~0 |old(~t2_st~0)|) (<= .cse30 ~token~0) (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse30) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (= 1 ~m_pc~0))) .cse2 .cse3 .cse4 (< .cse31 |old(~token~0)|) .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse26 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 (not .cse21) .cse19 .cse20 (< |old(~token~0)| .cse31))) (or .cse10 .cse0 .cse1 .cse2 .cse11 .cse3 .cse27 .cse4 .cse5 .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse25 .cse26 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (or .cse10 .cse0 .cse24 .cse1 .cse2 .cse11 .cse3 .cse27 .cse4 .cse5 .cse14 .cse28 .cse15 .cse16 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse28 .cse15 .cse16 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse25 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21)))) [2018-11-10 02:10:54,833 INFO L421 ceAbstractionStarter]: At program point L79(lines 42 85) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse4 (= ~T3_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0))) (let ((.cse46 (= 0 ~t2_st~0)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse8 (= 1 ~t2_pc~0)) (.cse47 (= 1 ~t3_pc~0)) (.cse27 (= ~t1_pc~0 1)) (.cse32 (<= ~token~0 ~local~0)) (.cse49 (<= 2 ~t3_st~0)) (.cse34 (= 0 ~t1_st~0)) (.cse37 (<= ~local~0 ~token~0)) (.cse50 (not .cse5)) (.cse51 (not .cse2)) (.cse30 (<= 2 ~m_st~0)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse52 (not (= ~M_E~0 1))) (.cse33 (<= 2 ~E_1~0)) (.cse35 (= |old(~t3_st~0)| ~t3_st~0)) (.cse53 (not .cse4)) (.cse54 (not .cse1)) (.cse48 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= 1 ~m_pc~0))) (let ((.cse40 (and .cse50 .cse51 .cse30 .cse31 .cse52 .cse33 .cse35 .cse53 .cse54 .cse48 .cse36)) (.cse43 (and .cse50 .cse47 .cse51 .cse27 .cse30 .cse31 (not (= ~E_2~0 1)) .cse52 .cse32 .cse33 (not (= ~E_2~0 0)) .cse49 (= ~t1_i~0 1) .cse34 .cse35 (<= 2 ~t2_st~0) .cse53 .cse54 .cse36 .cse37)) (.cse16 (not (= 0 |old(~t3_st~0)|))) (.cse45 (and .cse30 .cse33 .cse49 .cse48 .cse36)) (.cse44 (and .cse30 .cse33 .cse49 .cse34 .cse36)) (.cse28 (and .cse30 .cse31 .cse33 .cse35 .cse48 .cse36)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse38 (not .cse8)) (.cse26 (not .cse12)) (.cse3 (< |old(~local~0)| |old(~token~0)|)) (.cse7 (and .cse30 .cse33 .cse46 .cse35 .cse48 .cse36)) (.cse14 (< |old(~token~0)| |old(~local~0)|)) (.cse15 (not .cse27)) (.cse41 (not .cse47)) (.cse0 (and .cse30 .cse32 .cse33 .cse34 .cse46 .cse35 .cse36 .cse37)) (.cse13 (< |old(~E_1~0)| 2)) (.cse42 (< |old(~t3_st~0)| 2)) (.cse6 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (not (= 0 |old(~t2_st~0)|))) (.cse21 (< ~E_3~0 2)) (.cse9 (= 1 ~E_2~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse22 (< 0 ~t3_pc~0)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse11 (= 0 ~E_2~0)) (.cse25 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse13 .cse7 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse16 .cse17 .cse38 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (let ((.cse39 (+ |old(~local~0)| 3))) (or .cse1 .cse2 .cse4 .cse5 .cse6 (< .cse39 |old(~token~0)|) .cse40 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse15 .cse41 .cse42 .cse43 .cse17 .cse38 .cse18 .cse19 .cse21 (not .cse25) .cse23 .cse24 (< |old(~token~0)| .cse39))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse40 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 .cse41 .cse42 .cse43 .cse17 .cse38 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse44 .cse45 .cse9 .cse10 .cse11 .cse13 .cse42 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse26 .cse9 .cse10 .cse11 .cse13 .cse29 .cse27 .cse16 .cse17 .cse38 .cse18 .cse19 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25) (or .cse13 .cse1 .cse45 .cse2 .cse4 .cse42 .cse5 .cse6 .cse17 .cse38 .cse18 .cse19 .cse21 .cse9 .cse10 .cse44 .cse22 .cse23 .cse24 .cse11 .cse25) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse26 .cse28 .cse9 .cse10 .cse11 .cse13 .cse29 .cse27 .cse41 .cse42 .cse17 .cse38 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25) (or .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse13 .cse27 .cse41 .cse42 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse41 .cse42 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse13 .cse46 .cse1 .cse2 .cse4 .cse42 .cse5 .cse6 .cse17 .cse18 .cse19 .cse20 .cse21 .cse9 .cse10 .cse22 .cse23 .cse24 .cse11 .cse25))))) [2018-11-10 02:10:54,836 INFO L421 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1)) (.cse6 (= 1 ~t2_pc~0)) (.cse23 (= |old(~t1_st~0)| 0))) (let ((.cse5 (not .cse23)) (.cse24 (< |old(~t2_st~0)| 2)) (.cse12 (not (= 1 ~t3_pc~0))) (.cse13 (< |old(~t3_st~0)| 2)) (.cse28 (not .cse6)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_2~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 ~E_2~0)) (.cse10 (< |old(~E_1~0)| 2)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse26 (not .cse11)) (.cse27 (not (= 0 |old(~t3_st~0)|))) (.cse14 (= 1 ~E_M~0)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= ~m_i~0 1))) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse18 (< ~E_3~0 2)) (.cse29 (< 0 ~t3_pc~0)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse25 .cse26 .cse27 .cse14 .cse28 .cse15 .cse16 .cse18 .cse29 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse25 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse10 .cse0 .cse1 .cse2 .cse11 .cse3 .cse27 .cse4 .cse5 .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse25 .cse26 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (let ((.cse30 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< .cse30 |old(~token~0)|) .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse26 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 (not .cse21) .cse19 .cse20 (< |old(~token~0)| .cse30))) (or .cse10 .cse0 .cse24 .cse1 .cse2 .cse11 .cse3 .cse27 .cse4 .cse5 .cse14 .cse28 .cse15 .cse16 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (or .cse10 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse28 .cse15 .cse16 .cse18 .cse7 .cse8 .cse29 .cse19 .cse20 .cse9 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse25 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21)))) [2018-11-10 02:10:54,838 INFO L421 ceAbstractionStarter]: At program point L71(lines 45 84) the Hoare annotation is: (let ((.cse38 (= ~t1_pc~0 1)) (.cse25 (= 1 ~t2_pc~0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse43 (= 0 ~t2_st~0)) (.cse30 (= |old(~E_1~0)| ~E_1~0)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse41 (not (= ~m_pc~0 1))) (.cse44 (<= ~token~0 ~local~0)) (.cse33 (= ~token~0 |old(~token~0)|)) (.cse34 (= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= ~local~0 ~token~0))) (let ((.cse12 (and .cse30 .cse31 .cse41 .cse44 .cse33 .cse34 .cse35 .cse45)) (.cse39 (and .cse30 .cse41 .cse43 .cse34 .cse35)) (.cse37 (not .cse9)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse27 (not (= 0 |old(~t3_st~0)|))) (.cse18 (not .cse25)) (.cse40 (and .cse30 .cse31 .cse41 .cse34 .cse35)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse14 (not .cse38)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse26 (and .cse30 .cse41 .cse44 .cse33 .cse43 .cse34 .cse35 .cse45)) (.cse10 (< |old(~E_1~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse16 (< |old(~t3_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse42 (<= 2 ~t3_st~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse21 (< ~E_3~0 2)) (.cse6 (= 1 ~E_2~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse29 (< 0 ~t3_pc~0)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0)) (.cse8 (= 0 ~E_2~0)) (.cse24 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse13 .cse14 .cse27 .cse17 .cse19 .cse20 .cse28 .cse21 .cse29 .cse22 .cse23 .cse24) (let ((.cse36 (+ |old(~local~0)| 3))) (or .cse0 .cse1 (let ((.cse32 (+ ~local~0 3))) (and .cse30 .cse31 (<= .cse32 ~token~0) .cse33 (<= ~token~0 .cse32) .cse34 .cse35 (= 1 ~m_pc~0))) .cse3 .cse4 .cse5 (< .cse36 |old(~token~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not .cse24) .cse22 .cse23 (< |old(~token~0)| .cse36))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse25 .cse6 .cse7 .cse8 .cse10 .cse38 .cse27 .cse17 .cse19 .cse20 .cse28 .cse21 .cse29 .cse22 .cse23 .cse39 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse40 .cse6 .cse7 .cse8 .cse10 .cse11 .cse38 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse25 .cse6 .cse7 .cse8 .cse10 .cse39 .cse38 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (or .cse10 .cse0 .cse1 .cse3 .cse16 .cse4 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse30 .cse41 .cse42 .cse35) .cse6 .cse7 .cse29 .cse22 .cse23 .cse8 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse6 .cse7 .cse8 .cse10 .cse11 .cse38 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse40 .cse29 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse26 .cse24) (or .cse10 .cse0 .cse1 .cse3 .cse16 .cse4 .cse5 .cse17 (and .cse30 .cse41 .cse42 .cse43 .cse35) .cse19 .cse20 .cse28 .cse21 .cse6 .cse7 .cse29 .cse22 .cse23 .cse8 .cse24)))) [2018-11-10 02:10:54,840 INFO L421 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (let ((.cse25 (= 1 ~t2_pc~0)) (.cse26 (= |old(~t1_st~0)| 0)) (.cse11 (= ~t1_pc~0 1)) (.cse38 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse39 (<= ~token~0 ~local~0)) (.cse41 (<= ~local~0 ~token~0)) (.cse33 (not (= ~m_pc~0 1))) (.cse35 (= 0 ~t2_st~0)) (.cse40 (= |old(~t3_st~0)| ~t3_st~0)) (.cse36 (= |old(~t1_st~0)| ~t1_st~0)) (.cse37 (not (= ~E_1~0 0)))) (let ((.cse32 (and .cse33 .cse35 .cse40 .cse36 .cse37)) (.cse24 (and .cse33 .cse39 .cse35 .cse40 .cse36 .cse37 .cse41)) (.cse29 (not (= 0 |old(~t2_st~0)|))) (.cse34 (<= 2 ~t3_st~0)) (.cse23 (< |old(~local~0)| |old(~token~0)|)) (.cse43 (and .cse38 .cse33 .cse39 .cse40 .cse36 .cse37 .cse41)) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse28 (not .cse11)) (.cse13 (not (= 0 |old(~t3_st~0)|))) (.cse19 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse5 (not .cse26)) (.cse6 (= 1 ~E_2~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse8 (= 0 ~E_2~0)) (.cse9 (< |old(~E_1~0)| 2)) (.cse12 (and .cse38 .cse33 .cse40 .cse36 .cse37)) (.cse10 (< |old(~t2_st~0)| 2)) (.cse30 (not (= 1 ~t3_pc~0))) (.cse31 (< |old(~t3_st~0)| 2)) (.cse14 (= 1 ~E_M~0)) (.cse15 (not .cse25)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse18 (< ~E_3~0 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse23 .cse24 .cse2 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse28 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse11 .cse30 .cse31 .cse32 .cse14 .cse16 .cse17 .cse29 .cse18 .cse20 .cse21 .cse22) (or .cse32 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse24 .cse1 .cse23 .cse2 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse28 .cse30 .cse31 .cse14 .cse16 .cse17 .cse29 .cse18 .cse20 .cse21 .cse22) (or .cse9 .cse0 .cse1 .cse2 .cse31 .cse3 (and .cse33 .cse34 .cse35 .cse36 .cse37) .cse4 .cse14 .cse16 .cse17 .cse29 .cse18 .cse6 .cse7 .cse19 .cse20 .cse21 .cse8 .cse22) (or .cse9 .cse0 (and .cse33 .cse34 .cse36 .cse37) .cse1 .cse2 .cse31 .cse3 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse6 .cse7 .cse19 .cse20 .cse21 .cse8 .cse22) (let ((.cse42 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 (and .cse38 .cse39 .cse40 .cse36 (= 1 ~m_pc~0) .cse37 .cse41) .cse3 .cse4 (< .cse42 |old(~token~0)|) .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse28 .cse30 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 (not .cse22) .cse20 .cse21 (< |old(~token~0)| .cse42))) (or .cse0 .cse1 .cse43 .cse23 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse27 .cse28 .cse30 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse23 .cse2 .cse3 .cse4 .cse43 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse27 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse11 .cse30 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22)))) [2018-11-10 02:10:54,842 INFO L425 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-11-10 02:10:54,842 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 78) no Hoare annotation was computed. [2018-11-10 02:10:54,842 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 53) no Hoare annotation was computed. [2018-11-10 02:10:54,843 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 42 85) the Hoare annotation is: (let ((.cse38 (= ~t1_pc~0 1)) (.cse25 (= 1 ~t2_pc~0)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse43 (= 0 ~t2_st~0)) (.cse30 (= |old(~E_1~0)| ~E_1~0)) (.cse31 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse41 (not (= ~m_pc~0 1))) (.cse44 (<= ~token~0 ~local~0)) (.cse33 (= ~token~0 |old(~token~0)|)) (.cse34 (= |old(~t3_st~0)| ~t3_st~0)) (.cse35 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= ~local~0 ~token~0))) (let ((.cse12 (and .cse30 .cse31 .cse41 .cse44 .cse33 .cse34 .cse35 .cse45)) (.cse39 (and .cse30 .cse41 .cse43 .cse34 .cse35)) (.cse37 (not .cse9)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse27 (not (= 0 |old(~t3_st~0)|))) (.cse18 (not .cse25)) (.cse40 (and .cse30 .cse31 .cse41 .cse34 .cse35)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse14 (not .cse38)) (.cse15 (not (= 1 ~t3_pc~0))) (.cse26 (and .cse30 .cse41 .cse44 .cse33 .cse43 .cse34 .cse35 .cse45)) (.cse10 (< |old(~E_1~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse16 (< |old(~t3_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse42 (<= 2 ~t3_st~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse21 (< ~E_3~0 2)) (.cse6 (= 1 ~E_2~0)) (.cse7 (not (= 1 ~t1_i~0))) (.cse29 (< 0 ~t3_pc~0)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0)) (.cse8 (= 0 ~E_2~0)) (.cse24 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse13 .cse14 .cse27 .cse17 .cse19 .cse20 .cse28 .cse21 .cse29 .cse22 .cse23 .cse24) (let ((.cse36 (+ |old(~local~0)| 3))) (or .cse0 .cse1 (let ((.cse32 (+ ~local~0 3))) (and .cse30 .cse31 (<= .cse32 ~token~0) .cse33 (<= ~token~0 .cse32) .cse34 .cse35 (= 1 ~m_pc~0))) .cse3 .cse4 .cse5 (< .cse36 |old(~token~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not .cse24) .cse22 .cse23 (< |old(~token~0)| .cse36))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse25 .cse6 .cse7 .cse8 .cse10 .cse38 .cse27 .cse17 .cse19 .cse20 .cse28 .cse21 .cse29 .cse22 .cse23 .cse39 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse40 .cse6 .cse7 .cse8 .cse10 .cse11 .cse38 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse25 .cse6 .cse7 .cse8 .cse10 .cse39 .cse38 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (or .cse10 .cse0 .cse1 .cse3 .cse16 .cse4 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse30 .cse41 .cse42 .cse35) .cse6 .cse7 .cse29 .cse22 .cse23 .cse8 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse37 .cse6 .cse7 .cse8 .cse10 .cse11 .cse38 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse40 .cse29 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse26 .cse24) (or .cse10 .cse0 .cse1 .cse3 .cse16 .cse4 .cse5 .cse17 (and .cse30 .cse41 .cse42 .cse43 .cse35) .cse19 .cse20 .cse28 .cse21 .cse6 .cse7 .cse29 .cse22 .cse23 .cse8 .cse24)))) [2018-11-10 02:10:54,844 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 565 573) no Hoare annotation was computed. [2018-11-10 02:10:54,844 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 565 573) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse16 (= |old(~M_E~0)| ~M_E~0)) (.cse3 (= ~T3_E~0 0)) (.cse4 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 |old(~M_E~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse19 (= 0 ~E_2~0)) (.cse0 (< ~E_1~0 2)) (.cse5 (< ~t3_st~0 2)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (< ~E_3~0 2)) (.cse14 (not (= 1 ~m_pc~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< 0 ~t3_pc~0) .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse16 .cse3 .cse4 .cse6 .cse7 .cse13 .cse15 .cse19 (= ~t1_st~0 0) .cse0 (< ~t2_st~0 2) (not (= ~t1_pc~0 1)) (not (= 1 ~t3_pc~0)) .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse17 .cse18))) [2018-11-10 02:10:54,846 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 565 573) no Hoare annotation was computed. [2018-11-10 02:10:54,846 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 02:10:54,846 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_1~0)| ~E_1~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~token~0 |old(~token~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~E_2~0)| ~E_2~0) (= ~t2_st~0 |old(~t2_st~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~t3_st~0)| ~t3_st~0)) [2018-11-10 02:10:54,846 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:10:54,846 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2018-11-10 02:10:54,846 INFO L425 ceAbstractionStarter]: For program point is_transmit3_triggeredEXIT(lines 251 269) no Hoare annotation was computed. [2018-11-10 02:10:54,846 INFO L425 ceAbstractionStarter]: For program point L255(lines 255 264) no Hoare annotation was computed. [2018-11-10 02:10:54,846 INFO L428 ceAbstractionStarter]: At program point is_transmit3_triggeredENTRY(lines 251 269) the Hoare annotation is: true [2018-11-10 02:10:54,847 INFO L425 ceAbstractionStarter]: For program point L255-2(lines 255 264) no Hoare annotation was computed. [2018-11-10 02:10:54,847 INFO L425 ceAbstractionStarter]: For program point is_transmit3_triggeredFINAL(lines 251 269) no Hoare annotation was computed. [2018-11-10 02:10:54,847 INFO L421 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse35 (= 1 ~m_pc~0)) (.cse34 (= 1 ~t2_pc~0)) (.cse44 (= 0 ~t2_st~0))) (let ((.cse6 (= 1 ~E_2~0)) (.cse39 (= ~t1_pc~0 1)) (.cse46 (+ ~local~0 1)) (.cse15 (= 0 ~t3_st~0)) (.cse9 (= ~t1_st~0 0)) (.cse26 (not .cse44)) (.cse27 (< 0 ~t3_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse38 (= 0 ~E_3~0)) (.cse2 (= ~T3_E~0 0)) (.cse13 (not (= 1 ~t3_pc~0))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse25 (= 1 ~E_M~0)) (.cse16 (not .cse34)) (.cse17 (= ~T1_E~0 1)) (.cse18 (not (= ~m_i~0 1))) (.cse20 (not .cse35)) (.cse47 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse8 (= 0 ~E_2~0))) (let ((.cse41 (or .cse0 .cse1 .cse38 .cse2 .cse13 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse20 .cse47 .cse21 .cse22 .cse8)) (.cse33 (not (= 0 ~m_st~0))) (.cse45 (or .cse0 .cse1 .cse38 .cse2 .cse4 .cse5 .cse25 .cse17 .cse18 .cse34 .cse26 .cse47 .cse27 .cse21 .cse22 .cse8 .cse35)) (.cse30 (or .cse0 .cse1 .cse38 .cse2 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse47 .cse27 .cse21 .cse22 .cse8 .cse35)) (.cse37 (or .cse0 .cse1 .cse38 .cse2 .cse13 .cse4 .cse5 .cse25 .cse17 .cse18 .cse34 .cse26 .cse47 .cse21 .cse22 .cse8 .cse35)) (.cse42 (< ~local~0 ~token~0)) (.cse43 (< ~token~0 ~local~0)) (.cse32 (not .cse9)) (.cse40 (or .cse0 .cse1 .cse38 .cse2 .cse13 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse47 .cse21 .cse22 .cse8 .cse35)) (.cse11 (< ~t2_st~0 2)) (.cse29 (not .cse15)) (.cse23 (< ~token~0 .cse46)) (.cse12 (not .cse39)) (.cse10 (< ~E_1~0 2)) (.cse24 (not .cse6)) (.cse3 (< ~m_st~0 2)) (.cse31 (< ~t3_st~0 2)) (.cse19 (< ~E_3~0 2)) (.cse7 (not (= 1 ~t1_i~0))) (.cse14 (= 0 is_transmit3_triggered_~__retres1~3)) (.cse28 (< .cse46 ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 (or .cse10 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse17 .cse18 .cse26 .cse19 .cse20 .cse27 .cse21 .cse22) .cse12 .cse7 .cse28 .cse29 .cse14) (or .cse11 .cse19 .cse6 .cse12 .cse7 .cse30 .cse9 .cse14 .cse29) (or .cse11 .cse12 .cse7 (or .cse10 .cse0 .cse24 .cse1 .cse2 .cse3 .cse31 .cse13 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse14) (or .cse10 .cse0 .cse1 .cse14 .cse2 .cse31 .cse4 .cse32 .cse25 .cse17 .cse33 .cse18 .cse34 .cse26 .cse19 .cse6 .cse7 .cse27 .cse21 .cse22 .cse8 .cse35) (let ((.cse36 (+ ~local~0 3))) (or (not .cse25) .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 (< .cse36 ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse36))) (or .cse19 .cse6 .cse37 .cse12 .cse14 .cse7 .cse31 .cse9) (or .cse10 .cse0 .cse1 .cse38 .cse2 .cse3 .cse31 .cse14 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse6 .cse20 .cse7 .cse27 .cse21 .cse22 .cse8) (or .cse11 .cse19 .cse6 .cse7 .cse14 .cse39 .cse31 .cse40 .cse32) (or (or .cse10 .cse0 .cse1 .cse2 .cse31 .cse4 .cse5 .cse25 .cse17 .cse33 .cse18 .cse26 .cse19 .cse27 .cse21 .cse22 .cse8 .cse35) .cse14 .cse7) (or .cse11 .cse19 .cse6 .cse41 .cse42 .cse12 .cse43 .cse14 .cse7 .cse31) (or (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse25 .cse17 .cse18 .cse26 .cse19 .cse20 .cse27 .cse21 .cse22 .cse8) .cse7 .cse14) (or .cse0 .cse1 .cse2 .cse44 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse38 .cse12 .cse29 .cse25 .cse16 .cse17 .cse18 .cse20 .cse27 .cse21 .cse22) (or .cse11 .cse19 .cse6 .cse41 .cse12 .cse7 .cse14 .cse31 .cse9) (or .cse14 (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse17 .cse18 .cse34 .cse26 .cse19 .cse20 .cse27 .cse21 .cse22 .cse8) .cse12 .cse7 .cse29) (or .cse14 .cse19 .cse6 .cse7 .cse30 .cse31) (or .cse7 .cse14 (or (or .cse10 .cse0 .cse1 .cse2 .cse4 .cse5 .cse25 .cse16 .cse17 .cse33 .cse18 .cse19 .cse27 .cse21 .cse22 .cse8 .cse35) .cse31)) (or .cse14 .cse19 .cse6 .cse42 .cse43 .cse45 .cse7 .cse29 .cse32) (or .cse10 .cse0 .cse1 .cse38 .cse14 .cse2 .cse31 .cse4 .cse5 .cse25 .cse16 .cse17 .cse33 .cse18 .cse6 .cse7 .cse27 .cse21 .cse22 .cse8 .cse35) (or .cse14 .cse19 .cse6 .cse45 .cse7 .cse39 .cse29 .cse32) (or .cse14 .cse19 .cse6 .cse12 .cse45 .cse7 .cse9 .cse29) (or .cse0 .cse1 .cse42 .cse2 .cse14 .cse4 .cse32 .cse34 .cse6 .cse7 .cse8 .cse10 .cse43 .cse39 .cse29 .cse25 .cse17 .cse33 .cse18 .cse26 .cse19 .cse27 .cse21 .cse22 .cse35) (or .cse19 .cse6 .cse37 .cse14 .cse7 .cse39 .cse31 .cse32) (or .cse10 .cse0 .cse14 .cse1 .cse2 .cse3 .cse31 .cse4 .cse25 .cse16 .cse17 .cse18 .cse19 .cse6 .cse20 .cse7 .cse27 .cse21 .cse22 .cse8) (or .cse14 .cse19 .cse6 .cse45 .cse7 .cse31) (or .cse14 .cse11 .cse19 .cse6 .cse7 .cse30 .cse39 .cse29 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse11 .cse19 .cse6 .cse42 .cse12 .cse43 .cse7 .cse31 .cse40 .cse14) (or (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse31 .cse13 .cse4 .cse5 .cse25 .cse17 .cse18 .cse34 .cse26 .cse19 .cse20 .cse21 .cse22 .cse8) .cse12 .cse7 .cse14) (or .cse14 .cse11 .cse19 .cse6 .cse42 .cse43 .cse7 .cse30 .cse29 .cse32) (or .cse14 .cse19 .cse6 .cse37 .cse42 .cse43 .cse7 .cse31 .cse32) (or .cse14 (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22 .cse8) .cse7) (or .cse11 .cse19 .cse6 .cse12 .cse14 .cse7 .cse31 .cse9 .cse40) (or .cse11 .cse12 .cse7 (or .cse10 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22) .cse29 .cse14) (or .cse23 .cse12 (or .cse10 .cse0 .cse24 .cse1 .cse2 .cse3 .cse31 .cse13 .cse4 .cse5 .cse25 .cse17 .cse18 .cse26 .cse19 .cse20 .cse21 .cse22) .cse7 .cse14 .cse28))))) [2018-11-10 02:10:54,850 INFO L425 ceAbstractionStarter]: For program point L345(line 345) no Hoare annotation was computed. [2018-11-10 02:10:54,850 INFO L425 ceAbstractionStarter]: For program point L366(lines 342 408) no Hoare annotation was computed. [2018-11-10 02:10:54,851 INFO L421 ceAbstractionStarter]: At program point L358(line 358) the Hoare annotation is: (let ((.cse2 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse60 (= ~m_i~0 1)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse49 (= 1 |old(~m_pc~0)|)) (.cse35 (= 1 |old(~t2_pc~0)|))) (let ((.cse3 (< |old(~m_st~0)| 2)) (.cse14 (not .cse35)) (.cse18 (not .cse49)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse1 (= ~T2_E~0 1)) (.cse44 (= 1 ~t2_pc~0)) (.cse43 (<= 2 ~E_3~0)) (.cse5 (= 1 ~M_E~0)) (.cse33 (not .cse9)) (.cse6 (= 1 |old(~E_2~0)|)) (.cse7 (not (= 1 ~t1_i~0))) (.cse24 (<= 2 ~t3_st~0)) (.cse52 (= |old(~E_1~0)| ~E_1~0)) (.cse54 (not (= ~m_pc~0 1))) (.cse55 (= 0 ~t2_st~0)) (.cse42 (not (= ~E_2~0 1))) (.cse56 (<= |old(~E_3~0)| ~E_3~0)) (.cse57 (<= ~t3_pc~0 0)) (.cse46 (and (and (and (not .cse2) (not .cse0) (not .cse4) .cse60 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse59 (= |old(~E_M~0)| ~E_M~0)) (.cse27 (= eval_~tmp~0 1)) (.cse8 (= 0 |old(~E_2~0)|)) (.cse10 (< |old(~E_1~0)| 2)) (.cse12 (< |old(~t3_st~0)| 2)) (.cse13 (= 1 |old(~E_M~0)|)) (.cse15 (= ~T1_E~0 1)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse16 (not .cse60)) (.cse40 (not (= 0 |old(~t2_st~0)|))) (.cse17 (< |old(~E_3~0)| 2)) (.cse21 (< 0 |old(~t3_pc~0)|)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~t2_st~0)| 2) (not .cse11) (not (= 1 |old(~t3_pc~0)|)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse13 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse21 .cse19 .cse20 .cse8) (let ((.cse26 (= 0 ~t1_st~0)) (.cse51 (not .cse15)) (.cse31 (= ~t1_pc~0 1)) (.cse50 (not (= ~t2_pc~0 1))) (.cse58 (not (= ~M_E~0 1))) (.cse48 (<= 2 ~E_1~0)) (.cse45 (= 1 ~t3_pc~0)) (.cse53 (not .cse1)) (.cse47 (not (= ~E_M~0 1)))) (let ((.cse25 (and .cse42 .cse56 .cse52 (and .cse44 .cse45 .cse53 .cse46 .cse54 .cse47))) (.cse34 (and .cse42 .cse56 .cse52 (and .cse50 .cse45 .cse58 .cse53 .cse46 .cse54 .cse55 .cse47) .cse48)) (.cse23 (not .cse31)) (.cse36 (and .cse51 .cse44 .cse52 .cse43 .cse53 .cse46 .cse54 .cse42 .cse56 .cse57 .cse58 .cse48 .cse59 .cse47)) (.cse22 (<= 2 ~t2_st~0)) (.cse38 (and .cse50 .cse51 .cse52 .cse43 .cse53 .cse46 .cse54 .cse55 .cse42 .cse56 .cse57 .cse58 (= ~t2_i~0 1) .cse48 .cse59 .cse47)) (.cse28 (not .cse26)) (.cse29 (= ~token~0 |old(~token~0)|)) (.cse30 (<= ~token~0 ~local~0)) (.cse32 (<= ~local~0 ~token~0)) (.cse37 (= |old(~t3_st~0)| ~t3_st~0))) (or .cse0 .cse1 (< |old(~local~0)| |old(~token~0)|) (and .cse22 .cse23 (and .cse24 .cse25 .cse26 .cse27)) .cse2 .cse4 (and .cse22 .cse24 .cse25 .cse28 .cse29 .cse30 .cse31 .cse27 .cse32) .cse5 .cse33 (and .cse24 .cse28 .cse29 .cse30 .cse31 .cse27 .cse32 .cse34) .cse35 (and .cse22 .cse28 .cse29 .cse30 .cse31 .cse36 .cse27 .cse32 .cse37) .cse6 .cse7 (and .cse23 .cse38 .cse26 .cse27 .cse37) .cse8 .cse10 (< |old(~token~0)| |old(~local~0)|) .cse11 (and .cse23 (and .cse24 .cse26 .cse27 .cse34)) (not (= 0 |old(~t3_st~0)|)) .cse13 .cse15 .cse39 .cse16 .cse40 .cse17 (and .cse22 .cse23 .cse36 .cse26 .cse27 .cse37) .cse21 .cse19 .cse20 (let ((.cse41 (+ ~local~0 3))) (and .cse22 (<= .cse41 ~token~0) .cse24 .cse28 (<= ~token~0 .cse41) .cse31 .cse27 (and .cse42 .cse43 (and (and .cse44 .cse45 (= 1 ~m_pc~0) .cse46 .cse47) .cse48)))) (and .cse38 .cse28 .cse29 .cse30 .cse31 .cse27 .cse32 .cse37) .cse49))) (or .cse0 .cse1 .cse2 (and .cse24 (and .cse44 .cse52 .cse43 .cse54 .cse42 .cse57 .cse46 .cse59) .cse27) .cse4 .cse5 .cse33 .cse35 .cse6 .cse7 (and .cse24 (and .cse52 .cse54 .cse55 .cse42 .cse56 .cse57 .cse46 .cse59) .cse27) .cse8 .cse10 .cse12 .cse13 .cse15 .cse39 .cse16 .cse40 .cse17 .cse21 .cse19 .cse20 .cse49)))) [2018-11-10 02:10:54,852 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2018-11-10 02:10:54,852 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 336 414) no Hoare annotation was computed. [2018-11-10 02:10:54,852 INFO L425 ceAbstractionStarter]: For program point L342-1(lines 342 408) no Hoare annotation was computed. [2018-11-10 02:10:54,854 INFO L421 ceAbstractionStarter]: At program point L400(line 400) the Hoare annotation is: (let ((.cse63 (= ~m_i~0 1)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse26 (= 1 |old(~m_pc~0)|)) (.cse23 (= 1 |old(~t2_pc~0)|))) (let ((.cse3 (< |old(~m_st~0)| 2)) (.cse12 (< |old(~t3_st~0)| 2)) (.cse14 (not .cse23)) (.cse18 (not .cse26)) (.cse5 (= 1 ~M_E~0)) (.cse21 (not .cse9)) (.cse6 (= 1 |old(~E_2~0)|)) (.cse7 (not (= 1 ~t1_i~0))) (.cse8 (= 0 |old(~E_2~0)|)) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse13 (= 1 |old(~E_M~0)|)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse16 (not .cse63)) (.cse24 (not (= 0 |old(~t2_st~0)|))) (.cse17 (< |old(~E_3~0)| 2)) (.cse25 (< 0 |old(~t3_pc~0)|)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse15 (= ~T1_E~0 1)) (.cse2 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse1 (= ~T2_E~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~t2_st~0)| 2) (not .cse11) (not (= 1 |old(~t3_pc~0)|)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse10 .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse21 .cse13 .cse15 .cse22 .cse16 .cse23 .cse24 .cse17 .cse6 .cse7 .cse25 .cse19 .cse20 .cse8 .cse26) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse13 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse25 .cse19 .cse20 .cse8) (let ((.cse62 (not (= ~t2_pc~0 1))) (.cse56 (not .cse1)) (.cse46 (<= 2 ~m_st~0)) (.cse43 (not (= ~E_2~0 1))) (.cse57 (<= |old(~E_3~0)| ~E_3~0)) (.cse53 (<= ~t3_pc~0 0)) (.cse47 (and (and (and (not .cse2) (not .cse0) (not .cse4) .cse63 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse58 (not (= ~M_E~0 1))) (.cse48 (= 1 ~m_pc~0)) (.cse50 (<= 2 ~E_1~0)) (.cse54 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse51 (not (= 0 eval_~tmp~0))) (.cse44 (<= 2 ~E_3~0)) (.cse49 (not (= ~E_M~0 1))) (.cse40 (and .cse62 .cse56 .cse46 .cse43 .cse57 .cse53 .cse47 .cse58 .cse48 .cse50 .cse54)) (.cse32 (= 0 ~t1_st~0)) (.cse33 (= eval_~tmp~0 1)) (.cse39 (= ~t1_pc~0 1)) (.cse45 (= 1 ~t2_pc~0)) (.cse59 (= |old(~E_1~0)| ~E_1~0)) (.cse60 (= ~m_st~0 0)) (.cse61 (not (= ~m_pc~0 1)))) (let ((.cse36 (and .cse62 .cse59 .cse60 .cse61 .cse43 .cse57 .cse53 .cse47 .cse54)) (.cse28 (and .cse45 .cse59 .cse60 .cse56 .cse61 .cse43 .cse57 .cse53 .cse47 .cse58 .cse54)) (.cse30 (= ~token~0 |old(~token~0)|)) (.cse29 (not .cse39)) (.cse41 (and .cse40 .cse32 .cse33)) (.cse37 (= ~t2_st~0 |old(~t2_st~0)|)) (.cse27 (<= 2 ~t2_st~0)) (.cse31 (<= ~token~0 ~local~0)) (.cse52 (and .cse32 (and .cse51 (and (not .cse15) .cse45 .cse44 .cse56 .cse46 .cse43 .cse57 .cse53 .cse47 .cse58 .cse48 (= ~t2_i~0 1) .cse50 .cse54 .cse49)))) (.cse35 (<= ~local~0 ~token~0)) (.cse38 (not .cse32)) (.cse34 (not (= 0 ~t3_st~0)))) (or (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse29 .cse36 .cse30 .cse31 .cse32 .cse37 .cse33 .cse34 .cse35) .cse0 (and .cse36 .cse38 .cse30 .cse31 .cse39 .cse37 .cse33 .cse34 .cse35) .cse1 (< |old(~local~0)| |old(~token~0)|) .cse2 (and .cse40 .cse38 .cse39 .cse37 .cse33 .cse34) .cse4 .cse5 .cse21 (and .cse29 .cse41 .cse37 .cse34) .cse23 (and .cse27 .cse28 .cse38 .cse30 .cse31 .cse39 .cse33 .cse34 .cse35) .cse6 (let ((.cse42 (+ ~local~0 2))) (and .cse27 .cse38 .cse39 (<= .cse42 ~token~0) (and (and .cse43 .cse44 (and .cse45 (= 1 ~t3_pc~0) .cse46 .cse47 .cse48 .cse49) .cse50) .cse51) .cse34 (<= ~token~0 .cse42))) (and .cse27 .cse29 .cse52 .cse34) (and .cse41 .cse31 .cse37 .cse34 .cse35) .cse7 .cse8 .cse10 (< |old(~token~0)| |old(~local~0)|) .cse11 (not (= 0 |old(~t3_st~0)|)) (and .cse27 (and (and .cse45 .cse44 .cse46 .cse43 .cse53 .cse47 .cse48 .cse50 .cse54) .cse51) .cse38 .cse39 .cse34) .cse13 .cse15 .cse22 .cse16 .cse24 .cse17 .cse25 .cse19 .cse20 (and .cse27 .cse31 .cse52 .cse34 .cse35) (let ((.cse55 (+ ~local~0 1))) (and (and (and .cse45 .cse44 .cse46 (= 0 ~t2_st~0) .cse43 .cse53 .cse47 .cse48 .cse50 .cse54) .cse51) (<= ~token~0 .cse55) .cse38 (<= .cse55 ~token~0) .cse39 .cse34)) .cse26))))))) [2018-11-10 02:10:54,858 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2018-11-10 02:10:54,860 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 336 414) the Hoare annotation is: (let ((.cse42 (= 1 |old(~m_pc~0)|)) (.cse39 (= 1 |old(~t2_pc~0)|)) (.cse32 (= |old(~t1_st~0)| 0))) (let ((.cse17 (<= 2 ~m_st~0)) (.cse19 (= 1 ~t2_pc~0)) (.cse25 (= 1 ~m_pc~0)) (.cse30 (= ~t1_pc~0 1)) (.cse31 (= |old(~t3_st~0)| ~t3_st~0)) (.cse33 (= |old(~t1_pc~0)| 1)) (.cse38 (not .cse32)) (.cse40 (not (= 0 |old(~m_st~0)|))) (.cse34 (not (= ~t2_pc~0 1))) (.cse16 (= |old(~E_1~0)| ~E_1~0)) (.cse35 (= ~m_st~0 0)) (.cse36 (not (= ~m_pc~0 1))) (.cse18 (= |old(~E_M~0)| ~E_M~0)) (.cse20 (<= 2 ~t3_st~0)) (.cse21 (= |old(~E_2~0)| ~E_2~0)) (.cse22 (= |old(~E_3~0)| ~E_3~0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= ~t3_pc~0 0)) (.cse37 (= 0 ~t2_st~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (= ~T3_E~0 0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse13 (= 1 |old(~E_2~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse29 (= 0 |old(~E_2~0)|)) (.cse0 (< |old(~E_1~0)| 2)) (.cse5 (< |old(~t3_st~0)| 2)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not .cse39)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse41 (not (= 0 |old(~t2_st~0)|))) (.cse12 (< |old(~E_3~0)| 2)) (.cse14 (not .cse42)) (.cse26 (< 0 |old(~t3_pc~0)|)) (.cse27 (not (= 1 ~t2_i~0))) (.cse28 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse27 .cse28 .cse29) (or .cse1 .cse2 (and .cse16 (= 1 ~t3_pc~0) .cse30 .cse17 (= ~t2_st~0 |old(~t2_st~0)|) .cse18 .cse19 .cse21 .cse22 .cse31 .cse23 .cse25) .cse3 .cse4 .cse6 .cse7 .cse13 .cse15 .cse29 .cse32 .cse0 (< |old(~t2_st~0)| 2) (not .cse33) (not (= 1 |old(~t3_pc~0)|)) .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse27 .cse28) (or .cse1 (and .cse34 (not .cse30) .cse16 .cse35 .cse36 (<= ~token~0 ~local~0) .cse18 (= ~token~0 |old(~token~0)|) .cse21 .cse22 .cse37 .cse31 .cse23 .cse24 (<= ~local~0 ~token~0)) .cse2 (< |old(~local~0)| |old(~token~0)|) .cse3 .cse6 .cse7 .cse38 .cse39 .cse13 .cse15 .cse29 .cse0 (< |old(~token~0)| |old(~local~0)|) .cse33 (not (= 0 |old(~t3_st~0)|)) .cse8 .cse10 .cse40 .cse11 .cse41 .cse12 .cse26 .cse27 .cse28 .cse42) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse38 .cse39 .cse13 .cse15 .cse29 .cse0 .cse5 .cse8 .cse10 .cse40 (and .cse34 .cse16 .cse35 .cse36 .cse18 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24) .cse11 .cse41 .cse12 .cse26 .cse27 .cse28 .cse42) (or .cse37 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse13 .cse15 .cse29 .cse0 .cse5 .cse8 .cse9 .cse10 .cse11 .cse41 .cse12 .cse14 .cse26 .cse27 .cse28)))) [2018-11-10 02:10:54,860 INFO L425 ceAbstractionStarter]: For program point L380(lines 342 408) no Hoare annotation was computed. [2018-11-10 02:10:54,860 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2018-11-10 02:10:54,860 INFO L425 ceAbstractionStarter]: For program point L347-1(lines 342 408) no Hoare annotation was computed. [2018-11-10 02:10:54,861 INFO L421 ceAbstractionStarter]: At program point L409(lines 336 414) the Hoare annotation is: (let ((.cse2 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse41 (= ~m_i~0 1))) (let ((.cse28 (= 1 |old(~m_pc~0)|)) (.cse6 (= 1 |old(~t2_pc~0)|)) (.cse13 (= ~T1_E~0 1)) (.cse29 (= 1 ~t2_pc~0)) (.cse1 (= ~T2_E~0 1)) (.cse30 (<= 2 ~m_st~0)) (.cse32 (and (and (and (not .cse2) (not .cse0) (not .cse3) .cse41 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse33 (= 1 ~m_pc~0)) (.cse40 (= |old(~t1_st~0)| 0))) (let ((.cse27 (<= 2 ~E_1~0)) (.cse5 (not .cse40)) (.cse14 (not (= 0 |old(~m_st~0)|))) (.cse16 (not (= 0 |old(~t2_st~0)|))) (.cse21 (<= 2 ~t3_st~0)) (.cse22 (not (= 0 ~t1_st~0))) (.cse25 (<= 2 ~E_3~0)) (.cse31 (<= ~t3_pc~0 0)) (.cse34 (= |old(~E_M~0)| ~E_M~0)) (.cse18 (< 0 |old(~t3_pc~0)|)) (.cse36 (< |old(~m_st~0)| 2)) (.cse4 (= 1 ~M_E~0)) (.cse7 (= 1 |old(~E_2~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse9 (= 0 |old(~E_2~0)|)) (.cse24 (not (= ~E_2~0 1))) (.cse37 (= |old(~E_1~0)| ~E_1~0)) (.cse26 (and (not .cse13) .cse29 (= 1 ~t3_pc~0) (not .cse1) .cse30 .cse32 (not (= ~M_E~0 1)) .cse33 (= ~t2_i~0 1) (not (= ~E_M~0 1)))) (.cse23 (= ~t1_pc~0 1)) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse35 (< |old(~t3_st~0)| 2)) (.cse12 (= 1 |old(~E_M~0)|)) (.cse38 (not .cse6)) (.cse15 (not .cse41)) (.cse17 (< |old(~E_3~0)| 2)) (.cse39 (not .cse28)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 (< |old(~local~0)| |old(~token~0)|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~token~0)| |old(~local~0)|) .cse11 (not (= 0 |old(~t3_st~0)|)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and (<= 2 ~t2_st~0) .cse21 .cse22 .cse23 (and .cse24 .cse25 .cse26 .cse27)) .cse28) (or .cse0 (and .cse21 .cse22 (and .cse29 .cse25 .cse30 .cse24 .cse31 .cse32 .cse33 .cse27 .cse34)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (or .cse0 .cse1 .cse2 .cse36 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 (and .cse21 .cse22 (and .cse29 .cse37 .cse25 .cse30 .cse24 .cse31 .cse32 .cse33 .cse34)) .cse35 .cse12 .cse38 .cse13 .cse15 .cse17 .cse39 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse36 .cse3 .cse4 .cse7 .cse8 .cse9 .cse40 (and (and .cse24 (<= |old(~E_3~0)| ~E_3~0) .cse37 .cse26) (= |old(~t1_st~0)| ~t1_st~0) .cse23 (= ~t2_st~0 |old(~t2_st~0)|) (= |old(~t3_st~0)| ~t3_st~0)) .cse10 (< |old(~t2_st~0)| 2) (not .cse11) (not (= 1 |old(~t3_pc~0)|)) .cse35 .cse12 .cse38 .cse13 .cse15 .cse17 .cse39 .cse19 .cse20))))) [2018-11-10 02:10:54,864 INFO L421 ceAbstractionStarter]: At program point L343(line 343) the Hoare annotation is: (let ((.cse13 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse14 (= ~T2_E~0 0)) (.cse78 (= ~m_i~0 1)) (.cse1 (= ~T2_E~0 1)) (.cse27 (= ~T1_E~0 1))) (let ((.cse35 (= 1 |old(~m_pc~0)|)) (.cse17 (= 1 |old(~t2_pc~0)|)) (.cse11 (<= 2 ~t3_st~0)) (.cse79 (= ~t1_i~0 1)) (.cse58 (= 1 ~t3_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse59 (<= 2 ~m_st~0)) (.cse61 (= 1 ~m_pc~0)) (.cse64 (not (= 0 eval_~tmp~0))) (.cse76 (not (= ~t2_pc~0 1))) (.cse80 (not .cse27)) (.cse3 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (<= 2 ~E_3~0)) (.cse5 (= ~m_st~0 0)) (.cse74 (not .cse1)) (.cse6 (not (= ~m_pc~0 1))) (.cse60 (= 0 ~t2_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse40 (<= |old(~E_3~0)| ~E_3~0)) (.cse8 (<= ~t3_pc~0 0)) (.cse9 (and (and (and (not .cse13) (not .cse0) (not .cse14) .cse78 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse75 (not (= ~M_E~0 1))) (.cse63 (<= 2 ~E_1~0)) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse62 (not (= ~E_M~0 1))) (.cse37 (= |old(~t1_st~0)| 0))) (let ((.cse16 (not .cse37)) (.cse38 (= |old(~t1_pc~0)| 1)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse24 (and .cse76 .cse80 .cse3 .cse4 .cse5 .cse74 .cse6 .cse60 .cse7 .cse40 .cse8 .cse9 .cse75 .cse63 .cse10 .cse62)) (.cse22 (and (and .cse80 .cse2 .cse4 .cse74 .cse59 .cse7 .cse8 .cse9 .cse75 .cse61 (= ~t2_i~0 1) .cse63 .cse10 .cse62) .cse64)) (.cse44 (= |old(~t3_st~0)| ~t3_st~0)) (.cse43 (= ~t1_pc~0 1)) (.cse19 (and .cse76 .cse4 .cse74 .cse59 .cse60 .cse7 .cse40 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10 .cse62)) (.cse12 (= eval_~tmp~0 1)) (.cse41 (and .cse80 .cse2 .cse58 .cse74 .cse59 .cse9 .cse75 .cse61 .cse62)) (.cse36 (< |old(~m_st~0)| 2)) (.cse42 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= 1 ~M_E~0)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 |old(~E_2~0)|)) (.cse23 (< |old(~E_1~0)| 2)) (.cse25 (< |old(~t3_st~0)| 2)) (.cse46 (and .cse11 .cse79 (and (and .cse2 .cse3 .cse4 .cse74 .cse59 .cse7 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10) .cse64))) (.cse26 (= 1 |old(~E_M~0)|)) (.cse39 (not .cse17)) (.cse47 (and .cse11 .cse79 (and .cse80 .cse2 .cse3 .cse4 .cse74 .cse59 .cse60 .cse7 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10 .cse62))) (.cse29 (not .cse78)) (.cse31 (< |old(~E_3~0)| 2)) (.cse45 (not .cse35)) (.cse32 (< 0 |old(~t3_pc~0)|)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse11 .cse12) .cse20 .cse21 (and .cse22 .cse11) .cse23 (and .cse11 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse15 .cse18 .cse20 .cse21 .cse37 .cse23 (< |old(~t2_st~0)| 2) (not .cse38) (not (= 1 |old(~t3_pc~0)|)) .cse25 .cse26 .cse39 .cse27 (and (and .cse7 .cse40 .cse3 .cse41) .cse42 .cse43 (= ~t2_st~0 |old(~t2_st~0)|) .cse44) .cse29 .cse31 .cse45 .cse33 .cse34) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse15 .cse18 .cse20 .cse21 .cse23 .cse25 .cse46 .cse26 .cse39 .cse27 .cse47 .cse29 .cse30 .cse31 .cse45 .cse32 .cse33 .cse34) (let ((.cse71 (and .cse7 (and .cse76 .cse58 .cse74 .cse59 .cse60 .cse9 .cse75 .cse61 .cse62) .cse40 .cse4 .cse63)) (.cse77 (+ ~local~0 1)) (.cse68 (= 0 ~t1_st~0))) (let ((.cse65 (and (and .cse7 .cse4 .cse41 .cse63) .cse64)) (.cse67 (and .cse19 .cse68 .cse12)) (.cse56 (<= ~token~0 .cse77)) (.cse57 (<= .cse77 ~token~0)) (.cse49 (and .cse2 .cse3 .cse4 .cse5 .cse74 .cse6 .cse7 .cse40 .cse8 .cse9 .cse75 .cse10 .cse62)) (.cse69 (and .cse68 (and .cse64 (and .cse2 .cse4 .cse74 .cse59 .cse7 .cse40 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10 .cse62)))) (.cse55 (and .cse11 .cse71 .cse68 .cse12)) (.cse72 (and .cse7 .cse40 .cse3 .cse4 (and .cse76 .cse58 .cse5 .cse74 .cse6 .cse60 .cse9 .cse75 .cse62) .cse63)) (.cse54 (and .cse7 (and .cse2 .cse58 .cse5 .cse74 .cse6 .cse9 .cse75 .cse62) .cse40 .cse3 .cse4 .cse63)) (.cse66 (not .cse43)) (.cse51 (= ~token~0 |old(~token~0)|)) (.cse52 (<= ~token~0 ~local~0)) (.cse53 (<= ~local~0 ~token~0)) (.cse48 (<= 2 ~t2_st~0)) (.cse50 (not .cse68))) (or (and .cse48 .cse49 .cse50 .cse51 .cse52 .cse43 .cse12 .cse53 .cse44) .cse0 (and .cse48 .cse11 .cse50 .cse51 .cse54 .cse52 .cse43 .cse12 .cse53) .cse15 .cse16 (and .cse52 .cse55 .cse53) .cse17 (and .cse56 .cse11 .cse50 .cse57 .cse43 (and (and .cse7 .cse4 (and .cse2 .cse58 .cse59 .cse60 .cse9 .cse61 .cse62) .cse63) .cse64)) (and .cse48 .cse11 .cse50 .cse43 .cse65) (< |old(~token~0)| |old(~local~0)|) (and .cse66 .cse67 .cse44) .cse38 (and .cse66 .cse51 .cse52 .cse24 .cse68 .cse53 .cse44) (and .cse48 .cse52 .cse69 .cse53 .cse44) .cse26 .cse29 .cse30 .cse31 (let ((.cse70 (+ ~local~0 2))) (and .cse48 .cse50 .cse43 (<= .cse70 ~token~0) .cse65 (= 0 ~t3_st~0) (<= ~token~0 .cse70))) .cse32 .cse34 (and (and .cse48 .cse43 (and .cse11 .cse65)) .cse52 .cse53) (and .cse67 .cse52 .cse53 .cse44) (and (and (and .cse2 .cse4 .cse59 .cse60 .cse7 .cse8 .cse9 .cse61 .cse63 .cse10) .cse64) .cse56 .cse50 .cse57 .cse43 .cse44) .cse1 (< |old(~local~0)| |old(~token~0)|) .cse13 .cse14 (and .cse48 .cse49 .cse66 .cse51 .cse52 .cse68 .cse12 .cse53 .cse44) (and .cse11 .cse50 .cse43 .cse71 .cse12) (and .cse66 .cse51 .cse52 (and .cse11 .cse72 .cse68 .cse12) .cse53) (and .cse19 .cse50 .cse43 .cse12 .cse44) .cse18 (and .cse48 .cse66 .cse69 .cse44) .cse20 (let ((.cse73 (+ ~local~0 3))) (and .cse48 (and (and .cse2 .cse4 .cse58 .cse5 .cse7 .cse9 .cse61 .cse63 .cse62) .cse64) (<= .cse73 ~token~0) .cse11 .cse50 (<= ~token~0 .cse73) .cse43)) .cse21 .cse23 (and .cse66 .cse55) (and .cse11 .cse50 .cse51 .cse52 .cse43 .cse72 .cse12 .cse53) (and .cse48 .cse66 .cse51 .cse52 (and .cse11 .cse54 .cse68 .cse12) .cse53) (and .cse48 .cse66 (and .cse11 .cse68 (and (and .cse7 .cse40 .cse41 .cse63) .cse64))) (not (= 0 |old(~t3_st~0)|)) .cse27 .cse28 (and .cse50 .cse51 .cse52 .cse43 .cse24 .cse53 .cse44) .cse33 (and .cse48 .cse22 .cse50 .cse43 .cse44) .cse35))) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse15 .cse18 .cse20 .cse21 (and .cse11 (and .cse2 .cse3 .cse59 .cse7 .cse40 .cse8 .cse9 .cse61 .cse10)) .cse23 .cse25 .cse46 .cse26 .cse39 .cse27 .cse47 .cse29 .cse31 .cse45 .cse32 .cse33 .cse34) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse42 .cse15 .cse18 .cse20 .cse21 .cse37 .cse23 .cse25 .cse46 .cse26 .cse39 .cse47 .cse27 .cse29 .cse31 .cse45 .cse32 .cse33 .cse34))))) [2018-11-10 02:10:54,872 INFO L421 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse14 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse15 (= ~T2_E~0 0)) (.cse61 (= ~m_i~0 1)) (.cse13 (= ~T2_E~0 1))) (let ((.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= ~m_pc~0 1))) (.cse45 (not (= ~t2_pc~0 1))) (.cse59 (not .cse13)) (.cse20 (<= 2 ~m_st~0)) (.cse58 (= 0 ~t2_st~0)) (.cse6 (not (= ~E_2~0 1))) (.cse48 (<= |old(~E_3~0)| ~E_3~0)) (.cse7 (<= ~t3_pc~0 0)) (.cse8 (and (and (and (not .cse14) (not .cse0) (not .cse15) .cse61 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse60 (not (= ~M_E~0 1))) (.cse21 (= 1 ~m_pc~0)) (.cse22 (<= 2 ~E_1~0)) (.cse9 (= |old(~E_M~0)| ~E_M~0)) (.cse41 (= |old(~t1_st~0)| 0)) (.cse39 (= 1 |old(~m_pc~0)|)) (.cse19 (= 1 |old(~t2_pc~0)|))) (let ((.cse40 (< |old(~m_st~0)| 2)) (.cse29 (< |old(~t3_st~0)| 2)) (.cse43 (not .cse19)) (.cse44 (not .cse39)) (.cse17 (= 1 ~M_E~0)) (.cse18 (not .cse41)) (.cse28 (and .cse45 .cse59 .cse20 .cse58 .cse6 .cse48 .cse7 .cse8 .cse60 .cse21 .cse22 .cse9)) (.cse24 (= 1 |old(~E_2~0)|)) (.cse16 (and .cse45 .cse2 .cse4 .cse59 .cse5 .cse58 .cse6 .cse48 .cse7 .cse8 .cse60 .cse9)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (= 0 |old(~E_2~0)|)) (.cse27 (< |old(~E_1~0)| 2)) (.cse42 (= |old(~t1_pc~0)| 1)) (.cse30 (= 1 |old(~E_M~0)|)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse33 (not .cse61)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse35 (< |old(~E_3~0)| 2)) (.cse36 (< 0 |old(~t3_pc~0)|)) (.cse37 (not (= 1 ~t2_i~0))) (.cse38 (= 0 |old(~E_M~0)|)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (not (= 0 ~t1_st~0))) (.cse12 (= eval_~tmp~0 1)) (.cse23 (not (= 0 eval_~tmp~0))) (.cse31 (= ~T1_E~0 1)) (.cse3 (<= 2 ~E_3~0)) (.cse1 (= 1 ~t2_pc~0))) (and (or .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 (and .cse10 .cse16 .cse11 .cse12) .cse17 .cse18 .cse19 (and (and (and .cse1 .cse3 .cse20 .cse6 .cse7 .cse8 .cse21 .cse22 .cse9) .cse23) .cse10 .cse11) .cse24 .cse25 .cse26 .cse27 (and .cse28 .cse10 .cse11 .cse12) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (or .cse0 .cse13 .cse14 .cse40 .cse15 .cse17 .cse24 .cse25 .cse26 .cse41 .cse27 (< |old(~t2_st~0)| 2) (not .cse42) (not (= 1 |old(~t3_pc~0)|)) .cse29 .cse30 .cse43 .cse31 .cse33 .cse35 .cse44 .cse37 .cse38) (or .cse0 .cse13 .cse14 .cse40 .cse15 .cse17 .cse24 .cse25 .cse26 .cse27 .cse29 (and .cse10 .cse11 (and (and .cse1 .cse2 .cse3 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9) .cse23)) .cse30 .cse43 .cse31 .cse33 .cse35 .cse44 .cse36 .cse37 .cse38) (let ((.cse51 (= ~t1_pc~0 1)) (.cse46 (= 1 ~t3_pc~0)) (.cse47 (not (= ~E_M~0 1)))) (let ((.cse52 (and .cse1 .cse46 .cse59 .cse20 .cse8 .cse60 .cse21 .cse47)) (.cse50 (<= 2 ~t2_st~0)) (.cse57 (and .cse23 (and (not .cse31) .cse1 .cse3 .cse59 .cse20 .cse6 .cse48 .cse7 .cse8 .cse60 .cse21 (= ~t2_i~0 1) .cse22 .cse9 .cse47))) (.cse49 (= |old(~t3_st~0)| ~t3_st~0)) (.cse55 (not .cse51)) (.cse56 (= ~token~0 |old(~token~0)|)) (.cse53 (<= ~token~0 ~local~0)) (.cse54 (<= ~local~0 ~token~0))) (or .cse0 .cse13 (< |old(~local~0)| |old(~token~0)|) .cse14 .cse15 (and .cse10 .cse11 (and .cse6 (and .cse45 .cse46 .cse20 .cse8 .cse21 .cse47) .cse48 .cse22) (= ~t2_st~0 |old(~t2_st~0)|) .cse12) .cse17 .cse18 (and .cse28 .cse11 .cse12 .cse49) .cse19 (and (and .cse50 .cse10 .cse11 .cse51 (and (and .cse6 .cse3 .cse52 .cse22) .cse23)) .cse53 .cse54) .cse24 (and .cse55 .cse16 .cse11 .cse56 .cse53 .cse12 .cse54 .cse49) .cse25 (and .cse50 .cse55 .cse10 .cse11 (and (and .cse6 .cse48 .cse52 .cse22) .cse23)) .cse26 (and .cse50 (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse48 .cse7 .cse8 .cse9) .cse55 .cse11 .cse56 .cse53 .cse12 .cse54 .cse49) .cse27 (and .cse50 .cse11 .cse53 .cse54 .cse57 .cse49) (< |old(~token~0)| |old(~local~0)|) .cse42 (not (= 0 |old(~t3_st~0)|)) (and .cse50 .cse55 .cse10 .cse11 .cse56 (and .cse6 (and .cse1 .cse46 .cse4 .cse5 .cse8 .cse47) .cse48 .cse2) .cse53 .cse12 .cse54) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (and .cse50 .cse55 .cse11 .cse57 .cse49) (and .cse55 .cse10 .cse11 .cse56 .cse53 (and .cse6 .cse48 .cse2 (and .cse45 .cse46 .cse4 .cse5 .cse58 .cse8 .cse47)) .cse12 .cse54) .cse39))))))) [2018-11-10 02:10:54,875 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 404) no Hoare annotation was computed. [2018-11-10 02:10:54,877 INFO L425 ceAbstractionStarter]: For program point L352(lines 342 408) no Hoare annotation was computed. [2018-11-10 02:10:54,877 INFO L425 ceAbstractionStarter]: For program point L369(lines 369 376) no Hoare annotation was computed. [2018-11-10 02:10:54,878 INFO L421 ceAbstractionStarter]: At program point L394(lines 342 408) the Hoare annotation is: (let ((.cse13 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse14 (= ~T2_E~0 0)) (.cse78 (= ~m_i~0 1)) (.cse1 (= ~T2_E~0 1)) (.cse27 (= ~T1_E~0 1))) (let ((.cse35 (= 1 |old(~m_pc~0)|)) (.cse17 (= 1 |old(~t2_pc~0)|)) (.cse11 (<= 2 ~t3_st~0)) (.cse79 (= ~t1_i~0 1)) (.cse58 (= 1 ~t3_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse59 (<= 2 ~m_st~0)) (.cse61 (= 1 ~m_pc~0)) (.cse64 (not (= 0 eval_~tmp~0))) (.cse76 (not (= ~t2_pc~0 1))) (.cse80 (not .cse27)) (.cse3 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (<= 2 ~E_3~0)) (.cse5 (= ~m_st~0 0)) (.cse74 (not .cse1)) (.cse6 (not (= ~m_pc~0 1))) (.cse60 (= 0 ~t2_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse40 (<= |old(~E_3~0)| ~E_3~0)) (.cse8 (<= ~t3_pc~0 0)) (.cse9 (and (and (and (not .cse13) (not .cse0) (not .cse14) .cse78 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse75 (not (= ~M_E~0 1))) (.cse63 (<= 2 ~E_1~0)) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse62 (not (= ~E_M~0 1))) (.cse37 (= |old(~t1_st~0)| 0))) (let ((.cse16 (not .cse37)) (.cse38 (= |old(~t1_pc~0)| 1)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse24 (and .cse76 .cse80 .cse3 .cse4 .cse5 .cse74 .cse6 .cse60 .cse7 .cse40 .cse8 .cse9 .cse75 .cse63 .cse10 .cse62)) (.cse22 (and (and .cse80 .cse2 .cse4 .cse74 .cse59 .cse7 .cse8 .cse9 .cse75 .cse61 (= ~t2_i~0 1) .cse63 .cse10 .cse62) .cse64)) (.cse44 (= |old(~t3_st~0)| ~t3_st~0)) (.cse43 (= ~t1_pc~0 1)) (.cse19 (and .cse76 .cse4 .cse74 .cse59 .cse60 .cse7 .cse40 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10 .cse62)) (.cse12 (= eval_~tmp~0 1)) (.cse41 (and .cse80 .cse2 .cse58 .cse74 .cse59 .cse9 .cse75 .cse61 .cse62)) (.cse36 (< |old(~m_st~0)| 2)) (.cse42 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= 1 ~M_E~0)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 |old(~E_2~0)|)) (.cse23 (< |old(~E_1~0)| 2)) (.cse25 (< |old(~t3_st~0)| 2)) (.cse46 (and .cse11 .cse79 (and (and .cse2 .cse3 .cse4 .cse74 .cse59 .cse7 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10) .cse64))) (.cse26 (= 1 |old(~E_M~0)|)) (.cse39 (not .cse17)) (.cse47 (and .cse11 .cse79 (and .cse80 .cse2 .cse3 .cse4 .cse74 .cse59 .cse60 .cse7 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10 .cse62))) (.cse29 (not .cse78)) (.cse31 (< |old(~E_3~0)| 2)) (.cse45 (not .cse35)) (.cse32 (< 0 |old(~t3_pc~0)|)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse11 .cse12) .cse20 .cse21 (and .cse22 .cse11) .cse23 (and .cse11 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse15 .cse18 .cse20 .cse21 .cse37 .cse23 (< |old(~t2_st~0)| 2) (not .cse38) (not (= 1 |old(~t3_pc~0)|)) .cse25 .cse26 .cse39 .cse27 (and (and .cse7 .cse40 .cse3 .cse41) .cse42 .cse43 (= ~t2_st~0 |old(~t2_st~0)|) .cse44) .cse29 .cse31 .cse45 .cse33 .cse34) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse15 .cse18 .cse20 .cse21 .cse23 .cse25 .cse46 .cse26 .cse39 .cse27 .cse47 .cse29 .cse30 .cse31 .cse45 .cse32 .cse33 .cse34) (let ((.cse71 (and .cse7 (and .cse76 .cse58 .cse74 .cse59 .cse60 .cse9 .cse75 .cse61 .cse62) .cse40 .cse4 .cse63)) (.cse77 (+ ~local~0 1)) (.cse68 (= 0 ~t1_st~0))) (let ((.cse65 (and (and .cse7 .cse4 .cse41 .cse63) .cse64)) (.cse67 (and .cse19 .cse68 .cse12)) (.cse56 (<= ~token~0 .cse77)) (.cse57 (<= .cse77 ~token~0)) (.cse49 (and .cse2 .cse3 .cse4 .cse5 .cse74 .cse6 .cse7 .cse40 .cse8 .cse9 .cse75 .cse10 .cse62)) (.cse69 (and .cse68 (and .cse64 (and .cse2 .cse4 .cse74 .cse59 .cse7 .cse40 .cse8 .cse9 .cse75 .cse61 .cse63 .cse10 .cse62)))) (.cse55 (and .cse11 .cse71 .cse68 .cse12)) (.cse72 (and .cse7 .cse40 .cse3 .cse4 (and .cse76 .cse58 .cse5 .cse74 .cse6 .cse60 .cse9 .cse75 .cse62) .cse63)) (.cse54 (and .cse7 (and .cse2 .cse58 .cse5 .cse74 .cse6 .cse9 .cse75 .cse62) .cse40 .cse3 .cse4 .cse63)) (.cse66 (not .cse43)) (.cse51 (= ~token~0 |old(~token~0)|)) (.cse52 (<= ~token~0 ~local~0)) (.cse53 (<= ~local~0 ~token~0)) (.cse48 (<= 2 ~t2_st~0)) (.cse50 (not .cse68))) (or (and .cse48 .cse49 .cse50 .cse51 .cse52 .cse43 .cse12 .cse53 .cse44) .cse0 (and .cse48 .cse11 .cse50 .cse51 .cse54 .cse52 .cse43 .cse12 .cse53) .cse15 .cse16 (and .cse52 .cse55 .cse53) .cse17 (and .cse56 .cse11 .cse50 .cse57 .cse43 (and (and .cse7 .cse4 (and .cse2 .cse58 .cse59 .cse60 .cse9 .cse61 .cse62) .cse63) .cse64)) (and .cse48 .cse11 .cse50 .cse43 .cse65) (< |old(~token~0)| |old(~local~0)|) (and .cse66 .cse67 .cse44) .cse38 (and .cse66 .cse51 .cse52 .cse24 .cse68 .cse53 .cse44) (and .cse48 .cse52 .cse69 .cse53 .cse44) .cse26 .cse29 .cse30 .cse31 (let ((.cse70 (+ ~local~0 2))) (and .cse48 .cse50 .cse43 (<= .cse70 ~token~0) .cse65 (= 0 ~t3_st~0) (<= ~token~0 .cse70))) .cse32 .cse34 (and (and .cse48 .cse43 (and .cse11 .cse65)) .cse52 .cse53) (and .cse67 .cse52 .cse53 .cse44) (and (and (and .cse2 .cse4 .cse59 .cse60 .cse7 .cse8 .cse9 .cse61 .cse63 .cse10) .cse64) .cse56 .cse50 .cse57 .cse43 .cse44) .cse1 (< |old(~local~0)| |old(~token~0)|) .cse13 .cse14 (and .cse48 .cse49 .cse66 .cse51 .cse52 .cse68 .cse12 .cse53 .cse44) (and .cse11 .cse50 .cse43 .cse71 .cse12) (and .cse66 .cse51 .cse52 (and .cse11 .cse72 .cse68 .cse12) .cse53) (and .cse19 .cse50 .cse43 .cse12 .cse44) .cse18 (and .cse48 .cse66 .cse69 .cse44) .cse20 (let ((.cse73 (+ ~local~0 3))) (and .cse48 (and (and .cse2 .cse4 .cse58 .cse5 .cse7 .cse9 .cse61 .cse63 .cse62) .cse64) (<= .cse73 ~token~0) .cse11 .cse50 (<= ~token~0 .cse73) .cse43)) .cse21 .cse23 (and .cse66 .cse55) (and .cse11 .cse50 .cse51 .cse52 .cse43 .cse72 .cse12 .cse53) (and .cse48 .cse66 .cse51 .cse52 (and .cse11 .cse54 .cse68 .cse12) .cse53) (and .cse48 .cse66 (and .cse11 .cse68 (and (and .cse7 .cse40 .cse41 .cse63) .cse64))) (not (= 0 |old(~t3_st~0)|)) .cse27 .cse28 (and .cse50 .cse51 .cse52 .cse43 .cse24 .cse53 .cse44) .cse33 (and .cse48 .cse22 .cse50 .cse43 .cse44) .cse35))) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse15 .cse18 .cse20 .cse21 (and .cse11 (and .cse2 .cse3 .cse59 .cse7 .cse40 .cse8 .cse9 .cse61 .cse10)) .cse23 .cse25 .cse46 .cse26 .cse39 .cse27 .cse47 .cse29 .cse31 .cse45 .cse32 .cse33 .cse34) (or .cse0 .cse1 .cse13 .cse36 .cse14 .cse42 .cse15 .cse18 .cse20 .cse21 .cse37 .cse23 .cse25 .cse46 .cse26 .cse39 .cse47 .cse27 .cse29 .cse31 .cse45 .cse32 .cse33 .cse34))))) [2018-11-10 02:10:54,879 INFO L421 ceAbstractionStarter]: At program point L386(line 386) the Hoare annotation is: (let ((.cse13 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse15 (= ~T2_E~0 0)) (.cse66 (= ~m_i~0 1)) (.cse12 (= ~T2_E~0 1)) (.cse24 (= ~T1_E~0 1))) (let ((.cse62 (not (= ~t2_pc~0 1))) (.cse65 (not .cse24)) (.cse3 (= |old(~E_1~0)| ~E_1~0)) (.cse41 (= ~m_st~0 0)) (.cse42 (not (= ~m_pc~0 1))) (.cse61 (<= |old(~E_3~0)| ~E_3~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~E_3~0)) (.cse63 (not .cse12)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (not (= ~E_2~0 1))) (.cse7 (<= ~t3_pc~0 0)) (.cse8 (and (and (and (not .cse13) (not .cse0) (not .cse15) .cse66 (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse64 (not (= ~M_E~0 1))) (.cse9 (= 1 ~m_pc~0)) (.cse60 (<= 2 ~E_1~0)) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse59 (not (= ~E_M~0 1))) (.cse11 (not (= 0 eval_~tmp~0))) (.cse31 (= |old(~t1_st~0)| 0)) (.cse43 (= 1 |old(~m_pc~0)|)) (.cse37 (= 1 |old(~t2_pc~0)|))) (let ((.cse14 (< |old(~m_st~0)| 2)) (.cse23 (not .cse37)) (.cse27 (not .cse43)) (.cse21 (< |old(~t3_st~0)| 2)) (.cse16 (= 1 ~M_E~0)) (.cse34 (not .cse31)) (.cse17 (= 1 |old(~E_2~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (= 0 |old(~E_2~0)|)) (.cse20 (< |old(~E_1~0)| 2)) (.cse32 (= |old(~t1_pc~0)| 1)) (.cse22 (= 1 |old(~E_M~0)|)) (.cse33 (and (and .cse2 .cse4 .cse63 .cse5 .cse6 .cse7 .cse8 .cse64 .cse9 .cse60 .cse10 .cse59) .cse11)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse25 (not .cse66)) (.cse40 (not (= 0 |old(~t2_st~0)|))) (.cse26 (< |old(~E_3~0)| 2)) (.cse28 (< 0 |old(~t3_pc~0)|)) (.cse29 (not (= 1 ~t2_i~0))) (.cse30 (= 0 |old(~E_M~0)|)) (.cse35 (and .cse62 .cse65 .cse3 .cse4 .cse41 .cse63 .cse42 .cse6 .cse61 .cse7 .cse8 .cse64 (= ~t2_i~0 1) .cse60 .cse10 .cse59)) (.cse1 (<= 2 ~t3_st~0)) (.cse38 (and .cse62 .cse63 .cse5 .cse6 .cse61 .cse7 .cse8 .cse64 .cse9 .cse60 .cse10)) (.cse36 (= eval_~tmp~0 1))) (and (or .cse0 (and .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 (< |old(~t2_st~0)| 2) (not .cse32) (not (= 1 |old(~t3_pc~0)|)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30) (or .cse0 (and .cse1 .cse33) .cse12 .cse13 .cse15 .cse16 .cse34 (and .cse1 .cse35 .cse36) .cse37 .cse17 .cse18 .cse19 .cse20 (and .cse1 .cse38 .cse36) .cse21 .cse22 .cse24 .cse39 .cse25 .cse40 .cse26 (and .cse1 (and .cse2 .cse3 .cse4 .cse41 .cse42 .cse6 .cse7 .cse8 .cse10) .cse36) .cse28 .cse29 .cse30 .cse43) (let ((.cse58 (= 1 ~t3_pc~0))) (let ((.cse53 (= ~t1_pc~0 1)) (.cse56 (and .cse6 .cse61 .cse4 (and .cse62 .cse65 .cse58 .cse63 .cse5 .cse8 .cse64 .cse9 .cse59) .cse60)) (.cse55 (= 0 ~t1_st~0))) (let ((.cse46 (and .cse38 .cse55 .cse36)) (.cse54 (and .cse6 .cse61 .cse3 (and .cse62 .cse58 .cse41 .cse63 .cse42 .cse8 .cse64 .cse59))) (.cse51 (not .cse55)) (.cse50 (and .cse1 .cse55 .cse36 .cse56)) (.cse44 (not .cse53)) (.cse52 (= ~token~0 |old(~token~0)|)) (.cse48 (<= ~token~0 ~local~0)) (.cse45 (not (= ~t2_st~0 0))) (.cse49 (<= ~local~0 ~token~0)) (.cse47 (= |old(~t3_st~0)| ~t3_st~0))) (or (and .cse44 .cse45 .cse46 .cse47) .cse0 .cse12 (< |old(~local~0)| |old(~token~0)|) (and .cse48 .cse45 .cse46 .cse49 .cse47) .cse13 .cse15 .cse16 .cse34 .cse37 (and .cse44 .cse45 .cse50) .cse17 (and .cse51 .cse52 .cse48 .cse53 .cse35 .cse45 .cse36 .cse49 .cse47) .cse18 (and .cse44 (and .cse54 .cse1 .cse55 .cse36) .cse52 .cse48 .cse45 .cse49) .cse19 (and .cse54 .cse1 .cse51 .cse52 .cse48 .cse53 .cse45 .cse36 .cse49) .cse20 (< |old(~token~0)| |old(~local~0)|) .cse32 (and .cse51 .cse53 .cse38 .cse45 .cse36 .cse47) (not (= 0 |old(~t3_st~0)|)) (and .cse1 .cse51 .cse53 .cse45 .cse36 .cse56) .cse22 (let ((.cse57 (+ ~local~0 1))) (and (<= ~token~0 .cse57) .cse1 .cse51 (<= .cse57 ~token~0) .cse53 (and .cse11 (and .cse6 .cse4 (and .cse2 .cse58 .cse5 .cse8 .cse9 .cse59) .cse60)) .cse45)) (and .cse51 .cse53 .cse45 .cse33 .cse47) .cse24 .cse39 .cse25 .cse40 .cse26 (and .cse48 .cse45 .cse50 .cse49) .cse28 .cse29 .cse30 (and .cse44 .cse52 .cse48 .cse35 .cse45 .cse55 .cse36 .cse49 .cse47) .cse43)))))))) [2018-11-10 02:10:54,885 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 270 277) no Hoare annotation was computed. [2018-11-10 02:10:54,885 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 270 277) the Hoare annotation is: true [2018-11-10 02:10:54,885 INFO L425 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-11-10 02:10:54,885 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 704) no Hoare annotation was computed. [2018-11-10 02:10:54,885 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 653 711) no Hoare annotation was computed. [2018-11-10 02:10:54,885 INFO L425 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-11-10 02:10:54,885 INFO L421 ceAbstractionStarter]: At program point L663(line 663) the Hoare annotation is: (let ((.cse0 (not (= ~t2_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T3_E~0)| ~T3_E~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse7 (= |old(~E_2~0)| ~E_2~0)) (.cse8 (= |old(~E_3~0)| ~E_3~0)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (<= ~t3_pc~0 0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (and .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (= ~token~0 |old(~token~0)|) .cse7 .cse8 .cse9 (= |old(~t3_st~0)| ~t3_st~0) .cse10 .cse11 .cse12 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~t3_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-10 02:10:54,885 INFO L421 ceAbstractionStarter]: At program point L661(line 661) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 02:10:54,885 INFO L421 ceAbstractionStarter]: At program point L661-1(line 661) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 02:10:54,887 INFO L421 ceAbstractionStarter]: At program point L690(line 690) the Hoare annotation is: (let ((.cse11 (= ~m_i~0 1))) (let ((.cse0 (<= 2 ~t3_st~0)) (.cse2 (not (= ~E_2~0 1))) (.cse3 (<= 2 ~E_3~0)) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse11) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse10 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (and .cse5 (<= ~t3_pc~0 0) .cse6 .cse7 .cse8 .cse9) .cse10 (= |old(~E_M~0)| ~E_M~0))) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse11) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse0 (not (= 0 ~t1_st~0)) (= ~t1_pc~0 1) (and .cse2 .cse3 (and .cse1 .cse4 (and .cse5 (= 1 ~t3_pc~0) .cse6 .cse7 .cse8 .cse9) (not (= ~E_M~0 1))) .cse10)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-10 02:10:54,888 INFO L421 ceAbstractionStarter]: At program point L690-1(line 690) the Hoare annotation is: (let ((.cse0 (<= 2 ~t3_st~0)) (.cse6 (not (= ~E_2~0 1))) (.cse2 (<= 2 ~E_3~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse7 (= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (= 1 ~m_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0))) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse9 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~t3_pc~0 0) .cse7 .cse8 .cse9 (= |old(~E_M~0)| ~E_M~0))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (and (<= 2 ~t2_st~0) .cse0 (not (= 0 ~t1_st~0)) (= ~t1_pc~0 1) (and .cse6 .cse2 (and .cse5 .cse1 (= 1 ~t3_pc~0) .cse7 .cse8 .cse3 .cse4 (not (= ~E_M~0 1))) .cse9)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-10 02:10:54,888 INFO L421 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: (let ((.cse11 (= ~m_i~0 1))) (let ((.cse0 (<= 2 ~t3_st~0)) (.cse2 (not (= ~E_2~0 1))) (.cse3 (<= 2 ~E_3~0)) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse11) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse10 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (and .cse5 (<= ~t3_pc~0 0) .cse6 .cse7 .cse8 .cse9) .cse10 (= |old(~E_M~0)| ~E_M~0))) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse11) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse0 (not (= 0 ~t1_st~0)) (= ~t1_pc~0 1) (and .cse2 .cse3 (and .cse1 .cse4 (and .cse5 (= 1 ~t3_pc~0) .cse6 .cse7 .cse8 .cse9) (not (= ~E_M~0 1))) .cse10)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-10 02:10:54,893 INFO L421 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (let ((.cse12 (= ~m_i~0 1))) (let ((.cse0 (<= 2 ~t3_st~0)) (.cse1 (not (= 0 ~t1_st~0))) (.cse3 (not (= ~E_2~0 1))) (.cse4 (<= 2 ~E_3~0)) (.cse2 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (= 1 ~m_pc~0)) (.cse9 (<= 2 ~m_st~0)) (.cse10 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse12) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse11 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (and .cse6 (<= ~t3_pc~0 0) .cse7 .cse8 .cse9 .cse10) .cse11 (= |old(~E_M~0)| ~E_M~0))) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse12) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse0 .cse1 (= ~t1_pc~0 1) (and .cse3 .cse4 (and .cse2 .cse5 (and .cse6 (= 1 ~t3_pc~0) .cse7 .cse8 .cse9 .cse10) (not (= ~E_M~0 1))) .cse11)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-10 02:10:54,893 INFO L421 ceAbstractionStarter]: At program point L680-1(line 680) the Hoare annotation is: (let ((.cse11 (= ~m_i~0 1))) (let ((.cse0 (<= 2 ~t3_st~0)) (.cse1 (not (= 0 ~t1_st~0))) (.cse5 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~E_3~0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse11) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse2 (not (= ~E_2~0 1))) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= 1 ~m_pc~0)) (.cse10 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (and (<= 2 ~t2_st~0) .cse0 .cse1 (= ~t1_pc~0 1) (and .cse2 .cse3 (and .cse4 .cse5 (= 1 ~t3_pc~0) .cse6 .cse7 .cse8 .cse9 (not (= ~E_M~0 1))) .cse10)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse11) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and .cse0 .cse1 (and .cse5 .cse3 .cse8 .cse9 .cse4 .cse2 (<= ~t3_pc~0 0) .cse6 .cse7 .cse10 (= |old(~E_M~0)| ~E_M~0))) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-10 02:10:54,895 INFO L421 ceAbstractionStarter]: At program point L676(line 676) the Hoare annotation is: (let ((.cse12 (= ~m_i~0 1))) (let ((.cse0 (<= 2 ~t3_st~0)) (.cse1 (not (= 0 ~t1_st~0))) (.cse3 (not (= ~E_2~0 1))) (.cse4 (<= 2 ~E_3~0)) (.cse2 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (= 1 ~m_pc~0)) (.cse9 (<= 2 ~m_st~0)) (.cse10 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse12) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse11 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (and .cse6 (<= ~t3_pc~0 0) .cse7 .cse8 .cse9 .cse10) .cse11 (= |old(~E_M~0)| ~E_M~0))) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse12) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse0 .cse1 (= ~t1_pc~0 1) (and .cse3 .cse4 (and .cse2 .cse5 (and .cse6 (= 1 ~t3_pc~0) .cse7 .cse8 .cse9 .cse10) (not (= ~E_M~0 1))) .cse11)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-10 02:10:54,895 INFO L425 ceAbstractionStarter]: For program point L676-1(line 676) no Hoare annotation was computed. [2018-11-10 02:10:54,896 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 653 711) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (<= ~token~0 ~local~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= 0 ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= ~t3_pc~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 02:10:54,897 INFO L421 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: (let ((.cse16 (= ~m_i~0 1))) (let ((.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (not (= ~E_2~0 1))) (.cse9 (<= ~t3_pc~0 0)) (.cse10 (not (= ~M_E~0 1))) (.cse13 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse16) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse7 (= |old(~T1_E~0)| ~T1_E~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse1 (and .cse4 .cse5 (<= |old(~E_3~0)| ~E_3~0) (= |old(~E_1~0)| ~E_1~0) (and (not (= ~t2_pc~0 1)) .cse9 (= ~m_st~0 0) .cse10 .cse13 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) .cse7 (not (= ~T2_E~0 1)) .cse15)) (.cse3 (<= 2 ~t3_st~0)) (.cse2 (= 0 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (<= 2 ~E_3~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse11 (= 1 ~m_pc~0)) (.cse12 (<= 2 ~m_st~0)) (.cse14 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (and (not .cse0) (and .cse1 .cse2) (= ~token~0 |old(~token~0)|) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= |old(~t3_st~0)| ~t3_st~0)) (= |old(~T2_E~0)| 0) (and .cse1 .cse3 .cse2) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse3 (and .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse16) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse3 (not .cse2) .cse0 (and .cse5 .cse6 (and .cse4 .cse7 (and .cse8 (= 1 ~t3_pc~0) .cse10 .cse11 .cse12 .cse13) (not (= ~E_M~0 1))) .cse14)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))))) [2018-11-10 02:10:54,897 INFO L425 ceAbstractionStarter]: For program point L672-1(line 672) no Hoare annotation was computed. [2018-11-10 02:10:54,898 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 705) no Hoare annotation was computed. [2018-11-10 02:10:54,898 INFO L421 ceAbstractionStarter]: At program point L668-2(lines 665 705) the Hoare annotation is: (let ((.cse16 (= ~m_i~0 1))) (let ((.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (not (= ~E_2~0 1))) (.cse9 (<= ~t3_pc~0 0)) (.cse10 (not (= ~M_E~0 1))) (.cse13 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse16) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse7 (= |old(~T1_E~0)| ~T1_E~0)) (.cse15 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse1 (and .cse4 .cse5 (<= |old(~E_3~0)| ~E_3~0) (= |old(~E_1~0)| ~E_1~0) (and (not (= ~t2_pc~0 1)) .cse9 (= ~m_st~0 0) .cse10 .cse13 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) .cse7 (not (= ~T2_E~0 1)) .cse15)) (.cse3 (<= 2 ~t3_st~0)) (.cse2 (= 0 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (<= 2 ~E_3~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse11 (= 1 ~m_pc~0)) (.cse12 (<= 2 ~m_st~0)) (.cse14 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (and (not .cse0) (and .cse1 .cse2) (= ~token~0 |old(~token~0)|) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= |old(~t3_st~0)| ~t3_st~0)) (= |old(~T2_E~0)| 0) (and .cse1 .cse3 .cse2) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse3 (and .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse16) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse3 (not .cse2) .cse0 (and .cse5 .cse6 (and .cse4 .cse7 (and .cse8 (= 1 ~t3_pc~0) .cse10 .cse11 .cse12 .cse13) (not (= ~E_M~0 1))) .cse14)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))))) [2018-11-10 02:10:54,900 INFO L421 ceAbstractionStarter]: At program point L664(line 664) the Hoare annotation is: (let ((.cse0 (not (= ~t2_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T3_E~0)| ~T3_E~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse7 (= |old(~E_2~0)| ~E_2~0)) (.cse8 (= 0 ~t1_st~0)) (.cse9 (= |old(~E_3~0)| ~E_3~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~t3_pc~0 0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~t3_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (= ~token~0 |old(~token~0)|) .cse7 .cse8 .cse9 .cse10 (= |old(~t3_st~0)| ~t3_st~0) .cse11 .cse12 (<= ~local~0 ~token~0)) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-10 02:10:54,900 INFO L421 ceAbstractionStarter]: At program point L662(line 662) the Hoare annotation is: (let ((.cse0 (not (= ~t2_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T3_E~0)| ~T3_E~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse7 (= |old(~E_2~0)| ~E_2~0)) (.cse8 (= |old(~E_3~0)| ~E_3~0)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (<= ~t3_pc~0 0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= |old(~M_E~0)| ~M_E~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (and .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (= ~token~0 |old(~token~0)|) .cse7 .cse8 .cse9 (= |old(~t3_st~0)| ~t3_st~0) .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~t3_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-10 02:10:54,901 INFO L421 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse0 (<= 2 ~t3_st~0)) (.cse6 (not (= ~E_2~0 1))) (.cse2 (<= 2 ~E_3~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse7 (= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (= 1 ~m_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0))) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse9 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~t3_pc~0 0) .cse7 .cse8 .cse9 (= |old(~E_M~0)| ~E_M~0))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (and (<= 2 ~t2_st~0) .cse0 (not (= 0 ~t1_st~0)) (= ~t1_pc~0 1) (and .cse6 .cse2 (and .cse5 .cse1 (= 1 ~t3_pc~0) .cse7 .cse8 .cse3 .cse4 (not (= ~E_M~0 1))) .cse9)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-10 02:10:54,901 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 696) no Hoare annotation was computed. [2018-11-10 02:10:54,901 INFO L421 ceAbstractionStarter]: At program point L687-1(lines 687 696) the Hoare annotation is: (let ((.cse11 (= ~m_i~0 1))) (let ((.cse0 (<= 2 ~t3_st~0)) (.cse2 (not (= ~E_2~0 1))) (.cse3 (<= 2 ~E_3~0)) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse11) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse10 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (and .cse5 (<= ~t3_pc~0 0) .cse6 .cse7 .cse8 .cse9) .cse10 (= |old(~E_M~0)| ~E_M~0))) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse11) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (and (<= 2 ~t2_st~0) .cse0 (not (= 0 ~t1_st~0)) (= ~t1_pc~0 1) (and .cse2 .cse3 (and .cse1 .cse4 (and .cse5 (= 1 ~t3_pc~0) .cse6 .cse7 .cse8 .cse9) (not (= ~E_M~0 1))) .cse10)) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-10 02:10:54,903 INFO L425 ceAbstractionStarter]: For program point L685(line 685) no Hoare annotation was computed. [2018-11-10 02:10:54,903 INFO L421 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (let ((.cse0 (<= 2 ~t3_st~0)) (.cse6 (not (= ~E_2~0 1))) (.cse2 (<= 2 ~E_3~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse7 (= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (= 1 ~m_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (and (not (= ~E_3~0 0)) (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0))) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))))) (.cse9 (<= 2 ~E_1~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T3_E~0)| 0) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~t3_pc~0 0) .cse7 .cse8 .cse9 (= |old(~E_M~0)| ~E_M~0))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~E_1~0)| 2) (and (<= 2 ~t2_st~0) .cse0 (not (= 0 ~t1_st~0)) (= ~t1_pc~0 1) (and .cse6 .cse2 (and .cse5 .cse1 (= 1 ~t3_pc~0) .cse7 .cse8 .cse3 .cse4 (not (= ~E_M~0 1))) .cse9)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (not (= 0 |old(~t3_st~0)|)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_3~0)| 2) (< 0 |old(~t3_pc~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-10 02:10:54,903 INFO L428 ceAbstractionStarter]: At program point L706(lines 653 711) the Hoare annotation is: true [2018-11-10 02:10:54,903 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:10:54,903 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t2_pc~0 1)) (not (= ~t1_pc~0 1)) (<= 2 ~E_3~0) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~T2_E~0 1)) (not (= ~E_M~0 0)) (not (= ~m_pc~0 1)) (not (= ~E_2~0 1)) (not (= ~t2_i~0 1)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)) (not (= ~T1_E~0 1)) (= 0 ~t1_st~0) (= 0 ~t3_st~0) (= 0 ~t2_st~0) (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (<= ~t3_pc~0 0) (<= ~local~0 ~token~0)) [2018-11-10 02:10:54,903 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 02:10:54,903 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 02:10:54,906 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 622 633) no Hoare annotation was computed. [2018-11-10 02:10:54,906 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 622 633) no Hoare annotation was computed. [2018-11-10 02:10:54,906 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 622 633) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< ~local~0 ~token~0) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (= ~T3_E~0 0) (= ~T2_E~0 0) (= 1 ~M_E~0) (not (= ~t1_st~0 0)) (= |old(~m_i~0)| 1) (= 1 ~t2_pc~0) (= 1 ~E_2~0) (= 0 ~E_2~0) (< ~E_1~0 2) (= 1 |old(~t2_i~0)|) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (not (= 0 ~t3_st~0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (not (= 0 ~t2_st~0)) (< ~E_3~0 2) (< 0 ~t3_pc~0) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2018-11-10 02:10:55,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:10:55 BoogieIcfgContainer [2018-11-10 02:10:55,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:10:55,036 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:10:55,036 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:10:55,036 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:10:55,037 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:08:45" (3/4) ... [2018-11-10 02:10:55,040 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit3 [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-10 02:10:55,046 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit3_triggered [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-10 02:10:55,047 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-10 02:10:55,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-10 02:10:55,055 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-10 02:10:55,056 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 02:10:55,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T3_E) == 0) || (((((!(t1_pc == 1) && (((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && (((((!(t2_pc == 1) && t3_pc <= 0) && m_st == 0) && !(M_E == 1)) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(T2_E == 1)) && \old(E_M) == E_M) && 0 == t1_st) && token == \old(token)) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || \old(T2_E) == 0) || (((((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && (((((!(t2_pc == 1) && t3_pc <= 0) && m_st == 0) && !(M_E == 1)) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(T2_E == 1)) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t1_st)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || (2 <= t3_st && (((((\old(T2_E) == T2_E && !(E_2 == 1)) && 2 <= E_3) && \old(T1_E) == T1_E) && ((((1 == t2_pc && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && \old(E_M) == E_M)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || ((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && t1_pc == 1) && ((!(E_2 == 1) && 2 <= E_3) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((1 == t2_pc && 1 == t3_pc) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= E_1)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) [2018-11-10 02:10:55,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(m_pc == 1)) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && \old(E_M) == E_M) && 2 <= t3_st) && tmp == 1)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || (((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 2 <= t3_st) && tmp == 1)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((!(T1_E == 1) && 1 == t2_pc) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == tmp)) && 2 <= t3_st)) || \old(E_1) < 2) || (2 <= t3_st && ((((((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || \old(t3_st) < 2) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(t1_st) == t1_st) && t1_pc == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(t3_st) < 2) || ((2 <= t3_st && t1_i == 1) && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || ((2 <= t3_st && t1_i == 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= t2_st && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && token == \old(token)) && token <= local) && t1_pc == 1) && tmp == 1) && local <= token) && \old(t3_st) == t3_st) || T1_E == 0) || ((((((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && token == \old(token)) && ((((!(E_2 == 1) && ((((((1 == t2_pc && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && 2 <= E_1) && token <= local) && t1_pc == 1) && tmp == 1) && local <= token)) || 1 == M_E) || !(\old(t1_st) == 0)) || ((token <= local && ((2 <= t3_st && (((!(E_2 == 1) && (((((((!(t2_pc == 1) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(E_3) <= E_3) && 2 <= E_3) && 2 <= E_1) && 0 == t1_st) && tmp == 1) && local <= token)) || 1 == \old(t2_pc)) || (((((token <= local + 1 && 2 <= t3_st) && !(0 == t1_st)) && local + 1 <= token) && t1_pc == 1) && (((!(E_2 == 1) && 2 <= E_3) && (((((1 == t2_pc && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || ((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && t1_pc == 1) && (((!(E_2 == 1) && 2 <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || \old(token) < \old(local)) || ((!(t1_pc == 1) && ((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && \old(t3_st) == t3_st)) || \old(t1_pc) == 1) || ((((((!(t1_pc == 1) && token == \old(token)) && token <= local) && ((((((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && local <= token) && \old(t3_st) == t3_st)) || ((((2 <= t2_st && token <= local) && 0 == t1_st && !(0 == tmp) && (((((((((((1 == t2_pc && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && local <= token) && \old(t3_st) == t3_st)) || 1 == \old(E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || ((((((2 <= t2_st && !(0 == t1_st)) && t1_pc == 1) && local + 2 <= token) && (((!(E_2 == 1) && 2 <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp)) && 0 == t3_st) && token <= local + 2)) || 0 < \old(t3_pc)) || 0 == \old(E_M)) || ((((2 <= t2_st && t1_pc == 1) && 2 <= t3_st && (((!(E_2 == 1) && 2 <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp)) && token <= local) && local <= token)) || ((((((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || (((((((((((((((1 == t2_pc && 2 <= E_3) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp)) && token <= local + 1) && !(0 == t1_st)) && local + 1 <= token) && t1_pc == 1) && \old(t3_st) == t3_st)) || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || ((((((((2 <= t2_st && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(t1_pc == 1)) && token == \old(token)) && token <= local) && 0 == t1_st) && tmp == 1) && local <= token) && \old(t3_st) == t3_st)) || ((((2 <= t3_st && !(0 == t1_st)) && t1_pc == 1) && (((!(E_2 == 1) && (((((((!(t2_pc == 1) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(E_3) <= E_3) && 2 <= E_3) && 2 <= E_1) && tmp == 1)) || ((((!(t1_pc == 1) && token == \old(token)) && token <= local) && ((2 <= t3_st && ((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && (((((((!(t2_pc == 1) && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && 2 <= E_1) && 0 == t1_st) && tmp == 1) && local <= token)) || (((((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && t1_pc == 1) && tmp == 1) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || (((2 <= t2_st && !(t1_pc == 1)) && 0 == t1_st && !(0 == tmp) && (((((((((((1 == t2_pc && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && \old(t3_st) == t3_st)) || !(1 == t1_i)) || ((((((2 <= t2_st && ((((((((1 == t2_pc && 2 <= E_3) && 1 == t3_pc) && m_st == 0) && !(E_2 == 1)) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && local + 3 <= token) && 2 <= t3_st) && !(0 == t1_st)) && token <= local + 3) && t1_pc == 1)) || 0 == \old(E_2)) || \old(E_1) < 2) || (!(t1_pc == 1) && ((2 <= t3_st && (((!(E_2 == 1) && (((((((!(t2_pc == 1) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(E_3) <= E_3) && 2 <= E_3) && 2 <= E_1) && 0 == t1_st) && tmp == 1)) || (((((((2 <= t3_st && !(0 == t1_st)) && token == \old(token)) && token <= local) && t1_pc == 1) && ((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && (((((((!(t2_pc == 1) && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && 2 <= E_1) && tmp == 1) && local <= token)) || (((((2 <= t2_st && !(t1_pc == 1)) && token == \old(token)) && token <= local) && ((2 <= t3_st && ((((!(E_2 == 1) && ((((((1 == t2_pc && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && 2 <= E_1) && 0 == t1_st) && tmp == 1) && local <= token)) || ((2 <= t2_st && !(t1_pc == 1)) && (2 <= t3_st && 0 == t1_st) && (((!(E_2 == 1) && \old(E_3) <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || !(0 == \old(t3_st))) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(0 == t1_st) && token == \old(token)) && token <= local) && t1_pc == 1) && ((((((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && local <= token) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || ((((2 <= t2_st && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == tmp)) && !(0 == t1_st)) && t1_pc == 1) && \old(t3_st) == t3_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (2 <= t3_st && (((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= m_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && \old(E_M) == E_M)) || \old(E_1) < 2) || \old(t3_st) < 2) || ((2 <= t3_st && t1_i == 1) && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || ((2 <= t3_st && t1_i == 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || \old(t1_st) == t1_st) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t3_st) < 2) || ((2 <= t3_st && t1_i == 1) && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((2 <= t3_st && t1_i == 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 02:10:55,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && t1_pc == 1) && ((!(E_2 == 1) && 2 <= E_3) && ((((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && !(E_M == 1)) && 2 <= E_1)) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || ((2 <= t3_st && !(0 == t1_st)) && (((((((1 == t2_pc && 2 <= E_3) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M)) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(t3_st) < 2) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || ((2 <= t3_st && !(0 == t1_st)) && (((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && \old(E_M) == E_M)) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && ((((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && !(E_M == 1)) && \old(t1_st) == t1_st) && t1_pc == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 02:10:55,081 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-11-10 02:10:55,081 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || (((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || (((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((2 <= m_st && t2_st == \old(t2_st)) && 2 <= E_1) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || (((((((2 <= m_st && t2_st == \old(t2_st)) && token <= local) && 2 <= E_1) && 0 == t1_st) && \old(t3_st) == t3_st) && 1 == m_pc) && local <= token)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || ((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && t2_st == \old(t2_st)) && !(M_E == 1)) && 2 <= E_1) && \old(t3_st) == t3_st) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && t1_pc == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && 2 <= E_1) && !(E_2 == 0)) && 2 <= t3_st) && t1_i == 1) && 0 == t1_st) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || ((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && t2_st == \old(t2_st)) && !(M_E == 1)) && 2 <= E_1) && \old(t3_st) == t3_st) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && t1_pc == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && 2 <= E_1) && !(E_2 == 0)) && 2 <= t3_st) && t1_i == 1) && 0 == t1_st) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && 0 == t1_st) && 1 == m_pc)) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || (((((2 <= m_st && t2_st == \old(t2_st)) && 2 <= E_1) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && 0 == t1_st) && 1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= m_st && t2_st == \old(t2_st)) && 2 <= E_1) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || (((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && local <= token)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 2 || 0 == t2_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-11-10 02:10:55,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) [2018-11-10 02:10:55,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || (((((!(t1_pc == 1) && token <= local) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st))) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || (((((!(t1_pc == 1) && token <= local) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st))) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((((2 <= t2_st && (((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && \old(t1_st) == t1_st) && 1 == m_pc))) && t1_i == 1) && t2_st == \old(t2_st)) && 0 == t3_st) && \old(t3_st) == t3_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || 0 == t2_st) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st)) && \old(t3_st) == t3_st)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == m_pc)) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st)) && token <= \old(token) + 1) && local + 1 <= token) && t1_pc == 1) && \old(t3_st) == t3_st)) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((((2 <= t2_st && (((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && \old(t1_st) == t1_st) && 1 == m_pc))) && t1_i == 1) && t2_st == \old(t2_st)) && 0 == t3_st) && \old(t3_st) == t3_st))) && (((((((((((((((((((((T1_E == 0 || (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st) || (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) && 0 == t2_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || ((((token <= \old(token) + 1 && local + 1 <= token) && t1_pc == 1) && (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st))) && \old(t3_st) == t3_st)) || \old(t2_st) < 2) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((!(t1_pc == 1) && token <= local) && t2_st == \old(t2_st)) && local <= token) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st))) && \old(t3_st) == t3_st)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || (((((!(t1_pc == 1) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st))) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) [2018-11-10 02:10:55,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || (((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st)) && 0 == t2_st)) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || ((((((2 <= m_st && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == t2_st)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token)) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) [2018-11-10 02:10:55,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((m_st == 0 && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || (((2 <= m_st && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || 0 == t2_st) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == m_pc)) || !(1 == t1_i)) || (((2 <= m_st && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 0 == t2_st) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || (((m_st == 0 && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) [2018-11-10 02:10:55,084 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || \old(E_3) <= E_3) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || \old(t1_st) == t1_st) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((2 <= E_3 && 2 <= m_st) && t2_st == \old(t2_st)) && token <= local + 2) && 0 == t3_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || ((((2 <= E_3 && 2 <= m_st) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((2 <= E_3 && 2 <= t3_st) && \old(t1_st) == t1_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((2 <= E_3 && 2 <= t3_st) && 0 == t1_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0))) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || (((((2 <= m_st && t2_st == \old(t2_st)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || ((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || ((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || (\old(E_3) <= E_3 && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || ((((2 <= E_3 && 2 <= m_st) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || (((((2 <= m_st && t2_st == \old(t2_st)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || E_1 < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || (((2 <= E_3 && 2 <= t3_st) && 2 <= m_st) && \old(t1_st) == t1_st)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || (((2 <= E_3 && 2 <= t3_st) && 2 <= m_st) && 0 == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) [2018-11-10 02:10:55,092 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && 2 <= t3_st) && 0 == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t3_st) < 2) || ((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || (((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || (((((((2 <= E_3 && 2 <= m_st) && token <= local + 2) && 1 == t2_pc) && 0 == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || (((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || (((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || ((((2 <= E_3 && m_st == 0) && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((2 <= E_3 && m_st == 0) && 1 == t2_pc) && 2 <= t3_st) && 0 == t1_st)) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || (\old(E_3) <= E_3 && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || (((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || (\old(E_3) <= E_3 && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || (((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) [2018-11-10 02:10:55,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || ((((2 <= m_st && 1 == t2_pc) && 2 <= t3_st) && \old(E_3) == E_3) && \old(t1_st) == t1_st)) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || (((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || ((((m_st == 0 && 1 == t2_pc) && 2 <= t3_st) && \old(E_3) == E_3) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) [2018-11-10 02:10:55,102 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || (((\old(t3_st) == t3_st && (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) || ((((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && ((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) || (((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || ((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && ((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) || (((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && token <= local) && ((((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)) || (((((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)))) && local <= token) && \old(E_M) == E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || (((((((((((((((1 == t2_pc && !(T2_E == 0)) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_3 == 0)) && !(E_2 == 0)) || ((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || (((((((((((((((1 == t2_pc && !(T2_E == 0)) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_3 == 0)) && !(E_2 == 0)) || ((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((token == \old(token) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((2 <= m_st && 0 == t2_st) && t3_pc <= 0) || ((1 == t3_pc && 2 <= m_st) && 0 == t2_st))) && \old(E_M) == E_M)) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((\old(t3_st) == t3_st && ((((((((!(t2_pc == 1) && !(T2_E == 0)) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_2 == 0)) || (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((\old(t3_st) == t3_st && ((((((((!(t2_pc == 1) && !(T2_E == 0)) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_2 == 0)) || (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || ((((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && \old(token) + 1 <= token) && token <= \old(token) + 1) && \old(t1_st) == t1_st) && (((1 == t3_pc && m_st == 0) && !(E_M == 0)) || ((m_st == 0 && !(E_M == 0)) && t3_pc <= 0))) && !(E_M == 1))) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || ((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && ((((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)) || (((((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)))) && !(E_M == 1))) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((\old(t3_st) == t3_st && (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) || ((((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0))) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || (((\old(t3_st) == t3_st && (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) || ((((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 02:10:55,110 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || (((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || E_1 < 2) || \old(t2_st) < 2) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || \old(t2_st) < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 02:10:55,114 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 02:10:55,183 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e63d6cf9-54d3-4fb1-a1bb-d6414fa7ee2a/bin-2019/uautomizer/witness.graphml [2018-11-10 02:10:55,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:10:55,184 INFO L168 Benchmark]: Toolchain (without parser) took 130284.57 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 959.2 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-11-10 02:10:55,184 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:10:55,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 02:10:55,185 INFO L168 Benchmark]: Boogie Preprocessor took 68.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -222.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-10 02:10:55,185 INFO L168 Benchmark]: RCFGBuilder took 477.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2018-11-10 02:10:55,185 INFO L168 Benchmark]: TraceAbstraction took 129389.19 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-11-10 02:10:55,185 INFO L168 Benchmark]: Witness Printer took 146.92 ms. Allocated memory is still 4.6 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 72.9 MB). Peak memory consumption was 72.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:10:55,187 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -222.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 477.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 129389.19 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 146.92 ms. Allocated memory is still 4.6 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 72.9 MB). Peak memory consumption was 72.9 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: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || ((((2 <= m_st && 1 == t2_pc) && 2 <= t3_st) && \old(E_3) == E_3) && \old(t1_st) == t1_st)) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || (((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || ((((((2 <= m_st && t2_st == \old(t2_st)) && 1 == t2_pc) && token == \old(token)) && \old(E_3) == E_3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || ((((m_st == 0 && 1 == t2_pc) && 2 <= t3_st) && \old(E_3) == E_3) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || (((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || (((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((2 <= m_st && t2_st == \old(t2_st)) && 2 <= E_1) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || (((((((2 <= m_st && t2_st == \old(t2_st)) && token <= local) && 2 <= E_1) && 0 == t1_st) && \old(t3_st) == t3_st) && 1 == m_pc) && local <= token)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || ((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && t2_st == \old(t2_st)) && !(M_E == 1)) && 2 <= E_1) && \old(t3_st) == t3_st) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && t1_pc == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && 2 <= E_1) && !(E_2 == 0)) && 2 <= t3_st) && t1_i == 1) && 0 == t1_st) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || ((((((((((!(T2_E == 0) && !(T2_E == 1)) && 2 <= m_st) && t2_st == \old(t2_st)) && !(M_E == 1)) && 2 <= E_1) && \old(t3_st) == t3_st) && !(T3_E == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((((((((((((((!(T2_E == 0) && 1 == t3_pc) && !(T2_E == 1)) && t1_pc == 1) && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(M_E == 1)) && token <= local) && 2 <= E_1) && !(E_2 == 0)) && 2 <= t3_st) && t1_i == 1) && 0 == t1_st) && \old(t3_st) == t3_st) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && 0 == t1_st) && 1 == m_pc)) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || (((((2 <= m_st && t2_st == \old(t2_st)) && 2 <= E_1) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || ((((2 <= m_st && 2 <= E_1) && 2 <= t3_st) && 0 == t1_st) && 1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= m_st && t2_st == \old(t2_st)) && 2 <= E_1) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || (((((2 <= m_st && 2 <= E_1) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && \old(t3_st) == t3_st) && 1 == m_pc) && local <= token)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 2 || 0 == t2_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((0 == __retres1 || t2_st < 2) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t1_pc == 1) || !(0 == t3_st)) || !(t1_st == 0)) && (((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || local < token) || 0 == __retres1) || !(t1_pc == 1)) || token < local) || !(1 == t1_i)) || t3_st < 2)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || t1_st == 0) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((E_3 < 2 || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t3_st < 2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == __retres1) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || token < local + 3)) && (((((((E_3 < 2 || 0 == __retres1) || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || !(t1_st == 0))) && (((((((E_3 < 2 || 1 == E_2) || !(t1_pc == 1)) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t1_st == 0) || !(0 == t3_st)) || 0 == __retres1)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || 0 == __retres1) || !(0 == t3_st))) && ((((((((E_3 < 2 || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || local < token) || !(t1_pc == 1)) || token < local) || !(1 == t1_i)) || t3_st < 2) || 0 == __retres1)) && ((((((((E_3 < 2 || 1 == E_2) || local < token) || 0 == __retres1) || token < local) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((E_3 < 2 || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || t1_st == 0) || 0 == __retres1)) && ((((((((t2_st < 2 || 0 == __retres1) || E_3 < 2) || 1 == E_2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || t3_st < 2) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || 0 == __retres1) || local < token) || token < local) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((E_3 < 2 || 0 == __retres1) || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t1_pc == 1) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || local < token) || !(t1_pc == 1)) || token < local) || !(1 == t1_i)) || t3_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == __retres1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == __retres1) || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t1_st == 0) || 0 == __retres1) || !(0 == t3_st))) && ((0 == __retres1 || (((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(1 == t1_i))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || 0 == __retres1)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || 0 == __retres1)) && (((((0 == __retres1 || E_3 < 2) || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t3_st < 2) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || (((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && t2_st == \old(t2_st)) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || E_1 < 2) || \old(t2_st) < 2) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || ((((((1 == t3_pc && m_st == 0) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || ((((((1 == t3_pc && 2 <= m_st) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || ((((((1 == t3_pc && m_st == 0) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && 0 == t2_st) && \old(t1_st) == t1_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || (((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && \old(t1_st) == t1_st)) || \old(t2_st) < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && 2 <= t3_st) && token == \old(token)) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || ((((((1 == t3_pc && 2 <= m_st) && t2_st == \old(t2_st)) && \old(E_M) == E_M) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || token < local + 1) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || local + 1 < token) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 0 == __retres1) || token < local + 1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || local + 1 < token) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || 0 == __retres1) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || t2_st < 2) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || token < local + 3)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || T1_E == 1) || 0 == __retres1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == __retres1) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == __retres1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 0) || 0 == __retres1) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == __retres1) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 == __retres1) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || t1_st == 0) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || 0 == __retres1) || T2_E == 0) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 == __retres1) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || 0 == __retres1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == __retres1) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) && ((((((token < local + 1 || (((((((((((((((E_1 < 2 || T1_E == 0) || !(1 == E_2)) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || !(t1_pc == 1)) || !(1 == t1_i)) || local + 1 < token) || !(0 == t3_st)) || 0 == __retres1)) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t1_st == 0) || 0 == __retres1) || !(0 == t3_st))) && ((((t2_st < 2 || !(t1_pc == 1)) || !(1 == t1_i)) || ((((((((((((((((E_1 < 2 || T1_E == 0) || !(1 == E_2)) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == __retres1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || 0 == __retres1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || token < local + 3)) && (((((((E_3 < 2 || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_pc == 1)) || 0 == __retres1) || !(1 == t1_i)) || t3_st < 2) || t1_st == 0)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 0) || m_st < 2) || t3_st < 2) || 0 == __retres1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 == __retres1) || t1_pc == 1) || t3_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(t1_st == 0))) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1) || !(1 == t1_i))) && (((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || !(1 == t1_i)) || t3_st < 2)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(1 == t1_i)) || 0 == __retres1)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || E_1 < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || 0 == __retres1) || t3_st < 2) || t1_st == 0)) && ((((0 == __retres1 || ((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || !(0 == t3_st))) && (((((0 == __retres1 || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t3_st < 2)) && ((!(1 == t1_i) || 0 == __retres1) || ((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t3_st < 2)) && ((((((((0 == __retres1 || E_3 < 2) || 1 == E_2) || local < token) || token < local) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || !(0 == t3_st)) || !(t1_st == 0))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == __retres1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((0 == __retres1 || E_3 < 2) || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t1_pc == 1) || !(0 == t3_st)) || !(t1_st == 0))) && (((((((0 == __retres1 || E_3 < 2) || 1 == E_2) || !(t1_pc == 1)) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t1_st == 0) || !(0 == t3_st))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || 0 == __retres1) || T2_E == 0) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((E_3 < 2 || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1) || !(1 == t1_i)) || t1_pc == 1) || t3_st < 2) || !(t1_st == 0))) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == __retres1) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((0 == __retres1 || E_3 < 2) || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t1_i)) || t3_st < 2)) && ((((((((0 == __retres1 || t2_st < 2) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t1_pc == 1) || !(0 == t3_st)) || !(t1_st == 0))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || 0 == __retres1) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || local < token) || !(t1_pc == 1)) || token < local) || !(1 == t1_i)) || t3_st < 2) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc == 1)) || !(1 == t1_i)) || 0 == __retres1)) && (((((((((0 == __retres1 || t2_st < 2) || E_3 < 2) || 1 == E_2) || local < token) || token < local) || !(1 == t1_i)) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(0 == t3_st)) || !(t1_st == 0))) && ((((((((0 == __retres1 || E_3 < 2) || 1 == E_2) || (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || local < token) || token < local) || !(1 == t1_i)) || t3_st < 2) || !(t1_st == 0))) && ((0 == __retres1 || ((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(1 == t1_i))) && ((((((((t2_st < 2 || E_3 < 2) || 1 == E_2) || !(t1_pc == 1)) || 0 == __retres1) || !(1 == t1_i)) || t3_st < 2) || t1_st == 0) || ((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((t2_st < 2 || !(t1_pc == 1)) || !(1 == t1_i)) || (((((((((((((((E_1 < 2 || T1_E == 0) || !(1 == E_2)) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || !(0 == t3_st)) || 0 == __retres1)) && (((((token < local + 1 || !(t1_pc == 1)) || ((((((((((((((((E_1 < 2 || T1_E == 0) || !(1 == E_2)) || T2_E == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || !(1 == t1_i)) || 0 == __retres1) || local + 1 < token) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || (((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st)) && 0 == t2_st)) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || ((((((2 <= m_st && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == t2_st)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || (((((((m_st == 0 && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((((m_st == 0 && t1_pc == 1) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((t1_pc == 1 && 2 <= m_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && !(0 == t1_st)) && 0 == t2_st) && \old(t3_st) == t3_st) && local + 1 <= token)) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || ((((((2 <= m_st && t1_pc == 1) && t2_st == \old(t2_st)) && !(E_2 == 1)) && !(E_2 == 0)) && !(0 == t1_st)) && \old(t3_st) == t3_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((m_st == 0 && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || (((2 <= m_st && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || 0 == t2_st) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == m_pc)) || !(1 == t1_i)) || (((2 <= m_st && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((t1_pc == 1 && 2 <= m_st) && t2_st == \old(t2_st)) && token == \old(token)) && \old(E_2) == E_2) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((t1_pc == 1 && 2 <= m_st) && \old(E_2) == E_2) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 0 == t2_st) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || (((m_st == 0 && 2 <= t3_st) && \old(E_2) == E_2) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && t1_pc == 1) && ((!(E_2 == 1) && 2 <= E_3) && ((((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && !(E_M == 1)) && 2 <= E_1)) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || ((2 <= t3_st && !(0 == t1_st)) && (((((((1 == t2_pc && 2 <= E_3) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M)) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(t3_st) < 2) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || ((2 <= t3_st && !(0 == t1_st)) && (((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && \old(E_M) == E_M)) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && ((((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && !(E_M == 1)) && \old(t1_st) == t1_st) && t1_pc == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T3_E) == 0) || (((((!(t1_pc == 1) && (((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && (((((!(t2_pc == 1) && t3_pc <= 0) && m_st == 0) && !(M_E == 1)) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(T2_E == 1)) && \old(E_M) == E_M) && 0 == t1_st) && token == \old(token)) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || \old(T2_E) == 0) || (((((((((\old(T2_E) == T2_E && !(E_2 == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && (((((!(t2_pc == 1) && t3_pc <= 0) && m_st == 0) && !(M_E == 1)) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(T2_E == 1)) && \old(E_M) == E_M) && 2 <= t3_st) && 0 == t1_st)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || (2 <= t3_st && (((((\old(T2_E) == T2_E && !(E_2 == 1)) && 2 <= E_3) && \old(T1_E) == T1_E) && ((((1 == t2_pc && t3_pc <= 0) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && \old(E_M) == E_M)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(token) < \old(local)) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || ((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && t1_pc == 1) && ((!(E_2 == 1) && 2 <= E_3) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((1 == t2_pc && 1 == t3_pc) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_3 == 0) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= E_1)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && 2 <= t3_st) && 0 == t1_st)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t3_st) < 2) || ((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || (((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || (((((((2 <= E_3 && 2 <= m_st) && token <= local + 2) && 1 == t2_pc) && 0 == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || (((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || (((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || ((((2 <= E_3 && m_st == 0) && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((2 <= E_3 && m_st == 0) && 1 == t2_pc) && 2 <= t3_st) && 0 == t1_st)) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || (\old(E_3) <= E_3 && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || ((((((2 <= m_st && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || (((((2 <= m_st && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || (\old(E_3) <= E_3 && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || ((((((m_st == 0 && 1 == t2_pc) && token == \old(token)) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || (((((2 <= E_3 && 2 <= m_st) && 1 == t2_pc) && \old(t3_st) == t3_st) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || (((\old(t3_st) == t3_st && (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) || ((((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && ((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) || (((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || ((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && ((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) || (((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && token <= local) && ((((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)) || (((((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)))) && local <= token) && \old(E_M) == E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || (((((((((((((((1 == t2_pc && !(T2_E == 0)) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_3 == 0)) && !(E_2 == 0)) || ((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || (((((((((((((((1 == t2_pc && !(T2_E == 0)) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_3 == 0)) && !(E_2 == 0)) || ((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && m_i == 1) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0))) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((token == \old(token) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && (((2 <= m_st && 0 == t2_st) && t3_pc <= 0) || ((1 == t3_pc && 2 <= m_st) && 0 == t2_st))) && \old(E_M) == E_M)) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((\old(t3_st) == t3_st && ((((((((!(t2_pc == 1) && !(T2_E == 0)) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_2 == 0)) || (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || (((((\old(t3_st) == t3_st && ((((((((!(t2_pc == 1) && !(T2_E == 0)) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && !(E_2 == 0)) || (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && m_st == 0) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_2 == 0)))) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((((((T1_E == 0 || ((((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && \old(token) + 1 <= token) && token <= \old(token) + 1) && \old(t1_st) == t1_st) && (((1 == t3_pc && m_st == 0) && !(E_M == 0)) || ((m_st == 0 && !(E_M == 0)) && t3_pc <= 0))) && !(E_M == 1))) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || ((((t2_st == \old(t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && ((((((((((((1 == t2_pc && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)) || (((((((((((1 == t2_pc && !(T2_E == 0)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) && !(E_3 == 0)) && t2_i == 1) && !(E_2 == 0)))) && !(E_M == 1))) || local + 2 < \old(token)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 0 == \old(t3_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < local + 2)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((\old(t3_st) == t3_st && (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) || ((((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0))) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || (((\old(t3_st) == t3_st && (((((((!(t2_pc == 1) && !(T2_E == 0)) && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) || ((((((!(t2_pc == 1) && !(T2_E == 0)) && 2 <= m_st) && 0 == t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0))) && \old(t1_st) == t1_st) && \old(E_M) == E_M)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || 0 == \old(t3_st)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t2_st < 2) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 0 == __retres1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 0 == __retres1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || 1 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || E_3 < 2) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || token < local + 1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || local + 1 < token) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == __retres1) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == t2_st) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || 0 == E_3) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || token < local + 1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || local + 1 < token) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || 0 == t3_st) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || 0 == __retres1) || !(1 == m_pc)) || !(1 == t2_i)) || token < local + 3) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || (((((!(t1_pc == 1) && token <= local) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st))) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == t1_i)) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || (((((!(t1_pc == 1) && token <= local) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st))) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((((2 <= t2_st && (((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && \old(t1_st) == t1_st) && 1 == m_pc))) && t1_i == 1) && t2_st == \old(t2_st)) && 0 == t3_st) && \old(t3_st) == t3_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || 0 == t2_st) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || ((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st)) && \old(t3_st) == t3_st)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == \old(E_2)) || !(1 == m_pc)) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st)) && token <= \old(token) + 1) && local + 1 <= token) && t1_pc == 1) && \old(t3_st) == t3_st)) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((((2 <= t2_st && (((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && 0 == t1_st) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 1 == m_pc) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && m_i == 1) && !(E_M == 0)) && !(E_2 == 1)) && !(M_E == 1)) && t2_i == 1) && 2 <= E_1) && !(E_2 == 0)) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && \old(t1_st) == t1_st) && 1 == m_pc))) && t1_i == 1) && t2_st == \old(t2_st)) && 0 == t3_st) && \old(t3_st) == t3_st))) && (((((((((((((((((((((T1_E == 0 || (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st) || (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) && 0 == t2_st)) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && 0 == t1_st) || ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((((((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st)) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) || T1_E == 0) || T2_E == 1) || local < \old(token)) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || ((((token <= \old(token) + 1 && local + 1 <= token) && t1_pc == 1) && (((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st) && \old(t1_st) == t1_st) || ((((2 <= m_st && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) && 0 == t2_st))) && \old(t3_st) == t3_st)) || \old(t2_st) < 2) || \old(token) < local) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || (((((!(t1_pc == 1) && token <= local) && t2_st == \old(t2_st)) && local <= token) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st))) && \old(t3_st) == t3_st)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || E_1 < 2) || \old(t2_st) < 2) || \old(token) < local) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || E_3 < 2) || (((((!(t1_pc == 1) && ((((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t1_st) || (((m_st == 0 && !(E_2 == 1)) && !(E_2 == 0)) && \old(t1_st) == t1_st))) && token <= local) && t2_st == \old(t2_st)) && local <= token) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && local + 3 <= token) && token == \old(token)) && token <= local + 3) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && 1 == m_pc)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || \old(local) + 3 < \old(token)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || (((((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && token <= local) && token == \old(token)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(E_1) < 2) || \old(t2_st) < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || ((((\old(E_1) == E_1 && t2_st == \old(t2_st)) && !(m_pc == 1)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(token) < \old(local)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || (((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t2_st) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && 2 <= t3_st) && 0 == t2_st) && \old(t1_st) == t1_st)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || __retres1 == 1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || local + 2 < token) || !(t1_pc == 1)) || !(1 == t3_pc)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || token < local + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || __retres1 == 1) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || __retres1 == 1) || T3_E == 0) || m_st < 2) || t3_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || __retres1 == 1) || T2_E == 1) || T3_E == 0) || t3_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || local + 3 < token) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || __retres1 == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) || token < local + 3)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || __retres1 == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t2_st < 2) || token < local) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || __retres1 == 1) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || __retres1 == 1) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t2_st < 2) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t2_st < 2) || __retres1 == 1) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || token < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || local + 1 < token) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || __retres1 == 1) || 0 == E_2) || E_1 < 2) || t2_st < 2) || token < local) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || __retres1 == 1) || token < local) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || __retres1 == 1) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || token < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || __retres1 == 1) || token < local) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || __retres1 == 1) || E_1 < 2) || token < local) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || __retres1 == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t2_st < 2) || token < local) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || __retres1 == 1) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || token < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || __retres1 == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || local + 1 < token) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t2_st < 2) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || __retres1 == 1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || __retres1 == 1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || __retres1 == 1) || E_1 < 2) || !(t1_pc == 1)) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T3_E == 0) || __retres1 == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || token < local) || t1_pc == 1) || !(0 == t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || T3_E == 0) || m_st < 2) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(m_pc == 1)) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && \old(E_M) == E_M) && 2 <= t3_st) && tmp == 1)) || T3_E == 0) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_2)) || (((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 2 <= t3_st) && tmp == 1)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((((((((((!(T1_E == 1) && 1 == t2_pc) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == tmp)) && 2 <= t3_st)) || \old(E_1) < 2) || (2 <= t3_st && ((((((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || \old(t3_st) < 2) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || \old(t3_st) < 2) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(t1_st) == t1_st) && t1_pc == 1) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(E_1) < 2) || \old(t3_st) < 2) || ((2 <= t3_st && t1_i == 1) && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || ((2 <= t3_st && t1_i == 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= t2_st && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && token == \old(token)) && token <= local) && t1_pc == 1) && tmp == 1) && local <= token) && \old(t3_st) == t3_st) || T1_E == 0) || ((((((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && token == \old(token)) && ((((!(E_2 == 1) && ((((((1 == t2_pc && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && 2 <= E_1) && token <= local) && t1_pc == 1) && tmp == 1) && local <= token)) || 1 == M_E) || !(\old(t1_st) == 0)) || ((token <= local && ((2 <= t3_st && (((!(E_2 == 1) && (((((((!(t2_pc == 1) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(E_3) <= E_3) && 2 <= E_3) && 2 <= E_1) && 0 == t1_st) && tmp == 1) && local <= token)) || 1 == \old(t2_pc)) || (((((token <= local + 1 && 2 <= t3_st) && !(0 == t1_st)) && local + 1 <= token) && t1_pc == 1) && (((!(E_2 == 1) && 2 <= E_3) && (((((1 == t2_pc && 1 == t3_pc) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || ((((2 <= t2_st && 2 <= t3_st) && !(0 == t1_st)) && t1_pc == 1) && (((!(E_2 == 1) && 2 <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || \old(token) < \old(local)) || ((!(t1_pc == 1) && ((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && \old(t3_st) == t3_st)) || \old(t1_pc) == 1) || ((((((!(t1_pc == 1) && token == \old(token)) && token <= local) && ((((((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && local <= token) && \old(t3_st) == t3_st)) || ((((2 <= t2_st && token <= local) && 0 == t1_st && !(0 == tmp) && (((((((((((1 == t2_pc && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && local <= token) && \old(t3_st) == t3_st)) || 1 == \old(E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_3) < 2) || ((((((2 <= t2_st && !(0 == t1_st)) && t1_pc == 1) && local + 2 <= token) && (((!(E_2 == 1) && 2 <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp)) && 0 == t3_st) && token <= local + 2)) || 0 < \old(t3_pc)) || 0 == \old(E_M)) || ((((2 <= t2_st && t1_pc == 1) && 2 <= t3_st && (((!(E_2 == 1) && 2 <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp)) && token <= local) && local <= token)) || ((((((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && token <= local) && local <= token) && \old(t3_st) == t3_st)) || (((((((((((((((1 == t2_pc && 2 <= E_3) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp)) && token <= local + 1) && !(0 == t1_st)) && local + 1 <= token) && t1_pc == 1) && \old(t3_st) == t3_st)) || T2_E == 1) || \old(local) < \old(token)) || T3_E == 0) || T2_E == 0) || ((((((((2 <= t2_st && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && \old(E_M) == E_M) && !(E_M == 1)) && !(t1_pc == 1)) && token == \old(token)) && token <= local) && 0 == t1_st) && tmp == 1) && local <= token) && \old(t3_st) == t3_st)) || ((((2 <= t3_st && !(0 == t1_st)) && t1_pc == 1) && (((!(E_2 == 1) && (((((((!(t2_pc == 1) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(E_3) <= E_3) && 2 <= E_3) && 2 <= E_1) && tmp == 1)) || ((((!(t1_pc == 1) && token == \old(token)) && token <= local) && ((2 <= t3_st && ((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && (((((((!(t2_pc == 1) && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && 2 <= E_1) && 0 == t1_st) && tmp == 1) && local <= token)) || (((((((((((((((((!(t2_pc == 1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == t1_st)) && t1_pc == 1) && tmp == 1) && \old(t3_st) == t3_st)) || 1 == \old(E_2)) || (((2 <= t2_st && !(t1_pc == 1)) && 0 == t1_st && !(0 == tmp) && (((((((((((1 == t2_pc && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && \old(t3_st) == t3_st)) || !(1 == t1_i)) || ((((((2 <= t2_st && ((((((((1 == t2_pc && 2 <= E_3) && 1 == t3_pc) && m_st == 0) && !(E_2 == 1)) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && local + 3 <= token) && 2 <= t3_st) && !(0 == t1_st)) && token <= local + 3) && t1_pc == 1)) || 0 == \old(E_2)) || \old(E_1) < 2) || (!(t1_pc == 1) && ((2 <= t3_st && (((!(E_2 == 1) && (((((((!(t2_pc == 1) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && \old(E_3) <= E_3) && 2 <= E_3) && 2 <= E_1) && 0 == t1_st) && tmp == 1)) || (((((((2 <= t3_st && !(0 == t1_st)) && token == \old(token)) && token <= local) && t1_pc == 1) && ((((!(E_2 == 1) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && (((((((!(t2_pc == 1) && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && 2 <= E_1) && tmp == 1) && local <= token)) || (((((2 <= t2_st && !(t1_pc == 1)) && token == \old(token)) && token <= local) && ((2 <= t3_st && ((((!(E_2 == 1) && ((((((1 == t2_pc && 1 == t3_pc) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && !(E_M == 1)) && \old(E_3) <= E_3) && \old(E_1) == E_1) && 2 <= E_3) && 2 <= E_1) && 0 == t1_st) && tmp == 1) && local <= token)) || ((2 <= t2_st && !(t1_pc == 1)) && (2 <= t3_st && 0 == t1_st) && (((!(E_2 == 1) && \old(E_3) <= E_3) && (((((((!(T1_E == 1) && 1 == t2_pc) && 1 == t3_pc) && !(T2_E == 1)) && 2 <= m_st) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || !(0 == \old(t3_st))) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(0 == t1_st) && token == \old(token)) && token <= local) && t1_pc == 1) && ((((((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && 2 <= E_3) && m_st == 0) && !(T2_E == 1)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && local <= token) && \old(t3_st) == t3_st)) || !(1 == t2_i)) || ((((2 <= t2_st && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && !(0 == tmp)) && !(0 == t1_st)) && t1_pc == 1) && \old(t3_st) == t3_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (2 <= t3_st && (((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= m_st) && !(E_2 == 1)) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 1 == m_pc) && \old(E_M) == E_M)) || \old(E_1) < 2) || \old(t3_st) < 2) || ((2 <= t3_st && t1_i == 1) && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || ((2 <= t3_st && t1_i == 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || \old(t1_st) == t1_st) || 1 == M_E) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(E_1) < 2) || \old(t3_st) < 2) || ((2 <= t3_st && t1_i == 1) && (((((((((((1 == t2_pc && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(0 == tmp))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((2 <= t3_st && t1_i == 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && \old(E_1) == E_1) && 2 <= E_3) && !(T2_E == 1)) && 2 <= m_st) && 0 == t2_st) && !(E_2 == 1)) && t3_pc <= 0) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1))) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || 0 < \old(t3_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || \old(E_3) <= E_3) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(t3_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || \old(t1_st) == t1_st) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || ((((((2 <= E_3 && 2 <= m_st) && t2_st == \old(t2_st)) && token <= local + 2) && 0 == t3_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || \old(token) < local + 1) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || ((((2 <= E_3 && 2 <= m_st) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || local + 1 < \old(token)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((2 <= E_3 && 2 <= t3_st) && \old(t1_st) == t1_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) || T1_E == 0) || T2_E == 1) || T3_E == 0) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || (((2 <= E_3 && 2 <= t3_st) && 0 == t1_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0))) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || (((((2 <= m_st && t2_st == \old(t2_st)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || ((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || ((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == t2_i)) || 0 == E_M) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || T2_E == 0) || (((((t2_st == \old(t2_st) && ((((((!(T2_E == 0) && m_st == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_2 == 0)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || \old(t3_st) < 2) || T2_E == 0) || (\old(E_3) <= E_3 && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || \old(E_3) < 2) || 1 == E_2) || !(1 == m_pc)) || !(1 == t1_i)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || \old(t1_st) == 0) || E_1 < 2) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || ((((2 <= E_3 && 2 <= m_st) && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(t1_st) == t1_st)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((((T1_E == 0 || (((((2 <= m_st && t2_st == \old(t2_st)) && token == \old(token)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || T2_E == 1) || local < \old(token)) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || \old(token) < local) || !(t1_pc == 1)) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || 0 == \old(t2_st)) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || ((((2 <= m_st && t2_st == \old(t2_st)) && \old(t3_st) == t3_st) && \old(E_3) <= E_3) && \old(t1_st) == t1_st)) || E_1 < 2) || t1_pc == 1) || !(0 == \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 0) || \old(m_st) < 2) || T2_E == 0) || 1 == M_E) || 1 == E_2) || !(1 == t1_i)) || 0 == E_2) || E_1 < 2) || (((2 <= E_3 && 2 <= t3_st) && 2 <= m_st) && \old(t1_st) == t1_st)) || \old(t3_st) < 2) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || (((2 <= E_3 && 2 <= t3_st) && 2 <= m_st) && 0 == t1_st)) || 0 < t3_pc) || !(1 == t2_i)) || 0 == E_M) - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 210 locations, 1 error locations. SAFE Result, 129.2s OverallTime, 28 OverallIterations, 7 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 103.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 9279 SDtfs, 13134 SDslu, 13828 SDs, 0 SdLazy, 9804 SolverSat, 3573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3981 GetRequests, 3760 SyntacticMatches, 46 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11410occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 5425 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 29769 PreInvPairs, 30739 NumberOfFragments, 77540 HoareAnnotationTreeSize, 29769 FomulaSimplifications, 1122786 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 80 FomulaSimplificationsInter, 1056859 FormulaSimplificationTreeSizeReductionInter, 97.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 10059 NumberOfCodeBlocks, 10059 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 10019 ConstructedInterpolants, 0 QuantifiedInterpolants, 3942869 SizeOfPredicates, 11 NumberOfNonLiveVariables, 15792 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 40 InterpolantComputations, 28 PerfectInterpolantSequences, 8450/8678 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...