./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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 e3d58fadf54daed6107b58402b79d250d23d0301 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:13:15,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:13:15,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:13:15,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:13:15,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:13:15,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:13:15,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:13:15,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:13:15,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:13:15,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:13:15,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:13:15,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:13:15,164 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:13:15,165 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:13:15,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:13:15,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:13:15,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:13:15,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:13:15,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:13:15,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:13:15,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:13:15,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:13:15,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:13:15,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:13:15,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:13:15,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:13:15,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:13:15,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:13:15,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:13:15,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:13:15,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:13:15,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:13:15,178 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:13:15,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:13:15,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:13:15,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:13:15,179 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:13:15,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:13:15,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:13:15,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:13:15,190 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:13:15,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:13:15,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:13:15,190 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:13:15,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:13:15,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:13:15,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:13:15,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:13:15,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:13:15,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:13:15,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:13:15,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:13:15,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:13:15,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:13:15,193 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_82d40007-e58c-4614-ac4c-be10b06ad185/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 -> e3d58fadf54daed6107b58402b79d250d23d0301 [2018-11-23 02:13:15,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:13:15,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:13:15,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:13:15,233 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:13:15,234 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:13:15,234 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-23 02:13:15,278 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/data/7b61f80d8/f9e15a33c50a42f886b49fd70fef5d53/FLAG9dafb12c4 [2018-11-23 02:13:15,641 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:13:15,641 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-23 02:13:15,648 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/data/7b61f80d8/f9e15a33c50a42f886b49fd70fef5d53/FLAG9dafb12c4 [2018-11-23 02:13:16,042 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/data/7b61f80d8/f9e15a33c50a42f886b49fd70fef5d53 [2018-11-23 02:13:16,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:13:16,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:13:16,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:13:16,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:13:16,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:13:16,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1538edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16, skipping insertion in model container [2018-11-23 02:13:16,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:13:16,085 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:13:16,215 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:13:16,218 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:13:16,241 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:13:16,253 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:13:16,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16 WrapperNode [2018-11-23 02:13:16,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:13:16,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:13:16,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:13:16,254 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:13:16,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:13:16,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:13:16,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:13:16,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:13:16,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... [2018-11-23 02:13:16,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:13:16,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:13:16,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:13:16,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:13:16,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-23 02:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-23 02:13:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-23 02:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-23 02:13:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:13:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-23 02:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-23 02:13:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-23 02:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-23 02:13:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-23 02:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-23 02:13:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-23 02:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-23 02:13:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-23 02:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-23 02:13:16,364 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-23 02:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-23 02:13:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-23 02:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-23 02:13:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-23 02:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-23 02:13:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-23 02:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-23 02:13:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-23 02:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-23 02:13:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-23 02:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-23 02:13:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-23 02:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-23 02:13:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-23 02:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-23 02:13:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-23 02:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-23 02:13:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:13:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-23 02:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-23 02:13:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-23 02:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-23 02:13:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-23 02:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-23 02:13:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:13:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-23 02:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-23 02:13:16,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:13:16,751 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 02:13:16,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:13:16 BoogieIcfgContainer [2018-11-23 02:13:16,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:13:16,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:13:16,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:13:16,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:13:16,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:13:16" (1/3) ... [2018-11-23 02:13:16,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acebbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:13:16, skipping insertion in model container [2018-11-23 02:13:16,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:16" (2/3) ... [2018-11-23 02:13:16,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acebbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:13:16, skipping insertion in model container [2018-11-23 02:13:16,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:13:16" (3/3) ... [2018-11-23 02:13:16,756 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-23 02:13:16,762 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:13:16,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:13:16,776 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:13:16,797 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:13:16,797 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:13:16,797 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:13:16,798 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:13:16,798 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:13:16,798 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:13:16,798 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:13:16,798 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:13:16,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:13:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-11-23 02:13:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:16,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:16,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:16,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:16,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-11-23 02:13:16,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:16,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:16,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:17,050 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-23 02:13:17,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:17,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:17,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:17,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:17,069 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-11-23 02:13:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:17,488 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-11-23 02:13:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:17,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 02:13:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:17,501 INFO L225 Difference]: With dead ends: 361 [2018-11-23 02:13:17,501 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 02:13:17,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 02:13:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-11-23 02:13:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 02:13:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-11-23 02:13:17,549 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-11-23 02:13:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:17,550 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-11-23 02:13:17,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-11-23 02:13:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:17,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:17,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:17,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:17,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-11-23 02:13:17,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:17,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:17,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:17,664 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-23 02:13:17,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:17,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:17,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:17,667 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-11-23 02:13:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:17,956 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-11-23 02:13:17,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:17,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 02:13:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:17,960 INFO L225 Difference]: With dead ends: 340 [2018-11-23 02:13:17,960 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 02:13:17,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 02:13:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-11-23 02:13:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 02:13:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-11-23 02:13:17,982 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-11-23 02:13:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:17,982 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-11-23 02:13:17,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-11-23 02:13:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:17,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:17,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:17,984 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:17,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-11-23 02:13:17,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:17,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:17,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:18,075 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-23 02:13:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:18,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:18,076 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-11-23 02:13:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:18,288 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-11-23 02:13:18,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:18,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 02:13:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:18,289 INFO L225 Difference]: With dead ends: 338 [2018-11-23 02:13:18,289 INFO L226 Difference]: Without dead ends: 193 [2018-11-23 02:13:18,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-23 02:13:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-11-23 02:13:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 02:13:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-11-23 02:13:18,300 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-11-23 02:13:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:18,300 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-11-23 02:13:18,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-11-23 02:13:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:18,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:18,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:18,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:18,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-11-23 02:13:18,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:18,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:18,374 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-23 02:13:18,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:18,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:18,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:18,375 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-11-23 02:13:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:18,601 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-11-23 02:13:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:18,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 02:13:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:18,602 INFO L225 Difference]: With dead ends: 355 [2018-11-23 02:13:18,602 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 02:13:18,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 02:13:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-11-23 02:13:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 02:13:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-11-23 02:13:18,618 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-11-23 02:13:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:18,619 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-11-23 02:13:18,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-11-23 02:13:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:18,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:18,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:18,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:18,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-11-23 02:13:18,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:18,674 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-23 02:13:18,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:18,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:18,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:18,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:18,675 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-11-23 02:13:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:18,887 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-11-23 02:13:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:18,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 02:13:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:18,890 INFO L225 Difference]: With dead ends: 349 [2018-11-23 02:13:18,890 INFO L226 Difference]: Without dead ends: 204 [2018-11-23 02:13:18,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-23 02:13:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-11-23 02:13:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 02:13:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-11-23 02:13:18,905 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-11-23 02:13:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:18,905 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-11-23 02:13:18,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-11-23 02:13:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:18,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:18,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:18,908 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:18,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-11-23 02:13:18,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:18,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:18,969 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-23 02:13:18,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:18,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:18,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:18,970 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-11-23 02:13:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:19,269 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-11-23 02:13:19,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:19,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 02:13:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:19,270 INFO L225 Difference]: With dead ends: 351 [2018-11-23 02:13:19,271 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 02:13:19,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 02:13:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-11-23 02:13:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 02:13:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-11-23 02:13:19,289 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-11-23 02:13:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:19,289 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-11-23 02:13:19,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-11-23 02:13:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:13:19,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:19,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:19,292 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:19,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-11-23 02:13:19,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:19,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:19,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:19,336 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-23 02:13:19,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:19,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:13:19,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:13:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:13:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:13:19,338 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-11-23 02:13:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:19,468 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-11-23 02:13:19,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:13:19,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-23 02:13:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:19,470 INFO L225 Difference]: With dead ends: 445 [2018-11-23 02:13:19,471 INFO L226 Difference]: Without dead ends: 301 [2018-11-23 02:13:19,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:13:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-23 02:13:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-11-23 02:13:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 02:13:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-11-23 02:13:19,491 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-11-23 02:13:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:19,491 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-11-23 02:13:19,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:13:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-11-23 02:13:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 02:13:19,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:19,493 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:19,493 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:19,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-11-23 02:13:19,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:19,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:19,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 02:13:19,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:19,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:19,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:19,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:13:19,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:19,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 02:13:19,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:13:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:13:19,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:19,661 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 7 states. [2018-11-23 02:13:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:19,772 INFO L93 Difference]: Finished difference Result 871 states and 1227 transitions. [2018-11-23 02:13:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:13:19,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-11-23 02:13:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:19,775 INFO L225 Difference]: With dead ends: 871 [2018-11-23 02:13:19,775 INFO L226 Difference]: Without dead ends: 592 [2018-11-23 02:13:19,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 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-23 02:13:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-11-23 02:13:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 567. [2018-11-23 02:13:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-11-23 02:13:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 766 transitions. [2018-11-23 02:13:19,818 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 766 transitions. Word has length 145 [2018-11-23 02:13:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:19,819 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 766 transitions. [2018-11-23 02:13:19,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:13:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 766 transitions. [2018-11-23 02:13:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 02:13:19,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:19,822 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:19,823 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:19,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash 318721420, now seen corresponding path program 1 times [2018-11-23 02:13:19,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:19,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:19,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-23 02:13:19,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:19,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:19,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:19,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 02:13:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:20,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-23 02:13:20,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:20,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:20,019 INFO L87 Difference]: Start difference. First operand 567 states and 766 transitions. Second operand 5 states. [2018-11-23 02:13:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:20,501 INFO L93 Difference]: Finished difference Result 2624 states and 3935 transitions. [2018-11-23 02:13:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:13:20,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-11-23 02:13:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:20,513 INFO L225 Difference]: With dead ends: 2624 [2018-11-23 02:13:20,513 INFO L226 Difference]: Without dead ends: 2083 [2018-11-23 02:13:20,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 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-23 02:13:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2018-11-23 02:13:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2068. [2018-11-23 02:13:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2018-11-23 02:13:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2869 transitions. [2018-11-23 02:13:20,720 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2869 transitions. Word has length 164 [2018-11-23 02:13:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:20,720 INFO L480 AbstractCegarLoop]: Abstraction has 2068 states and 2869 transitions. [2018-11-23 02:13:20,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2869 transitions. [2018-11-23 02:13:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 02:13:20,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:20,725 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:20,725 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:20,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1264541432, now seen corresponding path program 1 times [2018-11-23 02:13:20,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:20,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:20,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 02:13:20,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:20,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:13:20,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:13:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:13:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:13:20,767 INFO L87 Difference]: Start difference. First operand 2068 states and 2869 transitions. Second operand 4 states. [2018-11-23 02:13:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:20,982 INFO L93 Difference]: Finished difference Result 3607 states and 4966 transitions. [2018-11-23 02:13:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:13:20,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-11-23 02:13:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:20,990 INFO L225 Difference]: With dead ends: 3607 [2018-11-23 02:13:20,991 INFO L226 Difference]: Without dead ends: 1566 [2018-11-23 02:13:20,997 INFO L631 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-23 02:13:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2018-11-23 02:13:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2018-11-23 02:13:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2018-11-23 02:13:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2132 transitions. [2018-11-23 02:13:21,130 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2132 transitions. Word has length 145 [2018-11-23 02:13:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:21,130 INFO L480 AbstractCegarLoop]: Abstraction has 1566 states and 2132 transitions. [2018-11-23 02:13:21,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:13:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2132 transitions. [2018-11-23 02:13:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 02:13:21,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:21,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:21,133 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:21,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1654182224, now seen corresponding path program 1 times [2018-11-23 02:13:21,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:21,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:21,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 02:13:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:13:21,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:13:21,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:13:21,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:13:21,167 INFO L87 Difference]: Start difference. First operand 1566 states and 2132 transitions. Second operand 4 states. [2018-11-23 02:13:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:21,349 INFO L93 Difference]: Finished difference Result 2844 states and 3834 transitions. [2018-11-23 02:13:21,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:13:21,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-11-23 02:13:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:21,355 INFO L225 Difference]: With dead ends: 2844 [2018-11-23 02:13:21,355 INFO L226 Difference]: Without dead ends: 1300 [2018-11-23 02:13:21,360 INFO L631 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-23 02:13:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2018-11-23 02:13:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2018-11-23 02:13:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-11-23 02:13:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1729 transitions. [2018-11-23 02:13:21,480 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1729 transitions. Word has length 146 [2018-11-23 02:13:21,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:21,480 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1729 transitions. [2018-11-23 02:13:21,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:13:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1729 transitions. [2018-11-23 02:13:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 02:13:21,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:21,483 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:21,484 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:21,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1965624946, now seen corresponding path program 1 times [2018-11-23 02:13:21,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:21,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 02:13:21,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:21,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:21,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:21,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 02:13:21,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:21,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 02:13:21,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:13:21,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:13:21,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:21,649 INFO L87 Difference]: Start difference. First operand 1300 states and 1729 transitions. Second operand 7 states. [2018-11-23 02:13:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:21,829 INFO L93 Difference]: Finished difference Result 3906 states and 5645 transitions. [2018-11-23 02:13:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:13:21,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-11-23 02:13:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:21,837 INFO L225 Difference]: With dead ends: 3906 [2018-11-23 02:13:21,837 INFO L226 Difference]: Without dead ends: 2627 [2018-11-23 02:13:21,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 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-23 02:13:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2018-11-23 02:13:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2595. [2018-11-23 02:13:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-11-23 02:13:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3628 transitions. [2018-11-23 02:13:21,974 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3628 transitions. Word has length 146 [2018-11-23 02:13:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:21,974 INFO L480 AbstractCegarLoop]: Abstraction has 2595 states and 3628 transitions. [2018-11-23 02:13:21,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:13:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3628 transitions. [2018-11-23 02:13:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 02:13:21,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:21,977 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:21,977 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:21,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2137289136, now seen corresponding path program 1 times [2018-11-23 02:13:21,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:21,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:21,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:21,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 02:13:22,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:22,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:13:22,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:13:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:13:22,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:13:22,011 INFO L87 Difference]: Start difference. First operand 2595 states and 3628 transitions. Second operand 4 states. [2018-11-23 02:13:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:22,221 INFO L93 Difference]: Finished difference Result 5164 states and 7222 transitions. [2018-11-23 02:13:22,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:13:22,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-11-23 02:13:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:22,229 INFO L225 Difference]: With dead ends: 5164 [2018-11-23 02:13:22,229 INFO L226 Difference]: Without dead ends: 2590 [2018-11-23 02:13:22,234 INFO L631 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-23 02:13:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-11-23 02:13:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2018-11-23 02:13:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2018-11-23 02:13:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3618 transitions. [2018-11-23 02:13:22,357 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3618 transitions. Word has length 146 [2018-11-23 02:13:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:22,358 INFO L480 AbstractCegarLoop]: Abstraction has 2590 states and 3618 transitions. [2018-11-23 02:13:22,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:13:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3618 transitions. [2018-11-23 02:13:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 02:13:22,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:22,360 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:22,360 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:22,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:22,361 INFO L82 PathProgramCache]: Analyzing trace with hash -611213813, now seen corresponding path program 1 times [2018-11-23 02:13:22,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:22,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 02:13:22,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:22,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:22,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:22,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 02:13:22,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:22,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 02:13:22,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:13:22,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:13:22,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:22,523 INFO L87 Difference]: Start difference. First operand 2590 states and 3618 transitions. Second operand 7 states. [2018-11-23 02:13:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:22,714 INFO L93 Difference]: Finished difference Result 5641 states and 8271 transitions. [2018-11-23 02:13:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:13:22,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2018-11-23 02:13:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:22,724 INFO L225 Difference]: With dead ends: 5641 [2018-11-23 02:13:22,724 INFO L226 Difference]: Without dead ends: 3072 [2018-11-23 02:13:22,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 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-23 02:13:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-11-23 02:13:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3070. [2018-11-23 02:13:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-11-23 02:13:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4168 transitions. [2018-11-23 02:13:22,939 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4168 transitions. Word has length 147 [2018-11-23 02:13:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:22,940 INFO L480 AbstractCegarLoop]: Abstraction has 3070 states and 4168 transitions. [2018-11-23 02:13:22,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:13:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4168 transitions. [2018-11-23 02:13:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:22,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:22,945 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:22,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:22,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1841736258, now seen corresponding path program 1 times [2018-11-23 02:13:22,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:22,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:22,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 02:13:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:23,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:23,018 INFO L87 Difference]: Start difference. First operand 3070 states and 4168 transitions. Second operand 5 states. [2018-11-23 02:13:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:23,428 INFO L93 Difference]: Finished difference Result 7390 states and 10200 transitions. [2018-11-23 02:13:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:13:23,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-23 02:13:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:23,441 INFO L225 Difference]: With dead ends: 7390 [2018-11-23 02:13:23,441 INFO L226 Difference]: Without dead ends: 4342 [2018-11-23 02:13:23,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2018-11-23 02:13:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3928. [2018-11-23 02:13:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2018-11-23 02:13:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5092 transitions. [2018-11-23 02:13:23,619 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5092 transitions. Word has length 190 [2018-11-23 02:13:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:23,619 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 5092 transitions. [2018-11-23 02:13:23,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5092 transitions. [2018-11-23 02:13:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:23,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:23,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:23,624 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:23,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1256964608, now seen corresponding path program 1 times [2018-11-23 02:13:23,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 02:13:23,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:23,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:23,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:23,712 INFO L87 Difference]: Start difference. First operand 3928 states and 5092 transitions. Second operand 5 states. [2018-11-23 02:13:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:24,383 INFO L93 Difference]: Finished difference Result 7834 states and 10194 transitions. [2018-11-23 02:13:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:24,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-23 02:13:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:24,399 INFO L225 Difference]: With dead ends: 7834 [2018-11-23 02:13:24,399 INFO L226 Difference]: Without dead ends: 3928 [2018-11-23 02:13:24,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2018-11-23 02:13:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3928. [2018-11-23 02:13:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2018-11-23 02:13:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5056 transitions. [2018-11-23 02:13:24,681 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5056 transitions. Word has length 190 [2018-11-23 02:13:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:24,681 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 5056 transitions. [2018-11-23 02:13:24,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5056 transitions. [2018-11-23 02:13:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:24,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:24,689 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:24,690 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:24,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 822459010, now seen corresponding path program 1 times [2018-11-23 02:13:24,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 02:13:24,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:24,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:24,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:24,770 INFO L87 Difference]: Start difference. First operand 3928 states and 5056 transitions. Second operand 5 states. [2018-11-23 02:13:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:25,177 INFO L93 Difference]: Finished difference Result 7834 states and 10122 transitions. [2018-11-23 02:13:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:13:25,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-23 02:13:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:25,192 INFO L225 Difference]: With dead ends: 7834 [2018-11-23 02:13:25,192 INFO L226 Difference]: Without dead ends: 3928 [2018-11-23 02:13:25,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:13:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2018-11-23 02:13:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3928. [2018-11-23 02:13:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2018-11-23 02:13:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5020 transitions. [2018-11-23 02:13:25,403 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5020 transitions. Word has length 190 [2018-11-23 02:13:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:25,403 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 5020 transitions. [2018-11-23 02:13:25,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5020 transitions. [2018-11-23 02:13:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:25,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:25,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:25,408 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:25,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash 392800704, now seen corresponding path program 1 times [2018-11-23 02:13:25,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:25,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:25,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 02:13:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:25,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:25,467 INFO L87 Difference]: Start difference. First operand 3928 states and 5020 transitions. Second operand 5 states. [2018-11-23 02:13:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:25,935 INFO L93 Difference]: Finished difference Result 8608 states and 12144 transitions. [2018-11-23 02:13:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:13:25,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-23 02:13:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:25,947 INFO L225 Difference]: With dead ends: 8608 [2018-11-23 02:13:25,947 INFO L226 Difference]: Without dead ends: 4702 [2018-11-23 02:13:25,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2018-11-23 02:13:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4264. [2018-11-23 02:13:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4264 states. [2018-11-23 02:13:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 5297 transitions. [2018-11-23 02:13:26,165 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 5297 transitions. Word has length 190 [2018-11-23 02:13:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:26,166 INFO L480 AbstractCegarLoop]: Abstraction has 4264 states and 5297 transitions. [2018-11-23 02:13:26,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 5297 transitions. [2018-11-23 02:13:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:26,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:26,173 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:26,173 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:26,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -313795902, now seen corresponding path program 1 times [2018-11-23 02:13:26,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:26,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:26,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 02:13:26,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:26,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:26,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:26,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:26,259 INFO L87 Difference]: Start difference. First operand 4264 states and 5297 transitions. Second operand 5 states. [2018-11-23 02:13:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:26,748 INFO L93 Difference]: Finished difference Result 8551 states and 11151 transitions. [2018-11-23 02:13:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:13:26,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-23 02:13:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:26,759 INFO L225 Difference]: With dead ends: 8551 [2018-11-23 02:13:26,759 INFO L226 Difference]: Without dead ends: 4309 [2018-11-23 02:13:26,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2018-11-23 02:13:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4205. [2018-11-23 02:13:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2018-11-23 02:13:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5190 transitions. [2018-11-23 02:13:26,943 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5190 transitions. Word has length 190 [2018-11-23 02:13:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:26,943 INFO L480 AbstractCegarLoop]: Abstraction has 4205 states and 5190 transitions. [2018-11-23 02:13:26,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5190 transitions. [2018-11-23 02:13:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:26,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:26,947 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:26,947 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:26,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash 633241984, now seen corresponding path program 1 times [2018-11-23 02:13:26,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:26,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 02:13:27,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:13:27,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:13:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:13:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:13:27,026 INFO L87 Difference]: Start difference. First operand 4205 states and 5190 transitions. Second operand 5 states. [2018-11-23 02:13:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:27,622 INFO L93 Difference]: Finished difference Result 8822 states and 12365 transitions. [2018-11-23 02:13:27,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:13:27,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-23 02:13:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:27,634 INFO L225 Difference]: With dead ends: 8822 [2018-11-23 02:13:27,634 INFO L226 Difference]: Without dead ends: 4638 [2018-11-23 02:13:27,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2018-11-23 02:13:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4240. [2018-11-23 02:13:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4240 states. [2018-11-23 02:13:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5172 transitions. [2018-11-23 02:13:27,848 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5172 transitions. Word has length 190 [2018-11-23 02:13:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:27,848 INFO L480 AbstractCegarLoop]: Abstraction has 4240 states and 5172 transitions. [2018-11-23 02:13:27,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:13:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5172 transitions. [2018-11-23 02:13:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 02:13:27,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:27,852 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:27,852 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1495075586, now seen corresponding path program 1 times [2018-11-23 02:13:27,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:27,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:27,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 02:13:27,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:27,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:27,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:28,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 02:13:28,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:28,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 02:13:28,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:13:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:13:28,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:28,052 INFO L87 Difference]: Start difference. First operand 4240 states and 5172 transitions. Second operand 7 states. [2018-11-23 02:13:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:28,687 INFO L93 Difference]: Finished difference Result 10063 states and 13370 transitions. [2018-11-23 02:13:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:13:28,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2018-11-23 02:13:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:28,704 INFO L225 Difference]: With dead ends: 10063 [2018-11-23 02:13:28,704 INFO L226 Difference]: Without dead ends: 5844 [2018-11-23 02:13:28,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:13:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2018-11-23 02:13:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5840. [2018-11-23 02:13:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5840 states. [2018-11-23 02:13:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5840 states to 5840 states and 7152 transitions. [2018-11-23 02:13:29,070 INFO L78 Accepts]: Start accepts. Automaton has 5840 states and 7152 transitions. Word has length 190 [2018-11-23 02:13:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:29,070 INFO L480 AbstractCegarLoop]: Abstraction has 5840 states and 7152 transitions. [2018-11-23 02:13:29,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:13:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 5840 states and 7152 transitions. [2018-11-23 02:13:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 02:13:29,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:29,074 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 02:13:29,074 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:29,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1598654101, now seen corresponding path program 1 times [2018-11-23 02:13:29,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:29,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-23 02:13:29,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:29,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:29,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:29,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 02:13:29,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:29,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-23 02:13:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:13:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:13:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:13:29,252 INFO L87 Difference]: Start difference. First operand 5840 states and 7152 transitions. Second operand 3 states. [2018-11-23 02:13:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:29,614 INFO L93 Difference]: Finished difference Result 9506 states and 11882 transitions. [2018-11-23 02:13:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:13:29,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-23 02:13:29,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:29,630 INFO L225 Difference]: With dead ends: 9506 [2018-11-23 02:13:29,630 INFO L226 Difference]: Without dead ends: 4866 [2018-11-23 02:13:29,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:13:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2018-11-23 02:13:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 4813. [2018-11-23 02:13:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2018-11-23 02:13:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 5700 transitions. [2018-11-23 02:13:29,990 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 5700 transitions. Word has length 212 [2018-11-23 02:13:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:29,990 INFO L480 AbstractCegarLoop]: Abstraction has 4813 states and 5700 transitions. [2018-11-23 02:13:29,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:13:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 5700 transitions. [2018-11-23 02:13:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-23 02:13:29,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:30,000 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:13:30,000 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:30,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash 79500943, now seen corresponding path program 1 times [2018-11-23 02:13:30,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:30,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-11-23 02:13:30,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:13:30,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/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-23 02:13:30,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:30,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:13:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 02:13:30,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:13:30,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-23 02:13:30,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:13:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:13:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:30,334 INFO L87 Difference]: Start difference. First operand 4813 states and 5700 transitions. Second operand 7 states. [2018-11-23 02:13:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:31,571 INFO L93 Difference]: Finished difference Result 6753 states and 8257 transitions. [2018-11-23 02:13:31,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:13:31,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2018-11-23 02:13:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:31,579 INFO L225 Difference]: With dead ends: 6753 [2018-11-23 02:13:31,579 INFO L226 Difference]: Without dead ends: 1627 [2018-11-23 02:13:31,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:13:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-11-23 02:13:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1551. [2018-11-23 02:13:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2018-11-23 02:13:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1707 transitions. [2018-11-23 02:13:31,738 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1707 transitions. Word has length 264 [2018-11-23 02:13:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:31,738 INFO L480 AbstractCegarLoop]: Abstraction has 1551 states and 1707 transitions. [2018-11-23 02:13:31,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:13:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1707 transitions. [2018-11-23 02:13:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-23 02:13:31,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:13:31,741 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:13:31,742 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:13:31,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:13:31,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 1 times [2018-11-23 02:13:31,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:13:31,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:13:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:13:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:13:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:13:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-23 02:13:31,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:13:31,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:13:31,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:13:31,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:13:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:13:31,899 INFO L87 Difference]: Start difference. First operand 1551 states and 1707 transitions. Second operand 7 states. [2018-11-23 02:13:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:13:32,916 INFO L93 Difference]: Finished difference Result 1553 states and 1711 transitions. [2018-11-23 02:13:32,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:13:32,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-11-23 02:13:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:13:32,917 INFO L225 Difference]: With dead ends: 1553 [2018-11-23 02:13:32,917 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:13:32,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:13:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:13:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:13:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:13:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:13:32,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-11-23 02:13:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:13:32,921 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:13:32,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:13:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:13:32,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:13:32,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:13:33,150 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:33,699 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:34,125 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:34,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,467 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 170 [2018-11-23 02:13:34,675 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:34,856 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:34,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:34,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,811 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:35,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:35,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:37,690 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2018-11-23 02:13:37,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:13:39,302 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:13:41,697 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 209 DAG size of output: 100 [2018-11-23 02:13:42,685 WARN L180 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:13:43,079 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-11-23 02:13:43,601 WARN L180 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 96 [2018-11-23 02:13:44,046 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2018-11-23 02:13:44,194 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2018-11-23 02:13:45,192 WARN L180 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:13:45,391 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-11-23 02:13:45,516 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-11-23 02:13:46,561 WARN L180 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 152 [2018-11-23 02:13:47,056 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2018-11-23 02:13:48,047 WARN L180 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:13:48,389 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-11-23 02:13:49,372 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:13:49,969 WARN L180 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-23 02:13:50,451 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2018-11-23 02:13:51,288 WARN L180 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 91 [2018-11-23 02:13:53,398 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 187 DAG size of output: 117 [2018-11-23 02:13:53,774 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2018-11-23 02:13:56,119 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 201 DAG size of output: 123 [2018-11-23 02:13:58,097 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 181 DAG size of output: 112 [2018-11-23 02:13:59,236 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:14:00,531 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2018-11-23 02:14:01,283 WARN L180 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 94 [2018-11-23 02:14:01,600 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2018-11-23 02:14:01,775 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 02:14:03,584 WARN L180 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 187 DAG size of output: 159 [2018-11-23 02:14:05,433 WARN L180 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 175 DAG size of output: 92 [2018-11-23 02:14:06,827 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 181 DAG size of output: 157 [2018-11-23 02:14:06,928 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-11-23 02:14:07,911 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:14:09,357 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2018-11-23 02:14:09,804 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2018-11-23 02:14:11,038 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 160 DAG size of output: 132 [2018-11-23 02:14:11,562 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 91 [2018-11-23 02:14:12,781 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 139 DAG size of output: 95 [2018-11-23 02:14:13,060 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2018-11-23 02:14:15,037 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 181 DAG size of output: 112 [2018-11-23 02:14:18,352 WARN L180 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 235 DAG size of output: 188 [2018-11-23 02:14:21,708 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 235 DAG size of output: 188 [2018-11-23 02:14:22,891 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2018-11-23 02:14:23,373 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2018-11-23 02:14:24,345 WARN L180 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:14:26,291 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 186 DAG size of output: 95 [2018-11-23 02:14:27,199 WARN L180 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 152 [2018-11-23 02:14:28,175 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 160 [2018-11-23 02:14:29,297 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 185 DAG size of output: 156 [2018-11-23 02:14:29,827 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2018-11-23 02:14:32,961 WARN L180 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 235 DAG size of output: 188 [2018-11-23 02:14:32,964 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse5 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0))) (let ((.cse37 (not .cse0)) (.cse38 (not .cse5)) (.cse33 (= 1 ~m_pc~0)) (.cse39 (not (= ~E_2~0 0))) (.cse11 (= 1 ~t2_pc~0))) (let ((.cse26 (<= 2 ~t2_st~0)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse23 (not .cse11)) (.cse4 (< |old(~m_st~0)| 2)) (.cse24 (<= 2 ~m_st~0)) (.cse34 (not (= ~E_2~0 1))) (.cse35 (and .cse37 .cse38 .cse33 (not (= ~M_E~0 0)) .cse39)) (.cse15 (not .cse33)) (.cse1 (= ~T2_E~0 1)) (.cse27 (< ~local~0 |old(~token~0)|)) (.cse28 (< |old(~token~0)| ~local~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse25 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse36 (= 0 ~t2_st~0)) (.cse29 (<= ~token~0 ~local~0)) (.cse30 (and .cse37 .cse38 (= ~m_st~0 0) .cse39)) (.cse31 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 |old(~E_2~0)|)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse22 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse12 .cse14 .cse15 (and .cse24 .cse2 .cse25 .cse26) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse22 .cse1 .cse27 .cse28 (and .cse2 .cse25 .cse26 .cse29 .cse30 .cse31) .cse3 .cse5 .cse6 .cse7 .cse8 .cse23 .cse9 .cse32 .cse10 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse33) (or .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse7 .cse12 .cse14 .cse17 .cse20 .cse21 (and .cse24 .cse25 .cse26 .cse34 .cse35) .cse22 .cse28 .cse8 .cse23 .cse9 .cse10 .cse15 (and .cse24 .cse25 .cse36 .cse34 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse35) .cse16 .cse18 .cse19) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (and .cse24 .cse25 .cse36 .cse34 .cse35) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse27 .cse28 .cse3 .cse5 (and .cse2 .cse25 .cse36 .cse29 .cse30 .cse31) .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse33))))) [2018-11-23 02:14:32,964 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-11-23 02:14:32,964 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse30 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse18 (not (= 0 |old(~m_st~0)|))) (.cse7 (< |old(~t2_st~0)| 2)) (.cse36 (= 1 ~t1_pc~0)) (.cse2 (= ~token~0 |old(~token~0)|)) (.cse5 (<= 2 ~t2_st~0)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse35 (not .cse11)) (.cse10 (< |old(~token~0)| ~local~0)) (.cse16 (not .cse30)) (.cse6 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 1)) (.cse32 (< |old(~m_st~0)| 2)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse17 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 1 ~E_1~0)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse21 (= 1 |old(~E_2~0)|)) (.cse33 (not .cse28)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 |old(~E_2~0)|)) (.cse27 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~t1_pc~0 1))) (.cse34 (<= 2 ~m_st~0)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse29 (= 0 ~t2_st~0))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse6 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse30 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse6 .cse7 .cse8 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 (and .cse0 .cse34 .cse3 .cse4 .cse5) .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse8 .cse35 (and .cse36 .cse34 .cse3 .cse4 .cse29) .cse32 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse30 .cse20 .cse31 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse7 (and .cse36 .cse34 .cse2 .cse3 .cse4 .cse5) .cse8 .cse9 .cse35 .cse10 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse8 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse30 .cse20 .cse31 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse0 .cse34 .cse3 .cse4 .cse29))))) [2018-11-23 02:14:32,964 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-23 02:14:32,965 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse10 (not (= 0 |old(~m_st~0)|))) (.cse23 (< |old(~t2_st~0)| 2)) (.cse29 (not .cse12)) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse24 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 |old(~E_2~0)|)) (.cse30 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 (and .cse24 .cse25 (= ~token~0 |old(~token~0)|) .cse26 .cse27 (<= 2 ~t2_st~0)) .cse1 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse11 .cse13 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse4 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse11 .cse13 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse4 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 (and .cse24 .cse25 .cse26 .cse27 (= 0 ~t2_st~0)) .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-11-23 02:14:32,965 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-11-23 02:14:32,965 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse30 (= 1 ~t2_pc~0)) (.cse36 (= 1 ~m_pc~0))) (let ((.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~E_2~0 0))) (.cse3 (< |old(~m_st~0)| 2)) (.cse24 (not .cse36)) (.cse13 (<= 2 ~m_st~0)) (.cse17 (= 0 ~t2_st~0)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse18 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 1 ~t1_pc~0)) (.cse34 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse35 (= ~token~0 |old(~token~0)|)) (.cse32 (= |old(~E_2~0)| ~E_2~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse19 (< |old(~token~0)| ~local~0)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse20 (= 1 ~E_M~0)) (.cse21 (not .cse30)) (.cse22 (= ~T1_E~0 1)) (.cse33 (not (= 0 |old(~m_st~0)|))) (.cse23 (not (= ~m_i~0 1))) (.cse7 (= 1 ~E_1~0)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse25 (= 0 ~E_1~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~E_M~0)) (.cse10 (= 0 |old(~E_2~0)|)) (.cse11 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 (<= ~token~0 (+ |old(~token~0)| 1)) .cse16 .cse17 (<= (+ ~local~0 1) ~token~0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse28)) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse20 .cse22 .cse23 .cse30 .cse7 .cse31 .cse8 .cse24 .cse32 .cse25 .cse9 .cse26 .cse27 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse22 .cse23 .cse30 .cse7 .cse31 .cse8 .cse24 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse25 .cse9 .cse26 .cse27 .cse10 .cse11) (or .cse0 .cse18 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse23 .cse7 .cse8 .cse24 .cse25 .cse9 .cse26 .cse27 .cse10 (and .cse12 .cse13 .cse14 .cse32 .cse28) .cse11) (or .cse0 .cse1 .cse2 .cse19 .cse29 .cse4 .cse5 .cse6 .cse20 .cse22 .cse33 (and .cse12 .cse34 .cse14 .cse35 .cse32 .cse17) .cse23 .cse30 .cse7 .cse31 .cse8 .cse25 .cse9 .cse26 .cse27 .cse10 .cse11 .cse36) (or .cse0 .cse18 .cse1 (and .cse12 .cse34 .cse14 .cse35 .cse32 .cse28) .cse2 .cse19 .cse29 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse33 .cse23 .cse7 .cse8 .cse25 .cse9 .cse26 .cse27 .cse10 .cse11 .cse36)))) [2018-11-23 02:14:32,965 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse10 (not (= 0 |old(~m_st~0)|))) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse25 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse24 (not .cse12)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 1 |old(~E_2~0)|)) (.cse26 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0)) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (not (= ~E_2~0 0))) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse27 .cse28 .cse29 .cse30 (= 0 ~t2_st~0))) (or .cse0 .cse1 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse25 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse27 .cse28 (<= ~token~0 (+ |old(~token~0)| 1)) .cse29 .cse30 (<= 2 ~t2_st~0) (<= (+ ~local~0 1) ~token~0)))))) [2018-11-23 02:14:32,965 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-11-23 02:14:32,965 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-11-23 02:14:32,966 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse29 (= 1 ~m_pc~0)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse45 (+ ~local~0 1)) (.cse10 (= 1 ~t2_pc~0)) (.cse26 (= ~t1_pc~0 1)) (.cse22 (= 0 ~t1_st~0)) (.cse37 (<= 2 ~m_st~0)) (.cse23 (= 0 ~t2_st~0)) (.cse21 (= ~m_st~0 0)) (.cse35 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse39 (<= 2 ~t2_st~0)) (.cse46 (+ ~local~0 2))) (let ((.cse36 (< .cse46 ~token~0)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse38 (< ~token~0 .cse46)) (.cse40 (and .cse21 .cse35 .cse39)) (.cse7 (< |old(~t1_st~0)| 2)) (.cse12 (and .cse37 .cse35 .cse23)) (.cse41 (and .cse37 .cse22 .cse39)) (.cse34 (and .cse37 .cse35 .cse39)) (.cse32 (< |old(~t2_st~0)| 2)) (.cse2 (not .cse26)) (.cse30 (= 1 ~M_E~0)) (.cse33 (not .cse10)) (.cse43 (< ~token~0 .cse45)) (.cse44 (< .cse45 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse24 (< ~local~0 ~token~0)) (.cse25 (< ~token~0 ~local~0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse27 (not .cse31)) (.cse6 (= 1 ~E_M~0)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse15 (not .cse29)) (.cse42 (and .cse37 .cse22 .cse23)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~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) (or (and .cse21 .cse22 .cse23) .cse0 .cse1 .cse24 .cse25 .cse26 .cse4 .cse5 .cse27 .cse6 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse12 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse32 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse34 .cse17 .cse18 .cse19 .cse20) (or (and .cse21 .cse35 .cse23) .cse0 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse1 .cse36 .cse2 .cse3 .cse4 .cse5 .cse30 .cse33 .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 (and .cse37 .cse35) .cse16 .cse17 .cse18 .cse19 .cse20 .cse38) (or .cse0 (and .cse22 .cse23) .cse1 .cse26 .cse4 .cse5 .cse30 .cse27 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or (and .cse22 .cse39) .cse0 .cse32 .cse1 .cse26 .cse4 .cse5 .cse30 .cse27 .cse6 .cse33 .cse8 .cse9 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse32 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse28 .cse9 .cse11 .cse40 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse32 .cse1 .cse26 .cse3 .cse4 .cse41 .cse5 .cse27 .cse6 .cse33 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse32 .cse1 .cse24 .cse25 .cse26 .cse4 .cse5 .cse27 .cse6 .cse33 .cse8 .cse28 .cse9 .cse11 (and .cse21 .cse22 .cse39) .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse1 .cse42 .cse26 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse32 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse30 .cse6 .cse33 (and .cse35 .cse39) .cse7 .cse8 .cse9 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse35 .cse23) .cse29) (or .cse0 .cse32 .cse1 .cse36 .cse2 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse28 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse43 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse44 .cse19 .cse20 .cse12) (or .cse0 .cse32 .cse1 .cse24 .cse25 .cse3 .cse4 .cse5 .cse27 .cse6 .cse33 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse41 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse34 .cse32 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse33 .cse8 .cse43 .cse9 .cse11 .cse15 .cse16 .cse17 .cse18 .cse44 .cse19 .cse20 .cse31) (or .cse0 .cse1 .cse24 .cse25 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-23 02:14:32,966 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse19 (= |old(~t1_st~0)| 0)) (.cse33 (= ~t1_pc~0 1)) (.cse32 (= 1 ~m_pc~0)) (.cse10 (= 1 ~t2_pc~0)) (.cse45 (+ ~local~0 2)) (.cse46 (+ ~local~0 1)) (.cse28 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse38 (= 0 ~t2_st~0)) (.cse43 (<= 2 ~m_st~0)) (.cse35 (= 0 ~t1_st~0)) (.cse30 (<= 2 ~t2_st~0))) (let ((.cse37 (and .cse43 .cse35 .cse30)) (.cse20 (and .cse43 .cse28 .cse38)) (.cse39 (< ~token~0 .cse46)) (.cse40 (< .cse46 ~token~0)) (.cse36 (and .cse43 .cse35 .cse38)) (.cse42 (< .cse45 ~token~0)) (.cse44 (< ~token~0 .cse45)) (.cse21 (< |old(~t2_st~0)| 2)) (.cse3 (< |old(~m_st~0)| 2)) (.cse24 (not .cse10)) (.cse41 (and .cse43 .cse28 .cse30)) (.cse13 (not .cse32)) (.cse2 (not .cse33)) (.cse6 (= 1 ~M_E~0)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse22 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse34 (not .cse19)) (.cse7 (= 1 ~E_M~0)) (.cse27 (= ~m_st~0 0)) (.cse29 (= activate_threads_~tmp~1 0)) (.cse8 (= ~T1_E~0 1)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse31 (= 1 ~E_2~0)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 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) (or .cse0 .cse21 .cse1 .cse22 .cse2 .cse23 .cse4 .cse5 .cse7 .cse24 .cse25 .cse8 .cse26 .cse9 .cse11 (and .cse27 .cse28 .cse29 .cse30) .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse21 .cse1 .cse22 .cse23 .cse33 .cse4 .cse5 .cse34 .cse7 .cse24 .cse8 .cse26 .cse9 .cse11 .cse31 (and .cse27 .cse35 .cse29 .cse30) .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse21 .cse1 (and .cse28 .cse30) .cse22 .cse2 .cse23 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse8 .cse9 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse33 .cse3 .cse4 .cse5 .cse34 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or (and .cse35 .cse29 .cse30) .cse0 .cse21 .cse1 .cse33 .cse4 .cse5 .cse6 .cse34 .cse7 .cse24 .cse8 .cse9 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse21 .cse1 .cse22 .cse23 .cse3 .cse37 .cse4 .cse5 .cse34 .cse7 .cse24 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse33 .cse4 .cse5 .cse6 .cse34 (and .cse35 .cse29 .cse38) .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse21 .cse1 .cse33 .cse3 .cse4 .cse5 .cse34 .cse7 .cse24 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse37 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse7 .cse25 .cse8 .cse39 .cse9 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18) (or .cse0 .cse1 .cse22 .cse2 .cse23 .cse4 .cse5 (and .cse27 .cse28 .cse29 .cse38) .cse7 .cse25 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse41 .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse39 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse40 .cse17 .cse18 .cse19) (or .cse0 .cse21 .cse1 .cse22 .cse2 .cse23 .cse4 .cse5 .cse6 .cse7 .cse24 .cse25 .cse8 .cse9 .cse31 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse1 .cse22 .cse23 .cse3 .cse4 .cse5 .cse36 .cse34 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse42 .cse2 (and .cse43 .cse28) .cse3 .cse4 .cse5 (and .cse27 .cse28 .cse7) .cse6 .cse24 .cse25 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse44) (or .cse0 .cse21 .cse1 .cse42 .cse2 .cse4 .cse5 .cse7 .cse24 .cse25 .cse8 .cse26 .cse9 .cse11 .cse31 .cse13 (and .cse27 .cse28 .cse30) .cse14 .cse15 .cse16 .cse17 .cse18 .cse44) (or .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse24 .cse41 .cse25 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse22 .cse2 .cse23 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse28 .cse29 .cse38) .cse32) (or .cse0 .cse1 .cse22 .cse23 .cse33 .cse4 .cse5 .cse34 .cse7 (and .cse27 .cse35 .cse29 .cse38) .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32)))) [2018-11-23 02:14:32,967 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-23 02:14:32,967 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-11-23 02:14:32,967 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse29 (= 1 ~m_pc~0)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse45 (+ ~local~0 1)) (.cse10 (= 1 ~t2_pc~0)) (.cse26 (= ~t1_pc~0 1)) (.cse22 (= 0 ~t1_st~0)) (.cse37 (<= 2 ~m_st~0)) (.cse23 (= 0 ~t2_st~0)) (.cse21 (= ~m_st~0 0)) (.cse35 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse39 (<= 2 ~t2_st~0)) (.cse46 (+ ~local~0 2))) (let ((.cse36 (< .cse46 ~token~0)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse38 (< ~token~0 .cse46)) (.cse40 (and .cse21 .cse35 .cse39)) (.cse7 (< |old(~t1_st~0)| 2)) (.cse12 (and .cse37 .cse35 .cse23)) (.cse41 (and .cse37 .cse22 .cse39)) (.cse34 (and .cse37 .cse35 .cse39)) (.cse32 (< |old(~t2_st~0)| 2)) (.cse2 (not .cse26)) (.cse30 (= 1 ~M_E~0)) (.cse33 (not .cse10)) (.cse43 (< ~token~0 .cse45)) (.cse44 (< .cse45 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse24 (< ~local~0 ~token~0)) (.cse25 (< ~token~0 ~local~0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse27 (not .cse31)) (.cse6 (= 1 ~E_M~0)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse15 (not .cse29)) (.cse42 (and .cse37 .cse22 .cse23)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~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) (or (and .cse21 .cse22 .cse23) .cse0 .cse1 .cse24 .cse25 .cse26 .cse4 .cse5 .cse27 .cse6 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse12 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse32 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse34 .cse17 .cse18 .cse19 .cse20) (or (and .cse21 .cse35 .cse23) .cse0 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse1 .cse36 .cse2 .cse3 .cse4 .cse5 .cse30 .cse33 .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 (and .cse37 .cse35) .cse16 .cse17 .cse18 .cse19 .cse20 .cse38) (or .cse0 (and .cse22 .cse23) .cse1 .cse26 .cse4 .cse5 .cse30 .cse27 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or (and .cse22 .cse39) .cse0 .cse32 .cse1 .cse26 .cse4 .cse5 .cse30 .cse27 .cse6 .cse33 .cse8 .cse9 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse32 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse28 .cse9 .cse11 .cse40 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse32 .cse1 .cse26 .cse3 .cse4 .cse41 .cse5 .cse27 .cse6 .cse33 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse32 .cse1 .cse24 .cse25 .cse26 .cse4 .cse5 .cse27 .cse6 .cse33 .cse8 .cse28 .cse9 .cse11 (and .cse21 .cse22 .cse39) .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29) (or .cse0 .cse1 .cse42 .cse26 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse32 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse30 .cse6 .cse33 (and .cse35 .cse39) .cse7 .cse8 .cse9 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse24 .cse2 .cse25 .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse35 .cse23) .cse29) (or .cse0 .cse32 .cse1 .cse36 .cse2 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse28 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse43 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse44 .cse19 .cse20 .cse12) (or .cse0 .cse32 .cse1 .cse24 .cse25 .cse3 .cse4 .cse5 .cse27 .cse6 .cse33 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse41 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse34 .cse32 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse33 .cse8 .cse43 .cse9 .cse11 .cse15 .cse16 .cse17 .cse18 .cse44 .cse19 .cse20 .cse31) (or .cse0 .cse1 .cse24 .cse25 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-23 02:14:32,967 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-11-23 02:14:32,967 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-11-23 02:14:32,967 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-11-23 02:14:32,967 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-11-23 02:14:32,968 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-23 02:14:32,968 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse41 (= 1 ~m_pc~0)) (.cse46 (+ ~local~0 1)) (.cse30 (= 1 ~t2_pc~0)) (.cse3 (= ~t1_pc~0 1)) (.cse47 (+ ~local~0 2)) (.cse36 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse40 (= 0 ~t2_st~0)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse45 (<= 2 ~m_st~0)) (.cse35 (= activate_threads_~tmp___0~0 0)) (.cse42 (= 0 ~t1_st~0)) (.cse37 (<= 2 ~t2_st~0))) (let ((.cse6 (and .cse45 .cse35 .cse42 .cse37)) (.cse33 (not (= 0 |old(~m_st~0)|))) (.cse8 (not .cse31)) (.cse43 (and .cse45 .cse35 .cse42 .cse40)) (.cse26 (and .cse45 .cse35 .cse36 .cse40)) (.cse24 (not (= 0 |old(~t2_st~0)|))) (.cse39 (= activate_threads_~tmp~1 0)) (.cse27 (< ~local~0 ~token~0)) (.cse28 (< ~token~0 ~local~0)) (.cse34 (= ~m_st~0 0)) (.cse32 (< .cse47 ~token~0)) (.cse22 (< |old(~t1_st~0)| 2)) (.cse14 (= 1 ~E_2~0)) (.cse38 (< ~token~0 .cse47)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse21 (not .cse3)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse29 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not .cse30)) (.cse44 (and .cse45 .cse35 .cse36 .cse37)) (.cse11 (= ~T1_E~0 1)) (.cse23 (< ~token~0 .cse46)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse15 (not .cse41)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse25 (< .cse46 ~token~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) (or .cse0 .cse2 .cse21 .cse4 .cse5 .cse7 .cse9 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse27 .cse28 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse21 .cse26 .cse4 .cse5 .cse7 .cse29 .cse9 .cse11 .cse12 .cse30 .cse13 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse1 .cse2 .cse32 .cse21 .cse5 .cse7 .cse9 .cse10 .cse22 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 (and .cse34 .cse35 .cse36 .cse37) .cse16 .cse17 .cse18 .cse19 .cse20 .cse38) (or .cse0 .cse2 .cse27 .cse21 .cse28 .cse5 .cse7 .cse9 .cse22 .cse11 .cse33 .cse12 .cse30 .cse13 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse34 .cse35 .cse36 .cse39 .cse40) .cse41) (or .cse0 .cse1 .cse2 .cse27 .cse28 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 (and .cse34 .cse35 .cse42 .cse39 .cse37) .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or (and .cse35 .cse42 .cse39 .cse37) .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse30 .cse13 .cse24 .cse14 .cse15 .cse43 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 (and .cse35 .cse42 .cse39 .cse40) .cse2 .cse3 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse30 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or .cse0 .cse1 .cse2 .cse27 .cse21 .cse28 (and .cse13 .cse42 .cse37) .cse5 .cse7 .cse29 (and .cse37 .cse35 .cse36) .cse9 .cse10 .cse22 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or (and .cse34 .cse35 .cse36 .cse39 .cse37) .cse0 .cse1 .cse2 .cse27 .cse21 .cse28 .cse5 .cse7 .cse9 .cse10 .cse22 .cse11 .cse33 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or .cse0 .cse2 (and .cse34 .cse35 .cse42 .cse39 .cse40) .cse27 .cse28 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse33 .cse12 .cse30 .cse13 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse30 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse43) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse7 .cse9 .cse10 .cse22 .cse11 .cse44 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse27 .cse21 .cse28 .cse5 .cse7 .cse29 .cse9 .cse22 .cse11 .cse12 .cse30 .cse24 .cse14 (and .cse13 .cse42 .cse39 .cse40) (and .cse36 (and .cse35 .cse39 .cse40)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or .cse0 .cse2 .cse21 .cse4 .cse5 .cse7 .cse26 .cse9 .cse22 .cse11 .cse12 .cse30 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse39 .cse0 .cse1 .cse2 .cse27 .cse21 .cse28 .cse5 .cse7 .cse29 .cse9 .cse10 .cse22 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse41) (or (and (and .cse45 .cse35) .cse36) .cse0 .cse2 (and .cse34 .cse35 .cse36 .cse9) .cse32 .cse21 .cse4 .cse5 .cse7 .cse29 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse7 .cse29 .cse9 .cse10 .cse44 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse20 .cse31)))) [2018-11-23 02:14:32,968 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-11-23 02:14:32,969 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse33 (= |old(~t1_st~0)| 0)) (.cse20 (= 1 ~m_pc~0)) (.cse25 (= 1 ~t2_pc~0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse21 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse1 (<= 2 ~t2_st~0)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse22 (not .cse5)) (.cse29 (< |old(~m_st~0)| 2)) (.cse11 (not .cse25)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse31 (= 1 ~E_1~0)) (.cse32 (not .cse20)) (.cse30 (<= 2 ~m_st~0)) (.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse2 (= ~T1_E~0 0)) (.cse0 (= 0 ~t1_st~0)) (.cse28 (= 0 ~t2_st~0)) (.cse4 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not .cse33)) (.cse10 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse4 .cse21 .cse22 .cse23 .cse6 .cse7 .cse8 .cse10 .cse24 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse27 .cse28) .cse20) (or .cse2 .cse3 .cse4 .cse21 .cse22 .cse23 .cse6 .cse7 .cse8 .cse10 .cse11 .cse24 .cse12 (and .cse27 .cse1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse2 .cse4 .cse22 .cse29 .cse6 .cse7 .cse8 (and .cse30 .cse27 .cse28) .cse10 .cse12 .cse13 .cse25 .cse31 .cse26 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33) (let ((.cse34 (+ ~local~0 1))) (or .cse2 (and .cse30 .cse27 .cse1) .cse3 .cse4 .cse22 .cse29 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (< ~token~0 .cse34) .cse13 .cse31 .cse32 .cse15 .cse16 .cse17 (< .cse34 ~token~0) .cse18 .cse19 .cse33)) (let ((.cse35 (+ ~local~0 2))) (or .cse2 .cse4 (< .cse35 ~token~0) .cse22 .cse29 .cse6 .cse7 .cse8 .cse11 .cse24 .cse12 .cse13 .cse31 .cse14 .cse32 (and .cse30 .cse27) .cse15 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse35))) (or .cse2 (and .cse0 .cse28) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-23 02:14:32,969 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-11-23 02:14:32,969 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse21 (= 1 ~m_pc~0))) (let ((.cse8 (not (= |old(~t1_st~0)| 0))) (.cse22 (< |old(~m_st~0)| 2)) (.cse23 (not .cse21)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse24 (not .cse4)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~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 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 (and (= ~t2_pc~0 1) (<= 2 ~m_st~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|)) .cse9 .cse25 .cse10 (< |old(~token~0)| .cse26) .cse12 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 (< .cse26 |old(~token~0)|) .cse19 .cse20)) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-11-23 02:14:32,969 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse18 (not (= 0 |old(~m_st~0)|))) (.cse1 (= ~m_st~0 0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse6 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 1)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse10 (not .cse29)) (.cse11 (< |old(~token~0)| ~local~0)) (.cse30 (< |old(~m_st~0)| 2)) (.cse12 (= ~T2_E~0 0)) (.cse33 (<= 2 ~m_st~0)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (= 1 ~t2_pc~0)) (.cse5 (= ~token~0 |old(~token~0)|)) (.cse34 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse17 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 1 |old(~t2_pc~0)|)) (.cse21 (= 1 ~E_1~0)) (.cse22 (= 1 ~E_2~0)) (.cse32 (not .cse28)) (.cse23 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 |old(~E_M~0)|)) (.cse27 (= 0 ~E_2~0))) (and (or .cse0 (and .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 .cse26 .cse27 .cse28) (or .cse0 .cse8 .cse29 .cse30 .cse12 .cse13 .cse14 .cse31 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23 (and .cse33 .cse2 .cse3 .cse4 .cse34 .cse7) .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse8 .cse10 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse33 .cse2 .cse3 .cse4 .cse6 .cse7)) (or .cse0 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse14 .cse31 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse34 .cse7) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse35 (= ~t2_pc~0 1)) (.cse37 (+ ~local~0 1))) (or .cse0 .cse8 (let ((.cse36 (+ ~local~0 2))) (and .cse35 .cse1 .cse2 .cse3 (<= ~token~0 .cse36) .cse6 .cse7 (<= .cse36 ~token~0))) .cse10 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse37) .cse19 .cse21 .cse22 .cse32 (and .cse35 .cse33 .cse2 .cse3 .cse6 .cse7) .cse23 .cse24 .cse25 (< .cse37 |old(~token~0)|) .cse26 .cse27)) (or .cse0 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 (and .cse33 .cse2 .cse3 .cse4 .cse5 .cse34 .cse7) .cse13 .cse14 .cse31 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2018-11-23 02:14:32,969 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-11-23 02:14:32,970 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse21 (= 1 ~m_pc~0))) (let ((.cse8 (not (= |old(~t1_st~0)| 0))) (.cse22 (< |old(~m_st~0)| 2)) (.cse23 (not .cse21)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse24 (not .cse4)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~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 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 (< |old(~token~0)| .cse26) .cse12 .cse14 .cse15 .cse23 (let ((.cse27 (+ ~local~0 2))) (and (= ~t2_pc~0 1) (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse27) (= ~t1_st~0 |old(~t1_st~0)|) (<= .cse27 ~token~0))) .cse16 .cse17 .cse18 (< .cse26 |old(~token~0)|) .cse19 .cse20)) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-11-23 02:14:32,970 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-23 02:14:32,970 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse4 (= ~t1_pc~0 1))) (let ((.cse17 (not (= 0 |old(~m_st~0)|))) (.cse30 (< |old(~t1_st~0)| 2)) (.cse6 (= ~m_st~0 0)) (.cse29 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse28 (not .cse4)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse10 (= ~token~0 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse31 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse32 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse9 (not (= ~E_M~0 1))) (.cse11 (= 0 ~t1_st~0)) (.cse13 (= 1 ~M_E~0)) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 |old(~t2_pc~0)|)) (.cse20 (= 1 ~E_1~0)) (.cse21 (= 1 ~E_2~0)) (.cse33 (not .cse27)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|)) (.cse26 (= 0 ~E_2~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 .cse2 .cse28 .cse3 .cse5 .cse12 .cse13 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse29) .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse28 .cse31 .cse5 (and .cse32 .cse7 .cse8 .cse9 .cse29) .cse12 .cse13 .cse15 .cse30 .cse16 .cse18 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse35 (= ~t2_pc~0 1)) (.cse34 (+ ~local~0 1))) (or .cse0 .cse1 .cse28 .cse31 .cse5 .cse12 .cse13 .cse15 (not .cse19) .cse30 .cse16 (< |old(~token~0)| .cse34) .cse18 .cse20 (and .cse35 .cse32 .cse7 .cse9 .cse29) .cse21 .cse33 (let ((.cse36 (+ ~local~0 2))) (and .cse35 .cse6 .cse7 .cse9 (<= ~token~0 .cse36) .cse29 (<= .cse36 ~token~0))) .cse22 .cse23 .cse24 (< .cse34 |old(~token~0)|) .cse25 .cse26)) (or .cse0 .cse1 .cse2 .cse28 .cse3 .cse31 (and .cse32 .cse7 .cse8 .cse9 .cse10 .cse11) .cse5 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse4 .cse31 .cse5 .cse12 (and .cse32 .cse7 .cse8 .cse9 .cse11) .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2018-11-23 02:14:32,970 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-11-23 02:14:32,970 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1)) (.cse33 (= 1 ~m_pc~0))) (let ((.cse31 (not (= |old(~t1_st~0)| 0))) (.cse27 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse19 (not .cse33)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse2 (not .cse30)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse14 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse16 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~t2_pc~0)|)) (.cse17 (= 1 ~E_1~0)) (.cse18 (= 1 ~E_2~0)) (.cse20 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse25 (= ~m_st~0 0)) (.cse26 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|)) (.cse24 (= 0 ~E_2~0))) (and (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t2_pc~0 1) .cse7 .cse8 .cse9 .cse10) .cse11 (not .cse12) .cse13 .cse14 (< |old(~token~0)| .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< .cse15 |old(~token~0)|) .cse23 .cse24)) (or (and .cse25 .cse26 .cse8 .cse9 .cse27) .cse0 .cse1 .cse28 .cse29 .cse30 .cse4 .cse5 .cse6 .cse31 .cse11 .cse14 .cse32 .cse16 .cse12 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse33) (or .cse0 .cse1 .cse30 .cse3 .cse4 .cse5 .cse6 .cse31 .cse11 .cse14 .cse16 .cse12 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse7 .cse26 .cse8 .cse27)) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse31 .cse11 .cse14 .cse16 .cse12 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse7 .cse26 .cse8 .cse9 .cse27)) (or (and .cse7 .cse26 .cse8 .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse13 .cse14 .cse16 .cse12 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse11 .cse13 .cse14 .cse32 .cse16 .cse12 .cse17 .cse18 .cse20 .cse21 (and .cse25 .cse26 .cse8 .cse9 .cse10) .cse22 .cse23 .cse24 .cse33)))) [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L451 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: true [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-11-23 02:14:32,971 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse23 (= 1 ~m_pc~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse15 (not (= 0 ~t2_st~0))) (.cse2 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse25 (not (= ~t1_st~0 0))) (.cse26 (< ~m_st~0 2)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse29 (< ~t2_st~0 2)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse3 (not .cse24)) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 |old(~M_E~0)|)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse30 (not .cse13)) (.cse9 (< ~t1_st~0 2)) (.cse10 (= |old(~T1_E~0)| 1)) (.cse11 (not (= 0 ~m_st~0))) (.cse22 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse12 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse16 (= 1 |old(~E_2~0)|)) (.cse28 (not .cse23)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse21 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (let ((.cse27 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~token~0 .cse27) .cse12 .cse14 .cse15 .cse16 .cse28 .cse22 .cse17 .cse18 .cse19 (< .cse27 ~token~0) .cse20 .cse21)) (or .cse0 .cse29 .cse1 .cse22 .cse24 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse30 .cse10 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse24 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse11 .cse22 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse2 .cse4 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse30 .cse10 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse29 .cse22 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse8 .cse30 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse22 .cse29 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse31 (+ ~local~0 2))) (or .cse0 .cse29 .cse1 (< .cse31 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse11 .cse22 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse31)))))) [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-11-23 02:14:32,972 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse4 (= ~t1_pc~0 1)) (.cse32 (= ~t1_st~0 0)) (.cse12 (= 1 ~t2_pc~0)) (.cse35 (+ ~local~0 1)) (.cse36 (+ ~local~0 2))) (let ((.cse28 (< .cse36 ~token~0)) (.cse30 (< ~token~0 .cse36)) (.cse33 (< ~token~0 .cse35)) (.cse34 (< .cse35 ~token~0)) (.cse25 (= 1 ~M_E~0)) (.cse23 (< ~t2_st~0 2)) (.cse26 (not .cse12)) (.cse10 (not (= 0 ~m_st~0))) (.cse2 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse7 (not .cse32)) (.cse0 (= ~T1_E~0 0)) (.cse21 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse1 (= ~T2_E~0 1)) (.cse24 (not .cse4)) (.cse31 (< ~m_st~0 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse27 (< ~t1_st~0 2)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse14 (not (= 0 ~t2_st~0))) (.cse15 (= 1 ~E_2~0)) (.cse29 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~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 .cse22) (or .cse0 .cse23 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse25 .cse8 .cse26 .cse27 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (not .cse8) .cse0 .cse1 .cse21 .cse28 .cse24 .cse5 .cse6 .cse25 .cse26 .cse27 .cse9 .cse10 .cse11 .cse13 .cse15 .cse29 .cse16 .cse17 .cse18 .cse20 .cse30) (or .cse0 .cse1 .cse24 .cse31 .cse5 .cse6 .cse25 .cse8 .cse9 .cse11 .cse12 .cse13 .cse21 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse32) (or .cse0 .cse23 .cse1 .cse28 .cse24 .cse5 .cse6 .cse21 .cse8 .cse26 .cse27 .cse9 .cse10 .cse11 .cse13 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30) (or .cse0 .cse1 .cse24 .cse31 .cse5 .cse6 .cse8 .cse27 .cse9 .cse33 .cse11 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21) (or .cse21 .cse0 .cse23 .cse1 .cse24 .cse31 .cse5 .cse6 .cse25 .cse8 .cse26 .cse9 .cse33 .cse11 .cse13 .cse29 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse32) (or .cse21 .cse0 .cse1 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (or .cse0 .cse23 .cse1 .cse4 .cse21 .cse5 .cse6 .cse25 .cse7 .cse8 .cse26 .cse9 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (or .cse27 (or .cse0 .cse1 .cse24 .cse31 .cse5 .cse6 .cse25 .cse26 .cse9 .cse11 .cse13 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21) (or .cse0 .cse21 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse25 .cse8 .cse27 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse13 .cse22) (or .cse21 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (or .cse0 .cse23 .cse1 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse11 .cse13 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse21 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse23 .cse1 .cse24 .cse31 .cse5 .cse6 .cse21 .cse8 .cse26 .cse27 .cse9 .cse11 .cse13 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse21 .cse31 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse11 .cse13 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse23 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse8 .cse26 .cse27 .cse9 .cse10 .cse11 .cse13 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse24 .cse31 .cse5 .cse6 .cse8 .cse27 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-23 02:14:32,973 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (and (= ~m_st~0 0) (= 0 ~t1_st~0) (= 0 ~t2_st~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 ~E_2~0) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0)) [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-11-23 02:14:32,973 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-11-23 02:14:32,974 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (and (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) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:32,974 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_i~0 1) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:32,974 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (and (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) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-23 02:14:32,975 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse10 (= 1 ~t2_pc~0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse26 (< |old(~local~0)| |old(~token~0)|)) (.cse22 (not .cse2)) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse23 (not .cse10)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 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) (let ((.cse21 (+ |old(~local~0)| 2))) (or .cse0 .cse20 .cse1 (< .cse21 |old(~token~0)|) .cse22 .cse3 .cse4 .cse5 .cse7 .cse23 .cse24 .cse8 .cse9 .cse11 .cse13 (not .cse19) .cse14 .cse15 (let ((.cse25 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse25) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0) (<= .cse25 ~token~0))) .cse16 .cse17 .cse18 (< |old(~token~0)| .cse21))) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse26 .cse22 .cse27 .cse3 .cse4 .cse5 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse26 .cse22 .cse27 .cse3 .cse4 .cse5 .cse7 .cse23 .cse24 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-11-23 02:14:32,976 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0))) (let ((.cse12 (= 1 ~t2_pc~0)) (.cse17 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse39 (= 1 ~t1_pc~0)) (.cse40 (not .cse5)) (.cse41 (not .cse1)) (.cse16 (<= 2 ~m_st~0)) (.cse27 (<= ~token~0 ~local~0)) (.cse28 (= 0 ~t1_st~0)) (.cse18 (not (= ~E_1~0 1))) (.cse38 (<= 2 ~t2_st~0)) (.cse42 (not .cse0)) (.cse20 (= 1 ~m_pc~0)) (.cse21 (not (= ~E_1~0 0))) (.cse29 (<= ~local~0 ~token~0)) (.cse36 (= ~t1_pc~0 1))) (let ((.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (< |old(~token~0)| |old(~local~0)|)) (.cse3 (not .cse36)) (.cse32 (and .cse39 .cse40 .cse41 .cse16 .cse27 .cse28 .cse18 .cse38 .cse42 .cse20 .cse21 .cse29)) (.cse33 (and .cse39 .cse40 .cse41 .cse16 .cse17 .cse18 .cse38 .cse42 .cse20 .cse21)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse31 (< |old(~t2_st~0)| 2)) (.cse34 (not .cse12)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse37 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 ~E_2~0)) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 ~E_2~0)) (.cse19 (= 0 ~t2_st~0)) (.cse30 (= 1 |old(~m_pc~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 (and .cse16 .cse27 .cse28 .cse18 .cse19 .cse20 .cse21 .cse29) .cse30) (or .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse33 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse13 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse30) (let ((.cse35 (+ |old(~local~0)| 2))) (or .cse0 .cse31 .cse1 (< .cse35 |old(~token~0)|) .cse3 .cse5 .cse32 .cse33 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse13 .cse15 (not .cse30) .cse22 .cse23 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse35))) (or .cse0 .cse31 .cse1 .cse36 .cse5 .cse6 .cse7 .cse37 .cse8 .cse34 .cse10 .cse11 .cse13 (and .cse16 .cse28 .cse18 .cse38 .cse20 .cse21) .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse30) (or .cse0 .cse1 .cse36 .cse5 .cse6 .cse7 .cse37 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse16 .cse28 .cse18 .cse19 .cse20 .cse21) .cse30))))) [2018-11-23 02:14:32,977 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse10 (= 1 ~t2_pc~0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse24 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse23 (not .cse2)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse21 (not .cse10)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse22 .cse23 .cse24 .cse3 .cse4 .cse5 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse22 .cse23 .cse24 .cse3 .cse4 .cse5 .cse7 .cse21 .cse25 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse26 (+ |old(~local~0)| 2))) (or .cse0 .cse20 .cse1 (< .cse26 |old(~token~0)|) .cse23 .cse3 .cse4 .cse5 .cse7 .cse21 .cse25 .cse8 .cse9 .cse11 .cse13 (not .cse19) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse26)))))) [2018-11-23 02:14:32,979 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse31 (= 1 ~t2_pc~0))) (let ((.cse27 (= 0 ~t1_st~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse22 (<= 2 ~t2_st~0)) (.cse9 (not .cse31)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse33 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse29)) (.cse34 (< |old(~token~0)| |old(~local~0)|)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse26 (not (= ~m_pc~0 1))) (.cse35 (<= ~token~0 ~local~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (= 0 ~t2_st~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 (let ((.cse19 (+ ~local~0 2))) (and .cse18 (<= ~token~0 .cse19) .cse20 .cse21 .cse22 (= 1 ~m_pc~0) (<= .cse19 ~token~0))) .cse23 .cse24 .cse25 (< |old(~token~0)| .cse3))) (or .cse0 .cse2 (and .cse18 .cse26 .cse27 .cse28) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 (and .cse18 .cse26 .cse27 .cse22) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 .cse33 .cse4 .cse34 .cse5 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse22 .cse36) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse2 .cse33 .cse4 .cse34 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse28 .cse36) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15)))) [2018-11-23 02:14:32,979 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse30 (= 1 ~t2_pc~0)) (.cse33 (= ~t1_pc~0 1))) (let ((.cse28 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse33)) (.cse29 (< |old(~token~0)| |old(~local~0)|)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse16 (<= ~local~0 ~token~0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse14 (<= 2 ~t2_st~0)) (.cse9 (not .cse30)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse18 (= 1 |old(~E_1~0)|)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse26 (not (= ~m_pc~0 1))) (.cse32 (= 0 ~t1_st~0)) (.cse27 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_1~0 0))) (.cse19 (= 1 ~E_2~0)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse20 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 (= 1 ~m_pc~0) .cse15 .cse16) .cse17 .cse18 .cse19 (not .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 (< |old(~token~0)| .cse3))) (or (and .cse26 .cse12 .cse13 .cse27 .cse15 .cse16) .cse0 .cse2 .cse28 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse17 .cse30 .cse18 .cse31 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse20) (or .cse0 .cse1 .cse2 .cse28 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18 .cse19 (and .cse26 .cse12 .cse13 .cse14 .cse15 .cse16) .cse21 .cse22 .cse23 .cse24 .cse25 .cse20) (or .cse0 .cse1 .cse2 (and .cse26 .cse32 .cse14 .cse15) .cse33 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse11 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse20) (or .cse0 .cse2 .cse33 .cse5 .cse6 .cse7 .cse34 .cse8 .cse11 .cse17 .cse30 .cse18 .cse31 (and .cse26 .cse32 .cse27 .cse15) .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse20)))) [2018-11-23 02:14:32,980 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-23 02:14:32,980 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-23 02:14:32,981 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse31 (= 1 ~t2_pc~0))) (let ((.cse27 (= 0 ~t1_st~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse22 (<= 2 ~t2_st~0)) (.cse9 (not .cse31)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse33 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse29)) (.cse34 (< |old(~token~0)| |old(~local~0)|)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse26 (not (= ~m_pc~0 1))) (.cse35 (<= ~token~0 ~local~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (= 0 ~t2_st~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 (let ((.cse19 (+ ~local~0 2))) (and .cse18 (<= ~token~0 .cse19) .cse20 .cse21 .cse22 (= 1 ~m_pc~0) (<= .cse19 ~token~0))) .cse23 .cse24 .cse25 (< |old(~token~0)| .cse3))) (or .cse0 .cse2 (and .cse18 .cse26 .cse27 .cse28) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 (and .cse18 .cse26 .cse27 .cse22) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 .cse33 .cse4 .cse34 .cse5 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse22 .cse36) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse2 .cse33 .cse4 .cse34 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse28 .cse36) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15)))) [2018-11-23 02:14:32,982 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-11-23 02:14:32,983 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse22 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse22)) (.cse8 (< ~t1_st~0 2)) (.cse27 (not (= 0 ~m_st~0))) (.cse14 (not (= 0 ~t2_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse24 (< ~t2_st~0 2)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse3 (< ~m_st~0 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 |old(~M_E~0)|)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse23 (not (= ~t1_st~0 0))) (.cse7 (= 1 ~E_M~0)) (.cse26 (not .cse12)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (not .cse30)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0)) (.cse10 (= |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 .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse10) (let ((.cse25 (+ ~local~0 2))) (or .cse0 .cse24 .cse1 (< .cse25 ~token~0) .cse2 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse25))) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse10 .cse30) (or .cse0 .cse24 .cse1 .cse10 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse26 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse10 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse31) .cse11 .cse13 .cse14 .cse15 .cse16 .cse10 .cse17 .cse18 .cse19 (< .cse31 ~token~0) .cse20 .cse21)) (or .cse0 .cse24 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30) (or .cse0 .cse24 .cse10 .cse1 .cse28 .cse29 .cse22 .cse4 .cse5 .cse6 .cse23 .cse7 .cse26 .cse9 .cse27 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30) (or .cse0 .cse1 .cse28 .cse29 .cse22 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse27 .cse11 .cse12 .cse13 .cse10 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30) (or .cse0 .cse1 .cse28 .cse29 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse10 .cse19 .cse20 .cse21) (or .cse0 .cse24 .cse1 .cse28 .cse29 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse26 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse10)))) [2018-11-23 02:14:32,984 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-11-23 02:14:32,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:14:32,984 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= ~t1_st~0 |old(~t1_st~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-23 02:14:32,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:14:32,984 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-11-23 02:14:32,985 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-11-23 02:14:32,985 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-11-23 02:14:32,986 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-11-23 02:14:32,986 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-11-23 02:14:32,986 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-11-23 02:14:32,986 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-11-23 02:14:32,987 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse9 (= ~T1_E~0 1))) (let ((.cse33 (not (= ~m_pc~0 1))) (.cse59 (= 1 ~t1_pc~0)) (.cse60 (not .cse9)) (.cse61 (not .cse4)) (.cse62 (not .cse1)) (.cse49 (= ~m_i~0 1)) (.cse63 (not (= ~M_E~0 0))) (.cse64 (= ~t1_i~0 1)) (.cse32 (not (= ~E_M~0 0))) (.cse65 (not .cse0)) (.cse66 (not (= ~M_E~0 1))) (.cse67 (not (= ~E_1~0 0))) (.cse68 (= ~t2_i~0 1)) (.cse69 (not (= ~E_2~0 0))) (.cse35 (not (= ~E_M~0 1))) (.cse70 (not (= ~E_1~0 1))) (.cse71 (+ ~local~0 2))) (let ((.cse11 (= 1 |old(~t2_pc~0)|)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse48 (= ~t2_pc~0 1)) (.cse53 (<= .cse71 ~token~0)) (.cse52 (and (and .cse59 .cse60 .cse61 .cse62 .cse49 .cse63 .cse64 .cse32 .cse65 .cse66 (= 1 ~m_pc~0) .cse67 .cse68 .cse69 .cse35) .cse70)) (.cse54 (<= ~token~0 .cse71)) (.cse50 (not (= ~E_2~0 1))) (.cse34 (= 0 ~t2_st~0)) (.cse36 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse55 (= ~token~0 |old(~token~0)|)) (.cse21 (<= 2 ~t2_st~0)) (.cse22 (= 1 ~t2_pc~0)) (.cse23 (= |old(~E_1~0)| ~E_1~0)) (.cse24 (= |old(~E_2~0)| ~E_2~0)) (.cse51 (<= 2 ~t1_st~0)) (.cse56 (and .cse59 .cse61 .cse62 .cse63 .cse32 .cse33 .cse65 .cse66 .cse67 .cse69 .cse35)) (.cse57 (<= ~token~0 ~local~0)) (.cse58 (<= ~local~0 ~token~0)) (.cse39 (= 1 |old(~m_pc~0)|)) (.cse31 (not (= ~t1_pc~0 1)))) (let ((.cse25 (= 0 ~t1_st~0)) (.cse26 (and .cse31 .cse61 .cse62 .cse63 .cse64 .cse32 .cse33 .cse65 .cse66 .cse67 .cse69 .cse35)) (.cse3 (< |old(~m_st~0)| 2)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse15 (not .cse39)) (.cse28 (and .cse55 (and .cse21 .cse22 .cse23 .cse24 .cse51 .cse56) .cse57 .cse58)) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse37 (and (and .cse50 .cse23 (and .cse59 .cse60 .cse61 .cse62 .cse49 .cse63 .cse64 .cse32 .cse33 .cse34 .cse65 .cse66 .cse67 .cse68 .cse69 .cse35) (not .cse22) .cse24 .cse51 .cse70 .cse36) .cse55 .cse57 .cse58)) (.cse38 (and .cse21 .cse50 .cse22 .cse51 .cse53 .cse52 .cse54)) (.cse27 (< |old(~local~0)| |old(~token~0)|)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse44 (< |old(~t1_st~0)| 2)) (.cse47 (and .cse55 (and .cse21 .cse23 .cse48 .cse24 .cse51 .cse56) .cse57 .cse58)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse14 (= 1 |old(~E_2~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse20 (= 0 |old(~E_2~0)|)) (.cse40 (< |old(~t2_st~0)| 2)) (.cse43 (not .cse2)) (.cse29 (< |old(~token~0)| |old(~local~0)|)) (.cse41 (and (and .cse21 .cse50 .cse48 .cse51 .cse52) .cse53 .cse54)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse42 (not .cse11)) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse10 (not .cse49)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 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) (or .cse0 .cse1 (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse27 .cse4 .cse28 .cse5 .cse6 .cse7 .cse11 .cse12 .cse14 .cse17 .cse20 .cse29 .cse2 .cse8 .cse9 .cse30 (and .cse23 (and .cse31 .cse32 .cse33 .cse34 .cse35) .cse24 (= ~t1_st~0 |old(~t1_st~0)|) .cse36) .cse10 .cse13 .cse16 .cse18 .cse19 .cse37 .cse38 .cse39) (or .cse0 .cse40 .cse1 .cse27 .cse29 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse42 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse43 .cse3 .cse4 .cse5 .cse6 .cse8 .cse44 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse40 .cse1 .cse43 .cse3 .cse4 .cse5 .cse6 .cse8 .cse42 .cse44 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse45 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse44 .cse12 .cse14 .cse17 .cse20 .cse40 (< .cse45 |old(~token~0)|) .cse43 .cse41 .cse8 .cse42 .cse9 .cse30 .cse10 .cse15 .cse16 .cse18 .cse19 (< |old(~token~0)| .cse45))) (let ((.cse46 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse44 (< |old(~token~0)| .cse46) .cse12 .cse14 .cse17 .cse20 .cse43 .cse41 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse18 (< .cse46 |old(~token~0)|) .cse19)) (or .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse7 .cse47 .cse12 .cse14 .cse17 .cse20 (and .cse21 .cse23 .cse48 .cse24 .cse25 .cse26) .cse40 .cse29 .cse41 .cse2 .cse8 .cse42 .cse9 .cse30 .cse10 .cse16 .cse18 .cse19 .cse39) (or .cse0 .cse40 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse42 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse27 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38) (or .cse0 .cse1 .cse27 .cse4 .cse28 .cse5 .cse6 .cse44 .cse11 .cse12 .cse14 .cse17 .cse20 .cse43 .cse29 .cse8 .cse9 .cse30 .cse10 .cse13 .cse16 .cse18 .cse19 .cse37 .cse38 .cse39) (or .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse44 .cse47 .cse12 .cse14 .cse17 .cse20 .cse40 .cse43 .cse29 .cse41 .cse8 .cse42 .cse9 .cse30 .cse10 .cse16 .cse18 .cse19 .cse39)))))) [2018-11-23 02:14:32,987 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-11-23 02:14:32,989 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-11-23 02:14:32,989 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-11-23 02:14:32,990 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0))) (let ((.cse83 (= 1 ~t1_pc~0)) (.cse70 (not .cse4)) (.cse71 (not .cse1)) (.cse72 (<= 2 ~m_st~0)) (.cse73 (not (= ~M_E~0 0))) (.cse74 (= ~t1_i~0 1)) (.cse52 (not (= ~E_M~0 0))) (.cse75 (not .cse0)) (.cse76 (not (= ~M_E~0 1))) (.cse77 (= 1 ~m_pc~0)) (.cse78 (not (= ~E_1~0 0))) (.cse80 (not (= ~E_2~0 0))) (.cse55 (not (= ~E_M~0 1))) (.cse28 (= ~T1_E~0 1))) (let ((.cse69 (not .cse28)) (.cse68 (= ~m_i~0 1)) (.cse54 (= 0 ~t2_st~0)) (.cse79 (= ~t2_i~0 1)) (.cse18 (not (= ~E_2~0 1))) (.cse47 (not (= ~E_1~0 1))) (.cse65 (and .cse83 .cse70 .cse71 .cse72 .cse73 .cse74 .cse52 .cse75 .cse76 .cse77 .cse78 .cse80 .cse55)) (.cse87 (+ ~local~0 1)) (.cse88 (+ ~local~0 2))) (let ((.cse62 (= 1 |old(~m_pc~0)|)) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse58 (= |old(~t1_pc~0)| 1)) (.cse64 (= ~t2_pc~0 1)) (.cse84 (<= ~token~0 .cse88)) (.cse85 (<= .cse88 ~token~0)) (.cse81 (<= ~token~0 .cse87)) (.cse82 (<= .cse87 ~token~0)) (.cse35 (<= 2 ~t1_st~0)) (.cse43 (<= 2 ~t2_st~0)) (.cse44 (= 1 ~t2_pc~0)) (.cse86 (and .cse18 .cse47 .cse65)) (.cse20 (and .cse83 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse54 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse55)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= 0 ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse50 (not (= ~t1_pc~0 1))) (.cse51 (= ~m_st~0 0)) (.cse53 (not (= ~m_pc~0 1)))) (let ((.cse49 (and .cse50 .cse70 .cse51 .cse71 .cse73 .cse74 .cse52 .cse53 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse39 (< |old(~t2_st~0)| 2)) (.cse42 (and (and .cse18 .cse20 .cse47) .cse16 .cse17 .cse21 .cse22)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse60 (and .cse83 .cse69 .cse70 .cse51 .cse71 .cse68 .cse73 .cse74 .cse52 .cse53 .cse54 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse8 (and .cse43 .cse44 .cse86 .cse16 .cse17 .cse21)) (.cse9 (and .cse43 .cse18 .cse44 .cse35 .cse47 .cse65)) (.cse15 (= ~token~0 |old(~token~0)|)) (.cse45 (and .cse83 .cse69 .cse70 .cse51 .cse71 .cse68 .cse73 .cse74 .cse52 .cse53 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse56 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse23 (and .cse18 .cse81 .cse44 .cse20 .cse82 .cse35 .cse47)) (.cse57 (and .cse18 .cse20 (not .cse44) .cse35 .cse47 .cse22)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse26 (and .cse83 .cse70 .cse51 .cse71 .cse73 .cse52 .cse35 .cse18 .cse76 .cse80 .cse55 .cse84 .cse44 .cse74 .cse47 .cse43 .cse75 .cse77 .cse78 .cse85)) (.cse59 (not (= 0 |old(~m_st~0)|))) (.cse36 (and .cse43 .cse86 .cse64 .cse16 .cse17 .cse21)) (.cse37 (and .cse83 .cse64 .cse51 .cse71 .cse52 .cse35 .cse18 .cse80 .cse55 .cse84 .cse47 .cse43 .cse75 .cse77 .cse78 .cse85)) (.cse63 (< |old(~t1_st~0)| 2)) (.cse38 (and .cse18 .cse81 .cse20 .cse64 .cse82 .cse35 .cse47)) (.cse24 (not .cse58)) (.cse40 (and .cse43 .cse18 .cse64 .cse35 .cse47 .cse65)) (.cse41 (not .cse10)) (.cse3 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (= 0 |old(~E_2~0)|)) (.cse48 (and .cse50 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse75 .cse76 .cse77 .cse78 .cse80 .cse55)) (.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse61 (and .cse50 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse17 .cse54 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse55)) (.cse46 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (= 1 |old(~E_M~0)|)) (.cse29 (not .cse68)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse31 (not .cse62)) (.cse32 (= 0 |old(~E_1~0)|)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20) .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (and .cse18 .cse19 .cse20 .cse35 .cse22)) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse24 .cse25 .cse40 .cse27 .cse41 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34) (or .cse42 .cse0 (and .cse43 .cse44 .cse19 .cse15 .cse45 .cse16 .cse46 .cse35 .cse21) .cse1 (and .cse43 .cse44 .cse46 .cse17 .cse47 .cse48) .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 (and .cse43 .cse44 .cse19 .cse49 .cse15 .cse16 .cse46 .cse17 .cse21) (and .cse19 (and .cse50 .cse51 .cse52 .cse53 .cse54 .cse55) .cse15 .cse16 .cse46 .cse56 .cse21 .cse22) .cse57 .cse25 .cse58 .cse26 .cse27 .cse28 .cse59 .cse29 .cse30 .cse32 (and .cse19 .cse60 .cse15 .cse16 .cse46 .cse35 .cse21 .cse22) .cse33 .cse34 (and .cse61 .cse46 .cse47 .cse22) .cse62) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse63 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse40 .cse24 .cse25 .cse27 .cse41 .cse28 .cse59 .cse29 (and .cse19 .cse64 .cse15 .cse45 .cse46 .cse56 .cse43 .cse16 .cse21) .cse32 .cse33 .cse34 .cse62) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse7 .cse11 (and .cse43 .cse19 .cse64 .cse15 .cse45 .cse16 .cse46 .cse35 .cse21) .cse12 .cse13 .cse14 .cse38 .cse39 (and .cse43 .cse64 .cse46 .cse17 .cse47 .cse48) (and .cse19 .cse64 .cse15 .cse46 .cse17 .cse43 .cse49 .cse16 .cse21) .cse40 .cse25 .cse58 .cse27 .cse41 .cse28 .cse59 .cse29 .cse32 .cse33 .cse34 .cse62) (or .cse0 .cse39 (and .cse43 .cse19 .cse64 .cse46 .cse56 .cse65) .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse27 .cse41 .cse63 .cse28 .cse29 .cse11 .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (or .cse0 (and .cse43 .cse19 .cse64 .cse46 .cse35 .cse65) .cse39 .cse1 .cse58 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse41 .cse28 .cse29 .cse11 (and .cse43 .cse19 .cse64 .cse46 .cse17 .cse48) .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (let ((.cse66 (+ |old(~local~0)| 2))) (or .cse36 .cse0 .cse1 .cse37 .cse4 .cse5 .cse6 .cse63 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse40 (< .cse66 |old(~token~0)|) .cse24 .cse27 .cse41 .cse28 .cse59 .cse29 .cse31 .cse32 .cse33 .cse34 (< |old(~token~0)| .cse66))) (or .cse0 .cse1 .cse24 (and .cse19 .cse20 .cse46 .cse56 .cse22) .cse3 .cse4 .cse5 .cse6 (and .cse43 .cse44 .cse19 .cse46 .cse56 .cse65) .cse27 .cse63 .cse28 .cse29 .cse10 .cse11 .cse30 .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (or .cse42 .cse0 .cse1 .cse2 (and .cse19 .cse60 .cse15 .cse16 .cse46 .cse56 .cse21 .cse22) .cse4 .cse5 .cse6 .cse63 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse43 .cse44 .cse19 .cse15 .cse45 .cse16 .cse46 .cse56 .cse21) .cse13 .cse14 .cse23 .cse57 .cse24 .cse25 .cse26 .cse27 .cse28 .cse59 .cse29 .cse30 .cse32 .cse33 .cse34 .cse62) (let ((.cse67 (+ |old(~local~0)| 1))) (or .cse36 .cse0 .cse1 .cse37 .cse3 .cse4 .cse5 .cse6 .cse63 (< |old(~token~0)| .cse67) .cse11 .cse12 .cse13 .cse14 .cse38 .cse24 .cse40 .cse27 .cse41 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (< .cse67 |old(~token~0)|) .cse34)) (or (and .cse43 .cse44 .cse19 .cse46 .cse35 .cse65) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 (and .cse19 .cse20 .cse46 .cse35 .cse22) .cse13 .cse14 (and .cse43 .cse44 .cse19 .cse46 .cse17 .cse48) .cse58 (and .cse19 .cse61 .cse46 .cse22) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))))))) [2018-11-23 02:14:32,990 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-23 02:14:32,992 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-11-23 02:14:32,993 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0))) (let ((.cse83 (= 1 ~t1_pc~0)) (.cse70 (not .cse4)) (.cse71 (not .cse1)) (.cse72 (<= 2 ~m_st~0)) (.cse73 (not (= ~M_E~0 0))) (.cse74 (= ~t1_i~0 1)) (.cse52 (not (= ~E_M~0 0))) (.cse75 (not .cse0)) (.cse76 (not (= ~M_E~0 1))) (.cse77 (= 1 ~m_pc~0)) (.cse78 (not (= ~E_1~0 0))) (.cse80 (not (= ~E_2~0 0))) (.cse55 (not (= ~E_M~0 1))) (.cse28 (= ~T1_E~0 1))) (let ((.cse69 (not .cse28)) (.cse68 (= ~m_i~0 1)) (.cse54 (= 0 ~t2_st~0)) (.cse79 (= ~t2_i~0 1)) (.cse18 (not (= ~E_2~0 1))) (.cse47 (not (= ~E_1~0 1))) (.cse65 (and .cse83 .cse70 .cse71 .cse72 .cse73 .cse74 .cse52 .cse75 .cse76 .cse77 .cse78 .cse80 .cse55)) (.cse87 (+ ~local~0 1)) (.cse88 (+ ~local~0 2))) (let ((.cse62 (= 1 |old(~m_pc~0)|)) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse58 (= |old(~t1_pc~0)| 1)) (.cse64 (= ~t2_pc~0 1)) (.cse84 (<= ~token~0 .cse88)) (.cse85 (<= .cse88 ~token~0)) (.cse81 (<= ~token~0 .cse87)) (.cse82 (<= .cse87 ~token~0)) (.cse35 (<= 2 ~t1_st~0)) (.cse43 (<= 2 ~t2_st~0)) (.cse44 (= 1 ~t2_pc~0)) (.cse86 (and .cse18 .cse47 .cse65)) (.cse20 (and .cse83 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse54 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse55)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= 0 ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse50 (not (= ~t1_pc~0 1))) (.cse51 (= ~m_st~0 0)) (.cse53 (not (= ~m_pc~0 1)))) (let ((.cse49 (and .cse50 .cse70 .cse51 .cse71 .cse73 .cse74 .cse52 .cse53 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse39 (< |old(~t2_st~0)| 2)) (.cse42 (and (and .cse18 .cse20 .cse47) .cse16 .cse17 .cse21 .cse22)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse60 (and .cse83 .cse69 .cse70 .cse51 .cse71 .cse68 .cse73 .cse74 .cse52 .cse53 .cse54 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse8 (and .cse43 .cse44 .cse86 .cse16 .cse17 .cse21)) (.cse9 (and .cse43 .cse18 .cse44 .cse35 .cse47 .cse65)) (.cse15 (= ~token~0 |old(~token~0)|)) (.cse45 (and .cse83 .cse69 .cse70 .cse51 .cse71 .cse68 .cse73 .cse74 .cse52 .cse53 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse56 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse23 (and .cse18 .cse81 .cse44 .cse20 .cse82 .cse35 .cse47)) (.cse57 (and .cse18 .cse20 (not .cse44) .cse35 .cse47 .cse22)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse26 (and .cse83 .cse70 .cse51 .cse71 .cse73 .cse52 .cse35 .cse18 .cse76 .cse80 .cse55 .cse84 .cse44 .cse74 .cse47 .cse43 .cse75 .cse77 .cse78 .cse85)) (.cse59 (not (= 0 |old(~m_st~0)|))) (.cse36 (and .cse43 .cse86 .cse64 .cse16 .cse17 .cse21)) (.cse37 (and .cse83 .cse64 .cse51 .cse71 .cse52 .cse35 .cse18 .cse80 .cse55 .cse84 .cse47 .cse43 .cse75 .cse77 .cse78 .cse85)) (.cse63 (< |old(~t1_st~0)| 2)) (.cse38 (and .cse18 .cse81 .cse20 .cse64 .cse82 .cse35 .cse47)) (.cse24 (not .cse58)) (.cse40 (and .cse43 .cse18 .cse64 .cse35 .cse47 .cse65)) (.cse41 (not .cse10)) (.cse3 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (= 0 |old(~E_2~0)|)) (.cse48 (and .cse50 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse75 .cse76 .cse77 .cse78 .cse80 .cse55)) (.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse61 (and .cse50 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse17 .cse54 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse55)) (.cse46 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (= 1 |old(~E_M~0)|)) (.cse29 (not .cse68)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse31 (not .cse62)) (.cse32 (= 0 |old(~E_1~0)|)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20) .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (and .cse18 .cse19 .cse20 .cse35 .cse22)) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse24 .cse25 .cse40 .cse27 .cse41 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34) (or .cse42 .cse0 (and .cse43 .cse44 .cse19 .cse15 .cse45 .cse16 .cse46 .cse35 .cse21) .cse1 (and .cse43 .cse44 .cse46 .cse17 .cse47 .cse48) .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 (and .cse43 .cse44 .cse19 .cse49 .cse15 .cse16 .cse46 .cse17 .cse21) (and .cse19 (and .cse50 .cse51 .cse52 .cse53 .cse54 .cse55) .cse15 .cse16 .cse46 .cse56 .cse21 .cse22) .cse57 .cse25 .cse58 .cse26 .cse27 .cse28 .cse59 .cse29 .cse30 .cse32 (and .cse19 .cse60 .cse15 .cse16 .cse46 .cse35 .cse21 .cse22) .cse33 .cse34 (and .cse61 .cse46 .cse47 .cse22) .cse62) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse63 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse40 .cse24 .cse25 .cse27 .cse41 .cse28 .cse59 .cse29 (and .cse19 .cse64 .cse15 .cse45 .cse46 .cse56 .cse43 .cse16 .cse21) .cse32 .cse33 .cse34 .cse62) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse7 .cse11 (and .cse43 .cse19 .cse64 .cse15 .cse45 .cse16 .cse46 .cse35 .cse21) .cse12 .cse13 .cse14 .cse38 .cse39 (and .cse43 .cse64 .cse46 .cse17 .cse47 .cse48) (and .cse19 .cse64 .cse15 .cse46 .cse17 .cse43 .cse49 .cse16 .cse21) .cse40 .cse25 .cse58 .cse27 .cse41 .cse28 .cse59 .cse29 .cse32 .cse33 .cse34 .cse62) (or .cse0 .cse39 (and .cse43 .cse19 .cse64 .cse46 .cse56 .cse65) .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse27 .cse41 .cse63 .cse28 .cse29 .cse11 .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (or .cse0 (and .cse43 .cse19 .cse64 .cse46 .cse35 .cse65) .cse39 .cse1 .cse58 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse41 .cse28 .cse29 .cse11 (and .cse43 .cse19 .cse64 .cse46 .cse17 .cse48) .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (let ((.cse66 (+ |old(~local~0)| 2))) (or .cse36 .cse0 .cse1 .cse37 .cse4 .cse5 .cse6 .cse63 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse40 (< .cse66 |old(~token~0)|) .cse24 .cse27 .cse41 .cse28 .cse59 .cse29 .cse31 .cse32 .cse33 .cse34 (< |old(~token~0)| .cse66))) (or .cse0 .cse1 .cse24 (and .cse19 .cse20 .cse46 .cse56 .cse22) .cse3 .cse4 .cse5 .cse6 (and .cse43 .cse44 .cse19 .cse46 .cse56 .cse65) .cse27 .cse63 .cse28 .cse29 .cse10 .cse11 .cse30 .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (or .cse42 .cse0 .cse1 .cse2 (and .cse19 .cse60 .cse15 .cse16 .cse46 .cse56 .cse21 .cse22) .cse4 .cse5 .cse6 .cse63 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse43 .cse44 .cse19 .cse15 .cse45 .cse16 .cse46 .cse56 .cse21) .cse13 .cse14 .cse23 .cse57 .cse24 .cse25 .cse26 .cse27 .cse28 .cse59 .cse29 .cse30 .cse32 .cse33 .cse34 .cse62) (let ((.cse67 (+ |old(~local~0)| 1))) (or .cse36 .cse0 .cse1 .cse37 .cse3 .cse4 .cse5 .cse6 .cse63 (< |old(~token~0)| .cse67) .cse11 .cse12 .cse13 .cse14 .cse38 .cse24 .cse40 .cse27 .cse41 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (< .cse67 |old(~token~0)|) .cse34)) (or (and .cse43 .cse44 .cse19 .cse46 .cse35 .cse65) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 (and .cse19 .cse20 .cse46 .cse35 .cse22) .cse13 .cse14 (and .cse43 .cse44 .cse19 .cse46 .cse17 .cse48) .cse58 (and .cse19 .cse61 .cse46 .cse22) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))))))) [2018-11-23 02:14:32,996 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse16 (= ~T1_E~0 1))) (let ((.cse44 (not (= ~E_2~0 1))) (.cse55 (not (= ~E_1~0 1))) (.cse70 (= 1 ~t1_pc~0)) (.cse59 (not .cse16)) (.cse60 (not .cse3)) (.cse61 (not .cse1)) (.cse57 (= ~m_i~0 1)) (.cse62 (<= 2 ~m_st~0)) (.cse63 (not (= ~M_E~0 0))) (.cse64 (= ~t1_i~0 1)) (.cse50 (not (= ~E_M~0 0))) (.cse52 (= 0 ~t2_st~0)) (.cse65 (not .cse0)) (.cse66 (not (= ~M_E~0 1))) (.cse67 (= 1 ~m_pc~0)) (.cse68 (not (= ~E_1~0 0))) (.cse69 (not (= ~E_2~0 0))) (.cse53 (not (= ~E_M~0 1)))) (let ((.cse8 (= 1 |old(~t2_pc~0)|)) (.cse28 (= ~t2_pc~0 1)) (.cse49 (= ~m_st~0 0)) (.cse51 (not (= ~m_pc~0 1))) (.cse33 (= |old(~t1_pc~0)| 1)) (.cse45 (and .cse70 .cse59 .cse60 .cse61 .cse57 .cse62 .cse63 .cse64 .cse50 .cse52 .cse65 .cse66 .cse67 .cse68 .cse69 .cse53)) (.cse39 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse40 (= 1 ~t2_pc~0)) (.cse47 (<= ~token~0 ~local~0)) (.cse54 (<= ~local~0 ~token~0)) (.cse58 (and .cse44 .cse55 (and .cse70 .cse59 .cse60 .cse61 .cse57 .cse62 .cse63 .cse50 .cse65 .cse66 .cse67 .cse68 .cse69 .cse53))) (.cse32 (not (= ~t1_st~0 0))) (.cse48 (not (= ~t1_pc~0 1))) (.cse24 (= 1 |old(~m_pc~0)|))) (let ((.cse34 (< |old(~m_st~0)| 2)) (.cse37 (not .cse24)) (.cse38 (and .cse48 .cse60 .cse61 .cse62 .cse63 .cse50 .cse52 .cse65 .cse66 .cse67 .cse68 .cse69 .cse53)) (.cse7 (and .cse26 .cse40 .cse47 .cse54 .cse58 .cse32)) (.cse18 (and (and .cse44 .cse45 .cse55) (not .cse40) .cse39 .cse32)) (.cse20 (not (= 0 |old(~t2_st~0)|))) (.cse13 (not .cse33)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse27 (= |old(~E_1~0)| ~E_1~0)) (.cse46 (= ~token~0 |old(~token~0)|)) (.cse56 (and .cse48 .cse60 .cse49 .cse61 .cse63 .cse64 .cse50 .cse51 .cse65 .cse66 .cse68 .cse69 .cse53)) (.cse29 (= |old(~E_2~0)| ~E_2~0)) (.cse30 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse31 (and .cse48 .cse59 .cse60 .cse61 .cse57 .cse62 .cse63 .cse64 .cse50 .cse65 .cse66 .cse67 .cse68 .cse69 .cse53)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse35 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse41 (and .cse26 .cse8 .cse28 .cse47 .cse54 .cse58 .cse32)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 |old(~E_2~0)|)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse14 (< |old(~token~0)| |old(~local~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse36 (not .cse8)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse19 (not .cse57)) (.cse21 (= 0 |old(~E_1~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 .cse25 (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse1 .cse33 .cse34 .cse3 .cse4 .cse5 .cse35 .cse15 .cse36 .cse16 .cse19 .cse9 .cse10 .cse37 .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse1 (and .cse27 .cse29 .cse38 .cse30 .cse39 .cse32) .cse33 .cse34 .cse3 .cse4 .cse5 .cse35 .cse15 .cse16 .cse19 .cse8 .cse9 .cse20 .cse10 .cse37 .cse21 .cse11 (and .cse26 .cse40 .cse27 .cse29 .cse30 .cse31 .cse32) .cse22 .cse23 .cse12) (or .cse0 .cse1 .cse13 .cse34 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse19 .cse8 .cse9 .cse20 .cse10 .cse37 .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse25 .cse1 .cse13 .cse34 .cse3 .cse4 .cse5 .cse15 .cse36 .cse6 .cse16 .cse19 .cse9 .cse10 .cse37 .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse1 .cse2 .cse34 .cse3 .cse4 .cse5 .cse35 .cse9 .cse41 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse36 .cse16 .cse19 .cse37 .cse21 .cse22 .cse23) (let ((.cse42 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse13 .cse34 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 (< |old(~token~0)| .cse42) .cse19 .cse9 .cse20 .cse41 .cse10 .cse37 .cse21 .cse11 .cse22 (< .cse42 |old(~token~0)|) .cse23 .cse12)) (let ((.cse43 (+ |old(~local~0)| 2))) (or .cse0 .cse25 .cse1 (< .cse43 |old(~token~0)|) .cse13 .cse3 .cse4 .cse5 .cse15 .cse36 .cse6 .cse16 .cse17 .cse19 .cse9 .cse41 .cse10 .cse37 .cse21 .cse11 .cse22 .cse23 .cse12 (< |old(~token~0)| .cse43))) (or .cse0 .cse1 .cse2 .cse34 .cse3 .cse4 .cse5 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse37 (and (and .cse44 .cse27 .cse45) .cse30 .cse39 .cse32) .cse21 .cse22 .cse23) (or .cse0 .cse1 (and .cse27 .cse46 .cse47 .cse29 (and .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) .cse30 .cse54 .cse39 .cse32) .cse2 .cse3 .cse4 .cse5 .cse35 (and .cse29 .cse38 .cse55 .cse30 .cse39 .cse32) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse26 .cse40 .cse27 .cse56 .cse46 .cse47 .cse29 .cse30 .cse54 .cse32) .cse14 .cse33 .cse15 .cse18 .cse16 .cse17 .cse19 .cse20 (and .cse26 .cse40 .cse29 .cse55 .cse30 .cse31 .cse32) .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse25 .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse5 .cse15 .cse36 .cse6 .cse16 .cse17 .cse19 .cse9 .cse41 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12 .cse24) (or .cse0 .cse1 .cse2 (and .cse27 .cse28 .cse46 .cse29 .cse26 .cse56 .cse47 .cse30 .cse54 .cse32) .cse3 (and .cse26 .cse28 .cse29 .cse55 .cse30 .cse31 .cse32) .cse4 .cse5 .cse35 .cse9 .cse41 .cse10 .cse11 .cse12 .cse25 .cse14 .cse33 .cse15 .cse36 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23 .cse24)))))) [2018-11-23 02:14:33,000 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse32 (= 1 |old(~t2_pc~0)|)) (.cse50 (= 1 |old(~m_pc~0)|)) (.cse30 (= |old(~t1_pc~0)| 1))) (let ((.cse19 (< |old(~t1_st~0)| 2)) (.cse7 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse12 (not .cse30)) (.cse13 (< |old(~m_st~0)| 2)) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse24 (not .cse50)) (.cse1 (= 1 ~t1_pc~0)) (.cse4 (<= 2 ~m_st~0)) (.cse35 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse37 (= 0 ~t2_st~0)) (.cse9 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse10 (< |old(~t2_st~0)| 2)) (.cse34 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (= ~t2_pc~0 1)) (.cse43 (= ~m_st~0 0)) (.cse49 (not (= ~m_pc~0 1))) (.cse47 (<= ~token~0 ~local~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse40 (= ~token~0 |old(~token~0)|)) (.cse6 (= |old(~E_2~0)| ~E_2~0)) (.cse36 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse48 (<= ~local~0 ~token~0)) (.cse11 (= ~T2_E~0 1)) (.cse45 (< |old(~local~0)| |old(~token~0)|)) (.cse46 (< |old(~token~0)| |old(~local~0)|)) (.cse14 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse17 (= 1 |old(~E_M~0)|)) (.cse18 (not .cse32)) (.cse20 (= ~T1_E~0 1)) (.cse42 (not (= 0 |old(~m_st~0)|))) (.cse21 (not (= ~m_i~0 1))) (.cse22 (= 1 |old(~E_1~0)|)) (.cse23 (= 1 |old(~E_2~0)|)) (.cse25 (= 0 |old(~E_1~0)|)) (.cse26 (not (= 1 ~t1_i~0))) (.cse27 (not (= 1 ~t2_i~0))) (.cse28 (= 0 |old(~E_M~0)|)) (.cse29 (= 0 |old(~E_2~0)|))) (and (or .cse0 (and .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 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse11 .cse30 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse20 .cse21 .cse32 .cse22 .cse33 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (and .cse34 .cse2 .cse4 .cse35 .cse5 .cse6 .cse36 .cse37 .cse9)) (let ((.cse38 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< |old(~token~0)| .cse38) .cse21 .cse22 .cse33 .cse23 .cse24 (let ((.cse39 (+ ~local~0 1))) (and .cse1 (<= ~token~0 .cse39) .cse2 .cse3 .cse4 .cse5 .cse40 .cse6 .cse7 .cse37 (<= .cse39 ~token~0) .cse9)) .cse25 .cse26 .cse27 (< .cse38 |old(~token~0)|) .cse28 .cse29)) (let ((.cse41 (+ |old(~local~0)| 2))) (or .cse0 .cse10 .cse11 (< .cse41 |old(~token~0)|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse42 (let ((.cse44 (+ ~local~0 2))) (and .cse1 .cse2 .cse3 .cse43 .cse5 (<= ~token~0 .cse44) .cse40 .cse6 .cse7 .cse8 .cse9 (<= .cse44 ~token~0))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (< |old(~token~0)| .cse41))) (or .cse0 .cse10 .cse11 .cse45 .cse12 .cse46 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (and .cse1 .cse2 .cse3 .cse4 .cse47 .cse5 .cse40 .cse6 .cse36 .cse8 .cse9 .cse48)) (or .cse0 .cse10 .cse11 .cse45 .cse12 .cse46 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse42 (and .cse1 .cse2 .cse3 .cse43 .cse49 .cse47 .cse5 .cse40 .cse6 .cse7 .cse8 .cse48) .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse50) (or .cse0 .cse10 .cse11 (and .cse34 .cse2 .cse3 .cse4 .cse5 .cse6 .cse36 .cse8 .cse9) .cse30 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse11 .cse45 .cse12 .cse46 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse42 .cse21 .cse32 .cse22 .cse33 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 (and .cse1 .cse2 .cse43 .cse49 .cse47 .cse35 .cse5 .cse40 .cse6 .cse7 .cse37 .cse48) .cse50) (or .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 (and .cse1 .cse2 .cse4 .cse35 .cse5 .cse6 .cse7 .cse37 .cse9) .cse21 .cse32 .cse22 .cse33 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse11 .cse45 .cse46 .cse30 .cse14 .cse15 .cse16 .cse31 .cse17 .cse20 .cse42 .cse21 .cse32 .cse22 (and .cse34 .cse2 .cse43 .cse49 .cse47 .cse35 .cse5 .cse40 .cse6 .cse36 .cse37 .cse48) .cse33 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse50) (or .cse0 .cse11 .cse45 .cse12 .cse46 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse20 .cse21 .cse32 .cse22 .cse33 .cse23 .cse24 .cse25 .cse26 (and .cse1 .cse2 .cse4 .cse47 .cse35 .cse5 .cse40 .cse6 .cse36 .cse37 .cse9 .cse48) .cse27 .cse28 .cse29) (or .cse0 .cse10 (and .cse34 .cse2 .cse3 .cse43 .cse49 .cse47 .cse5 .cse40 .cse6 .cse36 .cse8 .cse48) .cse11 .cse45 .cse46 .cse30 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse20 .cse42 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse50)))) [2018-11-23 02:14:33,001 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-11-23 02:14:33,007 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-11-23 02:14:33,007 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0))) (let ((.cse58 (= 1 ~t1_pc~0)) (.cse17 (= ~T1_E~0 1)) (.cse62 (not .cse4)) (.cse59 (not .cse1)) (.cse54 (= ~m_i~0 1)) (.cse63 (<= 2 ~m_st~0)) (.cse64 (not (= ~M_E~0 0))) (.cse48 (not (= ~E_M~0 0))) (.cse60 (not .cse0)) (.cse65 (not (= ~M_E~0 1))) (.cse66 (= 1 ~m_pc~0)) (.cse61 (not (= ~E_1~0 0))) (.cse67 (not (= ~E_2~0 0))) (.cse50 (not (= ~E_M~0 1))) (.cse68 (+ ~local~0 1))) (let ((.cse25 (= 1 |old(~m_pc~0)|)) (.cse33 (= 1 |old(~t2_pc~0)|)) (.cse23 (= |old(~t1_pc~0)| 1)) (.cse56 (= 1 ~t2_pc~0)) (.cse47 (= ~m_st~0 0)) (.cse49 (not (= ~m_pc~0 1))) (.cse43 (<= ~token~0 ~local~0)) (.cse37 (= 0 ~t1_st~0)) (.cse44 (<= ~local~0 ~token~0)) (.cse30 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse53 (not (= ~E_2~0 1))) (.cse55 (<= ~token~0 .cse68)) (.cse57 (<= .cse68 ~token~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse45 (not (= ~E_1~0 1))) (.cse31 (and .cse58 (not .cse17) .cse62 .cse59 .cse54 .cse63 .cse64 (= ~t1_i~0 1) .cse48 .cse60 .cse65 .cse66 .cse61 (= ~t2_i~0 1) .cse67 .cse50)) (.cse46 (not (= ~t1_pc~0 1)))) (let ((.cse38 (and .cse46 .cse62 .cse59 .cse63 .cse64 .cse48 .cse60 .cse65 .cse66 .cse61 .cse67 .cse50)) (.cse14 (and .cse53 .cse55 (= ~t2_pc~0 1) .cse57 .cse36 .cse45 .cse31)) (.cse40 (and (and .cse53 .cse45 .cse31) .cse43 .cse37 .cse44 .cse30)) (.cse42 (and .cse58 .cse47 .cse59 .cse48 .cse49 .cse60 .cse61 .cse50)) (.cse28 (= |old(~E_2~0)| ~E_2~0)) (.cse29 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse32 (< |old(~t1_st~0)| 2)) (.cse51 (and .cse53 (not .cse56) .cse36 .cse45 .cse30 .cse31)) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse26 (not .cse23)) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse52 (and .cse53 .cse55 .cse56 .cse57 .cse36 .cse45 .cse31)) (.cse27 (= |old(~E_1~0)| ~E_1~0)) (.cse41 (= ~token~0 |old(~token~0)|)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse3 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse16 (not .cse33)) (.cse18 (not .cse54)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse19 (not .cse25)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 |old(~E_M~0)|)) (.cse11 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse23 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse17 .cse24 .cse18 .cse8 .cse9 .cse20 .cse10 .cse21 .cse22 .cse11 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 (and .cse27 .cse28 .cse29 .cse30 .cse31) .cse15 .cse32 .cse17 .cse18 .cse33 .cse8 .cse34 .cse9 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11) (let ((.cse35 (+ |old(~local~0)| 2))) (or .cse0 .cse12 .cse1 .cse14 (< .cse35 |old(~token~0)|) .cse26 .cse4 .cse5 .cse6 .cse15 .cse16 .cse32 .cse17 .cse24 .cse18 .cse8 .cse9 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11 (< |old(~token~0)| .cse35))) (or .cse0 .cse1 (and .cse27 .cse28 .cse36 .cse30 .cse31) .cse23 .cse3 .cse4 .cse5 (and .cse27 .cse28 .cse37 .cse38 .cse30) .cse6 .cse7 .cse15 .cse17 .cse18 .cse33 .cse8 .cse34 .cse9 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse12 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse32 .cse17 .cse18 .cse8 .cse9 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11) (let ((.cse39 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse32 (< |old(~token~0)| .cse39) .cse8 .cse9 .cse10 .cse11 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21 (< .cse39 |old(~token~0)|) .cse22)) (or .cse0 .cse1 .cse40 .cse2 (and .cse27 .cse41 .cse42 .cse43 .cse28 .cse36 .cse44 .cse30) .cse4 .cse5 .cse6 .cse7 (and .cse28 .cse37 .cse45 .cse38 .cse30) .cse33 .cse8 (and .cse27 (and .cse46 .cse47 .cse48 .cse49 .cse50) .cse41 .cse43 .cse28 .cse37 .cse44 .cse30) .cse9 .cse10 .cse11 .cse51 .cse13 .cse23 .cse15 .cse17 .cse24 .cse18 .cse34 .cse20 .cse21 .cse22 .cse52 .cse25) (or .cse0 .cse12 .cse1 .cse2 .cse14 .cse26 .cse13 .cse4 .cse5 .cse6 .cse15 .cse16 .cse32 .cse17 .cse24 .cse18 .cse8 .cse9 .cse20 .cse10 .cse21 .cse22 .cse11 .cse25) (or .cse0 .cse1 .cse40 .cse2 (and .cse27 .cse41 .cse42 .cse43 .cse28 .cse29 .cse44 .cse30) .cse4 .cse5 .cse6 .cse32 .cse33 .cse8 .cse9 .cse10 .cse11 .cse51 .cse26 .cse13 .cse15 .cse17 .cse24 .cse18 .cse34 .cse20 .cse21 .cse22 .cse52 .cse25) (or .cse0 .cse1 .cse2 .cse3 (and .cse53 .cse27 .cse36 .cse30 .cse31) .cse4 .cse5 .cse6 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse26 .cse13 .cse15 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21 .cse22 .cse52 (and (and .cse53 .cse27 .cse31) .cse41 .cse43 .cse37 .cse44 .cse30)) (or .cse0 .cse12 .cse1 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse17 .cse18 .cse8 .cse9 .cse19 .cse20 .cse10 .cse21 .cse22 .cse11)))))) [2018-11-23 02:14:33,011 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-23 02:14:33,013 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-11-23 02:14:33,013 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0))) (let ((.cse83 (= 1 ~t1_pc~0)) (.cse70 (not .cse4)) (.cse71 (not .cse1)) (.cse72 (<= 2 ~m_st~0)) (.cse73 (not (= ~M_E~0 0))) (.cse74 (= ~t1_i~0 1)) (.cse52 (not (= ~E_M~0 0))) (.cse75 (not .cse0)) (.cse76 (not (= ~M_E~0 1))) (.cse77 (= 1 ~m_pc~0)) (.cse78 (not (= ~E_1~0 0))) (.cse80 (not (= ~E_2~0 0))) (.cse55 (not (= ~E_M~0 1))) (.cse28 (= ~T1_E~0 1))) (let ((.cse69 (not .cse28)) (.cse68 (= ~m_i~0 1)) (.cse54 (= 0 ~t2_st~0)) (.cse79 (= ~t2_i~0 1)) (.cse18 (not (= ~E_2~0 1))) (.cse47 (not (= ~E_1~0 1))) (.cse65 (and .cse83 .cse70 .cse71 .cse72 .cse73 .cse74 .cse52 .cse75 .cse76 .cse77 .cse78 .cse80 .cse55)) (.cse87 (+ ~local~0 1)) (.cse88 (+ ~local~0 2))) (let ((.cse62 (= 1 |old(~m_pc~0)|)) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse58 (= |old(~t1_pc~0)| 1)) (.cse64 (= ~t2_pc~0 1)) (.cse84 (<= ~token~0 .cse88)) (.cse85 (<= .cse88 ~token~0)) (.cse81 (<= ~token~0 .cse87)) (.cse82 (<= .cse87 ~token~0)) (.cse35 (<= 2 ~t1_st~0)) (.cse43 (<= 2 ~t2_st~0)) (.cse44 (= 1 ~t2_pc~0)) (.cse86 (and .cse18 .cse47 .cse65)) (.cse20 (and .cse83 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse54 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse55)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= 0 ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse50 (not (= ~t1_pc~0 1))) (.cse51 (= ~m_st~0 0)) (.cse53 (not (= ~m_pc~0 1)))) (let ((.cse49 (and .cse50 .cse70 .cse51 .cse71 .cse73 .cse74 .cse52 .cse53 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse39 (< |old(~t2_st~0)| 2)) (.cse42 (and (and .cse18 .cse20 .cse47) .cse16 .cse17 .cse21 .cse22)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse60 (and .cse83 .cse69 .cse70 .cse51 .cse71 .cse68 .cse73 .cse74 .cse52 .cse53 .cse54 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse8 (and .cse43 .cse44 .cse86 .cse16 .cse17 .cse21)) (.cse9 (and .cse43 .cse18 .cse44 .cse35 .cse47 .cse65)) (.cse15 (= ~token~0 |old(~token~0)|)) (.cse45 (and .cse83 .cse69 .cse70 .cse51 .cse71 .cse68 .cse73 .cse74 .cse52 .cse53 .cse75 .cse76 .cse78 .cse80 .cse55)) (.cse56 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse23 (and .cse18 .cse81 .cse44 .cse20 .cse82 .cse35 .cse47)) (.cse57 (and .cse18 .cse20 (not .cse44) .cse35 .cse47 .cse22)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse26 (and .cse83 .cse70 .cse51 .cse71 .cse73 .cse52 .cse35 .cse18 .cse76 .cse80 .cse55 .cse84 .cse44 .cse74 .cse47 .cse43 .cse75 .cse77 .cse78 .cse85)) (.cse59 (not (= 0 |old(~m_st~0)|))) (.cse36 (and .cse43 .cse86 .cse64 .cse16 .cse17 .cse21)) (.cse37 (and .cse83 .cse64 .cse51 .cse71 .cse52 .cse35 .cse18 .cse80 .cse55 .cse84 .cse47 .cse43 .cse75 .cse77 .cse78 .cse85)) (.cse63 (< |old(~t1_st~0)| 2)) (.cse38 (and .cse18 .cse81 .cse20 .cse64 .cse82 .cse35 .cse47)) (.cse24 (not .cse58)) (.cse40 (and .cse43 .cse18 .cse64 .cse35 .cse47 .cse65)) (.cse41 (not .cse10)) (.cse3 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (= 0 |old(~E_2~0)|)) (.cse48 (and .cse50 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse75 .cse76 .cse77 .cse78 .cse80 .cse55)) (.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse61 (and .cse50 .cse69 .cse70 .cse71 .cse68 .cse72 .cse73 .cse74 .cse52 .cse17 .cse54 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse55)) (.cse46 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (= 1 |old(~E_M~0)|)) (.cse29 (not .cse68)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse31 (not .cse62)) (.cse32 (= 0 |old(~E_1~0)|)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20) .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (and .cse18 .cse19 .cse20 .cse35 .cse22)) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse24 .cse25 .cse40 .cse27 .cse41 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34) (or .cse42 .cse0 (and .cse43 .cse44 .cse19 .cse15 .cse45 .cse16 .cse46 .cse35 .cse21) .cse1 (and .cse43 .cse44 .cse46 .cse17 .cse47 .cse48) .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 (and .cse43 .cse44 .cse19 .cse49 .cse15 .cse16 .cse46 .cse17 .cse21) (and .cse19 (and .cse50 .cse51 .cse52 .cse53 .cse54 .cse55) .cse15 .cse16 .cse46 .cse56 .cse21 .cse22) .cse57 .cse25 .cse58 .cse26 .cse27 .cse28 .cse59 .cse29 .cse30 .cse32 (and .cse19 .cse60 .cse15 .cse16 .cse46 .cse35 .cse21 .cse22) .cse33 .cse34 (and .cse61 .cse46 .cse47 .cse22) .cse62) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse63 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse40 .cse24 .cse25 .cse27 .cse41 .cse28 .cse59 .cse29 (and .cse19 .cse64 .cse15 .cse45 .cse46 .cse56 .cse43 .cse16 .cse21) .cse32 .cse33 .cse34 .cse62) (or .cse36 .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse7 .cse11 (and .cse43 .cse19 .cse64 .cse15 .cse45 .cse16 .cse46 .cse35 .cse21) .cse12 .cse13 .cse14 .cse38 .cse39 (and .cse43 .cse64 .cse46 .cse17 .cse47 .cse48) (and .cse19 .cse64 .cse15 .cse46 .cse17 .cse43 .cse49 .cse16 .cse21) .cse40 .cse25 .cse58 .cse27 .cse41 .cse28 .cse59 .cse29 .cse32 .cse33 .cse34 .cse62) (or .cse0 .cse39 (and .cse43 .cse19 .cse64 .cse46 .cse56 .cse65) .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse27 .cse41 .cse63 .cse28 .cse29 .cse11 .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (or .cse0 (and .cse43 .cse19 .cse64 .cse46 .cse35 .cse65) .cse39 .cse1 .cse58 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse41 .cse28 .cse29 .cse11 (and .cse43 .cse19 .cse64 .cse46 .cse17 .cse48) .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (let ((.cse66 (+ |old(~local~0)| 2))) (or .cse36 .cse0 .cse1 .cse37 .cse4 .cse5 .cse6 .cse63 .cse11 .cse12 .cse13 .cse14 .cse38 .cse39 .cse40 (< .cse66 |old(~token~0)|) .cse24 .cse27 .cse41 .cse28 .cse59 .cse29 .cse31 .cse32 .cse33 .cse34 (< |old(~token~0)| .cse66))) (or .cse0 .cse1 .cse24 (and .cse19 .cse20 .cse46 .cse56 .cse22) .cse3 .cse4 .cse5 .cse6 (and .cse43 .cse44 .cse19 .cse46 .cse56 .cse65) .cse27 .cse63 .cse28 .cse29 .cse10 .cse11 .cse30 .cse12 .cse31 .cse32 .cse13 .cse33 .cse34 .cse14) (or .cse42 .cse0 .cse1 .cse2 (and .cse19 .cse60 .cse15 .cse16 .cse46 .cse56 .cse21 .cse22) .cse4 .cse5 .cse6 .cse63 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse43 .cse44 .cse19 .cse15 .cse45 .cse16 .cse46 .cse56 .cse21) .cse13 .cse14 .cse23 .cse57 .cse24 .cse25 .cse26 .cse27 .cse28 .cse59 .cse29 .cse30 .cse32 .cse33 .cse34 .cse62) (let ((.cse67 (+ |old(~local~0)| 1))) (or .cse36 .cse0 .cse1 .cse37 .cse3 .cse4 .cse5 .cse6 .cse63 (< |old(~token~0)| .cse67) .cse11 .cse12 .cse13 .cse14 .cse38 .cse24 .cse40 .cse27 .cse41 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (< .cse67 |old(~token~0)|) .cse34)) (or (and .cse43 .cse44 .cse19 .cse46 .cse35 .cse65) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 (and .cse19 .cse20 .cse46 .cse35 .cse22) .cse13 .cse14 (and .cse43 .cse44 .cse19 .cse46 .cse17 .cse48) .cse58 (and .cse19 .cse61 .cse46 .cse22) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))))))) [2018-11-23 02:14:33,015 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-11-23 02:14:33,017 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-11-23 02:14:33,017 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse24 (= ~t1_pc~0 1)) (.cse22 (= 1 ~t2_pc~0)) (.cse14 (= 1 ~E_1~0)) (.cse32 (= ~t1_st~0 0)) (.cse26 (= 1 ~m_pc~0)) (.cse36 (+ ~local~0 2)) (.cse37 (+ ~local~0 1))) (let ((.cse6 (< ~m_st~0 2)) (.cse33 (< ~token~0 .cse37)) (.cse34 (< .cse37 ~token~0)) (.cse27 (< .cse36 ~token~0)) (.cse25 (not (= 0 ~m_st~0))) (.cse16 (not .cse26)) (.cse30 (< ~token~0 .cse36)) (.cse3 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse9 (not .cse32)) (.cse35 (not .cse14)) (.cse23 (not (= 0 ~t2_st~0))) (.cse11 (not .cse22)) (.cse29 (< ~t1_st~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse28 (not .cse24)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse31 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0)) (.cse1 (< ~t2_st~0 2)) (.cse15 (= 1 ~E_2~0)) (.cse5 (= 0 is_transmit2_triggered_~__retres1~2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse14 .cse23 .cse15 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse27 .cse28 .cse7 .cse8 .cse10 .cse11 .cse29 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30) (or .cse29 (or .cse0 .cse2 .cse28 .cse6 .cse7 .cse8 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5) (or .cse0 .cse2 .cse28 .cse6 .cse7 .cse8 .cse31 .cse10 .cse12 .cse13 .cse22 .cse14 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse32 .cse5) (or .cse0 .cse1 .cse2 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse28 .cse6 .cse7 .cse8 .cse31 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse16 .cse17 .cse5 .cse18 .cse19 .cse34 .cse20 .cse21 .cse15 .cse32) (or .cse0 .cse2 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse5 .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse7 .cse8 .cse10 .cse11 .cse29 .cse12 .cse25 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse24 .cse7 .cse8 .cse5 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26) (or .cse0 .cse2 .cse3 .cse28 .cse4 .cse7 .cse8 .cse10 .cse29 .cse12 .cse25 .cse13 .cse22 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse5 .cse26) (or .cse0 .cse2 .cse28 .cse6 .cse7 .cse8 .cse5 .cse10 .cse29 .cse12 .cse13 .cse22 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse7 .cse8 .cse31 .cse9 .cse5 .cse10 .cse11 .cse12 .cse35 .cse13 .cse15 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse5 .cse2 .cse28 .cse6 .cse7 .cse8 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse28 .cse6 .cse7 .cse8 .cse10 .cse5 .cse29 .cse12 .cse33 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse25 .cse13 .cse22 .cse14 .cse23 .cse5 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26) (or .cse29 .cse22 .cse15 .cse5 (or .cse0 .cse2 .cse28 .cse7 .cse8 .cse31 .cse10 .cse12 .cse13 .cse23 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26)) (or .cse0 .cse2 .cse24 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse22 .cse23 .cse15 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26) (or (not .cse10) .cse0 .cse5 .cse2 .cse27 .cse28 .cse7 .cse8 .cse31 .cse11 .cse29 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse35 .cse5 .cse13 .cse22 .cse23 .cse15 .cse18 .cse19 .cse20 .cse21 .cse26) (or .cse11 .cse29 (or .cse0 .cse2 .cse28 .cse7 .cse8 .cse31 .cse10 .cse12 .cse13 .cse17 .cse18 .cse19 .cse20 .cse21) .cse1 .cse15 .cse5)))) [2018-11-23 02:14:33,019 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-11-23 02:14:33,022 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-11-23 02:14:33,022 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-11-23 02:14:33,023 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-11-23 02:14:33,023 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse23 (= 1 ~m_pc~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse15 (not (= 0 ~t2_st~0))) (.cse2 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse25 (not (= ~t1_st~0 0))) (.cse26 (< ~m_st~0 2)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse29 (< ~t2_st~0 2)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse3 (not .cse24)) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 |old(~M_E~0)|)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse30 (not .cse13)) (.cse9 (< ~t1_st~0 2)) (.cse10 (= |old(~T1_E~0)| 1)) (.cse11 (not (= 0 ~m_st~0))) (.cse22 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse12 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~E_1~0)|)) (.cse16 (= 1 |old(~E_2~0)|)) (.cse28 (not .cse23)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse21 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (let ((.cse27 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~token~0 .cse27) .cse12 .cse14 .cse15 .cse16 .cse28 .cse22 .cse17 .cse18 .cse19 (< .cse27 ~token~0) .cse20 .cse21)) (or .cse0 .cse29 .cse1 .cse22 .cse24 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse30 .cse10 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse24 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse11 .cse22 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse2 .cse4 .cse26 .cse5 .cse6 .cse7 .cse25 .cse8 .cse30 .cse10 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse29 .cse22 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse8 .cse30 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse22 .cse29 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse31 (+ ~local~0 2))) (or .cse0 .cse29 .cse1 (< .cse31 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse11 .cse22 .cse12 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse31)))))) [2018-11-23 02:14:33,023 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-11-23 02:14:33,023 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-11-23 02:14:33,023 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-11-23 02:14:33,025 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-11-23 02:14:33,025 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-11-23 02:14:33,025 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-11-23 02:14:33,025 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-11-23 02:14:33,025 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,025 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,026 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-11-23 02:14:33,027 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,027 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse7 (not (= ~E_2~0 1))) (.cse3 (= 1 ~t1_pc~0)) (.cse25 (= ~m_i~0 1)) (.cse22 (<= 2 ~m_st~0)) (.cse23 (= 0 ~t2_st~0)) (.cse6 (= |old(~T2_E~0)| ~T2_E~0)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= 1 ~m_pc~0)) (.cse10 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse11 (not (= ~E_M~0 1))) (.cse5 (not (= ~E_1~0 1)))) (let ((.cse13 (and .cse7 (and .cse3 (not (= ~T1_E~0 1)) (not (= ~T2_E~0 1)) .cse25 .cse22 (= ~t1_i~0 1) .cse23 .cse6 .cse8 .cse9 .cse10 .cse11) .cse5)) (.cse12 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~t2_st~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (= |old(~E_2~0)| ~E_2~0)) (.cse16 (not (= ~t1_pc~0 1))) (.cse4 (= ~m_st~0 0)) (.cse24 (= 0 ~t1_st~0)) (.cse17 (not (= ~m_pc~0 1))) (.cse21 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (let ((.cse0 (+ ~local~0 2))) (and (<= .cse0 ~token~0) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (<= ~token~0 .cse0))) (= |old(~T1_E~0)| 0) (and .cse13 .cse12 .cse14) (= |old(~T2_E~0)| 1) (and .cse1 .cse2 .cse15 (and .cse16 .cse4 .cse17 .cse6 .cse8 .cse10 .cse11) .cse18 .cse19 .cse20 (= ~t1_st~0 |old(~t1_st~0)|) .cse21) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (and (and .cse16 .cse22 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11) .cse20 .cse24 .cse5 .cse14) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse1 .cse2 .cse18 .cse19 .cse12 (and .cse7 .cse15 (and .cse6 .cse3 .cse8 .cse4 .cse10 .cse17 .cse11)) .cse21) (and (and (and .cse7 (and .cse3 .cse22 .cse24 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11) .cse5) .cse14) .cse19 .cse21) (and .cse1 .cse2 (and .cse7 (and .cse6 .cse3 .cse8 .cse9 .cse22 .cse10 .cse11) .cse5) .cse12) (and .cse1 .cse2 (and .cse6 .cse16 .cse8 .cse22 .cse9 .cse10 .cse11) .cse20 .cse24 .cse5) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (and .cse7 .cse15 (and .cse3 .cse4 .cse17 .cse23 .cse6 .cse8 .cse10 .cse11)) .cse18 .cse19 .cse12 .cse21 .cse14) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse25) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (let ((.cse26 (+ ~local~0 1))) (and (<= ~token~0 .cse26) (<= .cse26 ~token~0) (and .cse2 .cse13 .cse12))) (and .cse19 (and .cse1 (and .cse7 (and .cse6 .cse3 .cse8 .cse22 .cse9 .cse10 .cse11) .cse5) .cse2 .cse24) .cse21) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and .cse15 .cse18 .cse19 .cse20 (and .cse16 .cse4 .cse24 .cse17 .cse23 .cse6 .cse8 .cse10 .cse11) .cse21 .cse14) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,029 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-11-23 02:14:33,029 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,031 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-23 02:14:33,031 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,033 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (= ~M_E~0 0)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,034 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,035 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-23 02:14:33,035 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-23 02:14:33,035 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-11-23 02:14:33,035 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,036 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,036 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (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) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-23 02:14:33,038 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,038 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse7 (not (= ~E_2~0 1))) (.cse3 (= 1 ~t1_pc~0)) (.cse25 (= ~m_i~0 1)) (.cse22 (<= 2 ~m_st~0)) (.cse23 (= 0 ~t2_st~0)) (.cse6 (= |old(~T2_E~0)| ~T2_E~0)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= 1 ~m_pc~0)) (.cse10 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse11 (not (= ~E_M~0 1))) (.cse5 (not (= ~E_1~0 1)))) (let ((.cse13 (and .cse7 (and .cse3 (not (= ~T1_E~0 1)) (not (= ~T2_E~0 1)) .cse25 .cse22 (= ~t1_i~0 1) .cse23 .cse6 .cse8 .cse9 .cse10 .cse11) .cse5)) (.cse12 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~t2_st~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (= |old(~E_2~0)| ~E_2~0)) (.cse16 (not (= ~t1_pc~0 1))) (.cse4 (= ~m_st~0 0)) (.cse24 (= 0 ~t1_st~0)) (.cse17 (not (= ~m_pc~0 1))) (.cse21 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (let ((.cse0 (+ ~local~0 2))) (and (<= .cse0 ~token~0) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (<= ~token~0 .cse0))) (= |old(~T1_E~0)| 0) (and .cse13 .cse12 .cse14) (= |old(~T2_E~0)| 1) (and .cse1 .cse2 .cse15 (and .cse16 .cse4 .cse17 .cse6 .cse8 .cse10 .cse11) .cse18 .cse19 .cse20 (= ~t1_st~0 |old(~t1_st~0)|) .cse21) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (and (and .cse16 .cse22 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11) .cse20 .cse24 .cse5 .cse14) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse1 .cse2 .cse18 .cse19 .cse12 (and .cse7 .cse15 (and .cse6 .cse3 .cse8 .cse4 .cse10 .cse17 .cse11)) .cse21) (and (and (and .cse7 (and .cse3 .cse22 .cse24 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11) .cse5) .cse14) .cse19 .cse21) (and .cse1 .cse2 (and .cse7 (and .cse6 .cse3 .cse8 .cse9 .cse22 .cse10 .cse11) .cse5) .cse12) (and .cse1 .cse2 (and .cse6 .cse16 .cse8 .cse22 .cse9 .cse10 .cse11) .cse20 .cse24 .cse5) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (and .cse7 .cse15 (and .cse3 .cse4 .cse17 .cse23 .cse6 .cse8 .cse10 .cse11)) .cse18 .cse19 .cse12 .cse21 .cse14) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse25) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (let ((.cse26 (+ ~local~0 1))) (and (<= ~token~0 .cse26) (<= .cse26 ~token~0) (and .cse2 .cse13 .cse12))) (and .cse19 (and .cse1 (and .cse7 (and .cse6 .cse3 .cse8 .cse22 .cse9 .cse10 .cse11) .cse5) .cse2 .cse24) .cse21) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and .cse15 .cse18 .cse19 .cse20 (and .cse16 .cse4 .cse24 .cse17 .cse23 .cse6 .cse8 .cse10 .cse11) .cse21 .cse14) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,039 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,041 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,042 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,044 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,046 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-11-23 02:14:33,047 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse24 (not (= ~E_2~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse29 (not (= ~T1_E~0 1))) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (= 1 ~m_pc~0)) (.cse27 (= ~m_i~0 1)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (.cse31 (= ~t1_i~0 1)) (.cse17 (= 0 ~t2_st~0)) (.cse30 (not (= ~T2_E~0 1))) (.cse12 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1)))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse24 (and .cse4 .cse29 .cse11 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31 .cse17) .cse30 .cse12) .cse3)) (.cse22 (<= 2 ~t1_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse28 (and .cse24 (and .cse4 .cse29 .cse11 .cse30 (and .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse31) .cse12) .cse3)) (.cse19 (<= ~local~0 ~token~0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= 0 ~t1_st~0)) (.cse20 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12)) (= 1 |old(~E_2~0)|) (and .cse13 .cse14 (and .cse4 .cse11 (and .cse5 .cse15 .cse6 .cse9 .cse16 .cse17) .cse12) .cse18 .cse2 .cse10 .cse19 .cse20) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse21 (+ ~local~0 1))) (and (<= ~token~0 .cse21) (<= .cse21 ~token~0) (and .cse1 .cse22 .cse23))) (and .cse0 (and .cse4 (and .cse5 .cse15 .cse6 .cse9 .cse16) .cse11 .cse12) .cse1 .cse13 .cse14 .cse18 .cse2 .cse10 .cse19) (let ((.cse26 (+ ~local~0 2))) (and (and .cse0 (and .cse4 .cse24 (and .cse25 .cse15 .cse6 .cse7 .cse9) .cse11 .cse3 .cse12) .cse1 .cse22) (<= .cse26 ~token~0) (<= ~token~0 .cse26))) (and .cse14 .cse18 .cse22 (and .cse24 .cse13 (and .cse4 (and .cse25 .cse15 .cse6 .cse9 .cse16 .cse17) .cse11 .cse12)) .cse19 .cse20) (and .cse18 .cse19 (and .cse10 .cse23 .cse20)) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 .cse14 (and .cse24 .cse13 (and .cse4 .cse11 (and .cse25 .cse15 .cse6 .cse9 .cse16) .cse12)) .cse18 .cse22 .cse19) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not .cse27) (and .cse22 .cse23 .cse20) (not (= 0 |old(~t2_st~0)|)) (and .cse0 .cse1 .cse22 .cse28) (and .cse18 (and .cse0 .cse1 .cse28 .cse10) .cse19) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (and (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse17) .cse11 .cse12) .cse2 .cse10 .cse3 .cse20) (= 1 |old(~m_pc~0)|)))) [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-11-23 02:14:33,048 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-11-23 02:14:33,048 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-11-23 02:14:33,050 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse10 (= 1 ~t2_pc~0)) (.cse34 (= ~t1_st~0 0)) (.cse2 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 2)) (.cse36 (+ ~local~0 1))) (let ((.cse29 (< ~token~0 .cse36)) (.cse30 (< .cse36 ~token~0)) (.cse22 (< ~local~0 ~token~0)) (.cse24 (< ~token~0 ~local~0)) (.cse32 (< .cse35 ~token~0)) (.cse26 (< ~t1_st~0 2)) (.cse27 (not (= 0 ~m_st~0))) (.cse33 (< ~token~0 .cse35)) (.cse23 (not .cse2)) (.cse31 (= 1 ~M_E~0)) (.cse12 (not (= 0 ~t2_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse21 (< ~t2_st~0 2)) (.cse1 (= ~T2_E~0 1)) (.cse3 (< ~m_st~0 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (not .cse34)) (.cse7 (= 1 ~E_M~0)) (.cse25 (not .cse10)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse14 (not .cse28)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0)) (.cse15 (= 0 is_master_triggered_~__retres1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse22 .cse23 .cse24 .cse15 .cse4 .cse5 .cse7 .cse25 .cse26 .cse8 .cse27 .cse9 .cse11 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (or .cse0 .cse1 .cse23 .cse3 .cse4 .cse5 .cse7 .cse26 .cse8 .cse29 .cse9 .cse11 .cse12 .cse15 .cse13 .cse14 .cse16 .cse17 .cse18 .cse30 .cse19 .cse20) (or .cse0 .cse1 .cse22 .cse23 .cse24 .cse4 .cse5 .cse31 .cse7 .cse26 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse15 .cse28) (or .cse15 .cse0 .cse21 .cse1 .cse22 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse22 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse15 .cse28) (or .cse15 .cse0 .cse1 .cse7 .cse32 .cse23 .cse3 .cse4 .cse5 .cse31 .cse25 .cse26 .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33) (or .cse15 .cse0 .cse21 .cse1 .cse22 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse27 .cse9 .cse11 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (or .cse15 .cse0 .cse1 .cse22 .cse23 .cse24 .cse4 .cse5 .cse7 .cse26 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (or .cse0 .cse21 .cse1 .cse15 .cse23 .cse3 .cse4 .cse5 .cse31 .cse7 .cse25 .cse8 .cse29 .cse9 .cse11 .cse14 .cse16 .cse17 .cse18 .cse30 .cse19 .cse20 .cse34) (or .cse0 .cse21 .cse1 .cse15 .cse23 .cse3 .cse4 .cse5 .cse7 .cse25 .cse26 .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse23 .cse3 .cse4 .cse5 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse15 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse7 .cse25 .cse15 .cse8 .cse9 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (or .cse0 .cse21 .cse1 .cse22 .cse23 .cse24 .cse15 .cse4 .cse5 .cse31 .cse7 .cse25 .cse26 .cse8 .cse9 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse22 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse15) (or .cse0 .cse21 .cse1 .cse32 .cse23 .cse4 .cse5 .cse7 .cse25 .cse26 .cse8 .cse27 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse15 .cse33) (or .cse0 .cse15 .cse1 .cse23 .cse3 .cse4 .cse5 .cse31 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34) (or .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse15)))) [2018-11-23 02:14:33,050 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-11-23 02:14:33,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~T2_E~0 1)) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (= 0 ~t2_st~0) (not (= ~E_2~0 1)) (not (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (not (= 1 ~t2_pc~0)) (not (= ~t2_i~0 1)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) [2018-11-23 02:14:33,052 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:14:33,052 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-11-23 02:14:33,052 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse3 (= ~t1_pc~0 1))) (let ((.cse26 (not (= 0 ~m_st~0))) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse13 (not (= 0 ~t2_st~0))) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (= |old(~T1_E~0)| 0)) (.cse21 (< ~t2_st~0 2)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse23 (not .cse3)) (.cse4 (< ~m_st~0 2)) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse24 (not .cse11)) (.cse25 (< ~t1_st~0 2)) (.cse9 (= |old(~T1_E~0)| 1)) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse14 (= 1 |old(~E_2~0)|)) (.cse15 (not .cse30)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse2 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse20 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse22 (+ ~local~0 2))) (or .cse0 .cse21 .cse1 (< .cse22 ~token~0) .cse23 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< ~token~0 .cse22) .cse2)) (let ((.cse27 (+ ~local~0 1))) (or .cse0 .cse1 .cse23 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 (< ~token~0 .cse27) .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse27 ~token~0) .cse19 .cse20 .cse2)) (or .cse0 .cse1 .cse23 .cse4 .cse5 .cse6 .cse8 .cse25 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse28 .cse23 .cse29 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse26 .cse10 .cse12 .cse2 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30) (or .cse0 .cse21 .cse1 .cse28 .cse29 .cse3 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse26 .cse10 .cse12 .cse2 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30) (or .cse0 .cse21 .cse1 .cse28 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse2 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse0 .cse1 .cse28 .cse29 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30) (or .cse2 .cse0 .cse1 .cse28 .cse23 .cse29 .cse5 .cse6 .cse8 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30) (or .cse0 .cse1 .cse28 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse2 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse23 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse2 .cse17 .cse18 .cse19 .cse20)))) [2018-11-23 02:14:33,055 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-11-23 02:14:33,055 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-11-23 02:14:33,055 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-11-23 02:14:33,055 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-11-23 02:14:33,056 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (= 1 |old(~t2_i~0)|) (= ~T2_E~0 1) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (not (= 0 ~t2_st~0)) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (= 1 ~E_2~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0)) [2018-11-23 02:14:33,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:14:33 BoogieIcfgContainer [2018-11-23 02:14:33,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:14:33,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:14:33,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:14:33,157 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:14:33,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:13:16" (3/4) ... [2018-11-23 02:14:33,160 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-23 02:14:33,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-23 02:14:33,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-23 02:14:33,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-23 02:14:33,174 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 02:14:33,175 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 02:14:33,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || ((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && !(E_1 == 1)) && ((\old(T2_E) == T2_E && ((((!(t1_pc == 1) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && \old(T1_E) == T1_E) && !(E_M == 1))) || 1 == \old(E_2)) || (((((((\old(E_1) == E_1 && token == \old(token)) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((token <= local + 1 && local + 1 <= token) && (1 == t2_pc && 2 <= t1_st) && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && ((((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1))) || ((((((((2 <= t2_st && ((\old(T2_E) == T2_E && (((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && ((((\old(T2_E) == T2_E && !(E_2 == 1)) && (((1 == t1_pc && m_st == 0) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && !(E_M == 1)) && 1 == t2_pc) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || (((((token == \old(token) && token <= local) && 2 <= t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && ((\old(T2_E) == T2_E && ((((1 == t1_pc && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(E_M == 1)) && local <= token) && \old(t2_pc) == t2_pc)) || ((token <= local && local <= token) && (0 == t1_st && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && ((((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || ((((((2 <= t2_st && 1 == t2_pc) && token == \old(token)) && (!(E_2 == 1) && \old(E_1) == E_1) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && (((1 == t1_pc && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && token <= local) && 2 <= t1_st) && local <= token)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((2 <= t1_st && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && ((((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || !(0 == \old(t2_st))) || (((2 <= t2_st && 1 == t2_pc) && 2 <= t1_st) && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_M == 1)) && !(E_1 == 1))) || ((token <= local && ((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_M == 1)) && !(E_1 == 1)) && 0 == t1_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((\old(T2_E) == T2_E && ((((!(t1_pc == 1) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(E_M == 1)) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || 1 == \old(m_pc) [2018-11-23 02:14:33,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) [2018-11-23 02:14:33,200 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((token == \old(token) && token <= local) && 0 == t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local <= token) && \old(t2_pc) == t2_pc)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || T2_E == 1) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token)) || (((((((\old(E_1) == E_1 && ((((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((T1_E == 0 || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && \old(t2_pc) == t2_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) || T1_E == 0) || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t1_pc) == 1) || (((\old(E_1) == E_1 && ((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && \old(t2_pc) == t2_pc)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-23 02:14:33,200 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((token == \old(token) && token <= local) && 0 == t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local <= token) && \old(t2_pc) == t2_pc)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || T2_E == 1) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token)) || (((((((\old(E_1) == E_1 && ((((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((T1_E == 0 || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && \old(t2_pc) == t2_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) || T1_E == 0) || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t1_pc) == 1) || (((\old(E_1) == E_1 && ((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && \old(t2_pc) == t2_pc)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-23 02:14:33,202 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-11-23 02:14:33,202 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc)) [2018-11-23 02:14:33,204 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-11-23 02:14:33,206 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(E_2) == E_2) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && ((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(E_2 == 0)) && local <= token)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(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)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((2 <= m_st && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0))) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || ((((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 0 == t2_st) && token <= local) && ((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(E_2 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-11-23 02:14:33,209 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || \old(E_2) == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-11-23 02:14:33,211 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) [2018-11-23 02:14:33,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && t1_st == \old(t1_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || ((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st))) || 1 == E_2) || !(1 == m_pc)) || ((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && local + 2 <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || (((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && 0 == t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) [2018-11-23 02:14:33,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || ((((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) [2018-11-23 02:14:33,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((t2_pc == 1 && 2 <= m_st) && \old(E_M) == E_M) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) [2018-11-23 02:14:33,271 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_82d40007-e58c-4614-ac4c-be10b06ad185/bin-2019/uautomizer/witness.graphml [2018-11-23 02:14:33,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:14:33,272 INFO L168 Benchmark]: Toolchain (without parser) took 77227.24 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 959.2 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 842.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:14:33,273 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-23 02:14:33,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.31 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-23 02:14:33,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.19 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:14:33,273 INFO L168 Benchmark]: Boogie Preprocessor took 62.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:14:33,273 INFO L168 Benchmark]: RCFGBuilder took 420.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:14:33,274 INFO L168 Benchmark]: TraceAbstraction took 76404.51 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-23 02:14:33,274 INFO L168 Benchmark]: Witness Printer took 114.86 ms. Allocated memory is still 3.0 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:14:33,275 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 207.31 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 Procedure Inliner took 14.19 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 420.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76404.51 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 114.86 ms. Allocated memory is still 3.0 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && t1_st == \old(t1_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || ((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st))) || 1 == E_2) || !(1 == m_pc)) || ((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && local + 2 <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || (((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && 0 == t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || 1 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || 0 == __retres1) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 0 == __retres1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((t1_st < 2 || 1 == t2_pc) || 1 == E_2) || 0 == __retres1) || ((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || 0 == __retres1) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 0 == __retres1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((!(1 == t2_pc) || t1_st < 2) || ((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t2_st < 2) || 1 == E_2) || 0 == __retres1) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || \old(E_2) == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(E_2) == E_2) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && ((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(E_2 == 0)) && local <= token)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(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)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((2 <= m_st && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0))) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || ((((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((2 <= m_st && t1_st == \old(t1_st)) && 0 == t2_st) && !(E_2 == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0))) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || (((((\old(E_2) == E_2 && t1_st == \old(t1_st)) && 0 == t2_st) && token <= local) && ((!(T1_E == 0) && !(T2_E == 0)) && m_st == 0) && !(E_2 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 0 == __retres1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 1 == E_M) || local + 2 < token) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((token == \old(token) && token <= local) && 0 == t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local <= token) && \old(t2_pc) == t2_pc)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || T2_E == 1) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token)) || (((((((\old(E_1) == E_1 && ((((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((T1_E == 0 || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && \old(t2_pc) == t2_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) || T1_E == 0) || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t1_pc) == 1) || (((\old(E_1) == E_1 && ((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && \old(t2_pc) == t2_pc)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 0 == __retres1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == E_1) || 1 == m_pc)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || ((((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((t2_pc == 1 && 2 <= m_st) && \old(E_M) == E_M) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((token == \old(token) && token <= local) && 0 == t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local <= token) && \old(t2_pc) == t2_pc)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((!(E_2 == 1) && \old(E_1) == E_1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || T2_E == 1) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token)) || (((((((\old(E_1) == E_1 && ((((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || ((((((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 2 <= t1_st) && local <= token)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || ((((((((\old(E_1) == E_1 && t2_pc == 1) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && (((((((((((!(t1_pc == 1) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((T1_E == 0 || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || \old(t2_st) < 2) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && \old(t2_pc) == t2_pc)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((((((((((((((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc) || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || (((((((\old(E_1) == E_1 && ((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token) && \old(t2_pc) == t2_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || (((((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && m_i == 1) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && 1 == t2_pc) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || (((((!(E_2 == 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && !(1 == t2_pc)) && 2 <= t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && m_st == 0) && !(T2_E == 1)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(M_E == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((((((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && token <= local) && 0 == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || (((((((((((((((1 == t1_pc && t2_pc == 1) && m_st == 0) && !(T2_E == 1)) && !(E_M == 0)) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local + 2 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((!(E_2 == 1) && token <= local + 1) && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && t2_pc == 1) && local + 1 <= token) && 2 <= t1_st) && !(E_1 == 1))) || !(\old(t1_pc) == 1)) || (((((2 <= t2_st && !(E_2 == 1)) && t2_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 2 <= t1_st) && (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) || T1_E == 0) || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((\old(E_1) == E_1 && (((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && 2 <= t1_st) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((2 <= t2_st && 1 == t2_pc) && \old(E_1) == E_1) && \old(E_2) == E_2) && 0 == t1_st) && (((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t1_pc) == 1) || (((\old(E_1) == E_1 && ((((((((((((((((!(t1_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t1_st) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && \old(t2_pc) == t2_pc)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || ((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && !(E_1 == 1)) && ((\old(T2_E) == T2_E && ((((!(t1_pc == 1) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t1_st) && \old(T1_E) == T1_E) && !(E_M == 1))) || 1 == \old(E_2)) || (((((((\old(E_1) == E_1 && token == \old(token)) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((token <= local + 1 && local + 1 <= token) && (1 == t2_pc && 2 <= t1_st) && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && ((((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1))) || ((((((((2 <= t2_st && ((\old(T2_E) == T2_E && (((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && 1 == t2_pc) && \old(E_1) == E_1) && token == \old(token)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token)) || (((((2 <= t2_st && ((((\old(T2_E) == T2_E && !(E_2 == 1)) && (((1 == t1_pc && m_st == 0) && !(M_E == 1)) && 1 == m_pc) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && !(E_M == 1)) && 1 == t2_pc) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || (((((token == \old(token) && token <= local) && 2 <= t1_st) && (!(E_2 == 1) && \old(E_1) == E_1) && ((\old(T2_E) == T2_E && ((((1 == t1_pc && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(E_M == 1)) && local <= token) && \old(t2_pc) == t2_pc)) || ((token <= local && local <= token) && (0 == t1_st && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && ((((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || ((((((2 <= t2_st && 1 == t2_pc) && token == \old(token)) && (!(E_2 == 1) && \old(E_1) == E_1) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && (((1 == t1_pc && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && token <= local) && 2 <= t1_st) && local <= token)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || ((2 <= t1_st && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && ((((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t2_st) && !(T2_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || !(0 == \old(t2_st))) || (((2 <= t2_st && 1 == t2_pc) && 2 <= t1_st) && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_M == 1)) && !(E_1 == 1))) || ((token <= local && ((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && ((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && (((((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && m_i == 1) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_M == 1)) && !(E_1 == 1)) && 0 == t1_st) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || (((((((\old(T2_E) == T2_E && ((((!(t1_pc == 1) && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && 0 == t2_st) && \old(T1_E) == T1_E) && !(E_M == 1)) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || 1 == \old(m_pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 76.2s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 60.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6270 SDtfs, 8430 SDslu, 7863 SDs, 0 SdLazy, 6230 SolverSat, 2399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1499 GetRequests, 1340 SyntacticMatches, 37 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5840occurred in iteration=21, 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: 3.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 1775 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 17467 PreInvPairs, 18336 NumberOfFragments, 61900 HoareAnnotationTreeSize, 17467 FomulaSimplifications, 792881 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 71 FomulaSimplificationsInter, 542199 FormulaSimplificationTreeSizeReductionInter, 54.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5015 NumberOfCodeBlocks, 5015 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4984 ConstructedInterpolants, 0 QuantifiedInterpolants, 1161553 SizeOfPredicates, 1 NumberOfNonLiveVariables, 5853 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 2256/2325 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...