./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/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 94ba032acbdf60cd08371ca325fec24fa00e036a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:41:12,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:41:12,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:41:12,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:41:12,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:41:12,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:41:12,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:41:12,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:41:12,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:41:12,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:41:12,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:41:12,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:41:12,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:41:12,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:41:12,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:41:12,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:41:12,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:41:12,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:41:12,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:41:12,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:41:12,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:41:12,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:41:12,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:41:12,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:41:12,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:41:12,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:41:12,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:41:12,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:41:12,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:41:12,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:41:12,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:41:12,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:41:12,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:41:12,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:41:12,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:41:12,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:41:12,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:41:12,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:41:12,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:41:12,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:41:12,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:41:12,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:41:12,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:41:12,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:41:12,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:41:12,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:41:12,604 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:41:12,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:41:12,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:41:12,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:41:12,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:41:12,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:41:12,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:41:12,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:41:12,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:41:12,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:41:12,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:41:12,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:41:12,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:41:12,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:41:12,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:41:12,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:41:12,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:41:12,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:41:12,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:41:12,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:41:12,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:41:12,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:41:12,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:41:12,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:41:12,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/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 -> 94ba032acbdf60cd08371ca325fec24fa00e036a [2019-11-16 00:41:12,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:41:12,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:41:12,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:41:12,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:41:12,678 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:41:12,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2019-11-16 00:41:12,756 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/data/cd082357a/379c4ba0efba47cd85862a0bd0578160/FLAGb0cd8a079 [2019-11-16 00:41:13,308 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:41:13,308 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2019-11-16 00:41:13,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/data/cd082357a/379c4ba0efba47cd85862a0bd0578160/FLAGb0cd8a079 [2019-11-16 00:41:13,592 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/data/cd082357a/379c4ba0efba47cd85862a0bd0578160 [2019-11-16 00:41:13,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:41:13,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:41:13,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:41:13,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:41:13,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:41:13,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:41:13" (1/1) ... [2019-11-16 00:41:13,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee4d6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:13, skipping insertion in model container [2019-11-16 00:41:13,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:41:13" (1/1) ... [2019-11-16 00:41:13,613 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:41:13,674 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:41:14,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:41:14,054 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:41:14,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:41:14,208 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:41:14,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14 WrapperNode [2019-11-16 00:41:14,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:41:14,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:41:14,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:41:14,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:41:14,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:41:14,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:41:14,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:41:14,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:41:14,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... [2019-11-16 00:41:14,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:41:14,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:41:14,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:41:14,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:41:14,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/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 [2019-11-16 00:41:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:41:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:41:15,675 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:41:15,675 INFO L284 CfgBuilder]: Removed 39 assume(true) statements. [2019-11-16 00:41:15,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:15 BoogieIcfgContainer [2019-11-16 00:41:15,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:41:15,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:41:15,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:41:15,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:41:15,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:41:13" (1/3) ... [2019-11-16 00:41:15,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dda7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:41:15, skipping insertion in model container [2019-11-16 00:41:15,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:41:14" (2/3) ... [2019-11-16 00:41:15,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dda7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:41:15, skipping insertion in model container [2019-11-16 00:41:15,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:15" (3/3) ... [2019-11-16 00:41:15,693 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2019-11-16 00:41:15,703 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:41:15,714 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:41:15,726 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:41:15,755 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:41:15,755 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:41:15,755 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:41:15,755 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:41:15,756 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:41:15,756 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:41:15,756 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:41:15,756 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:41:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states. [2019-11-16 00:41:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:41:15,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:15,792 INFO L380 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] [2019-11-16 00:41:15,794 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2019-11-16 00:41:15,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:15,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190240434] [2019-11-16 00:41:15,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:15,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:15,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:15,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190240434] [2019-11-16 00:41:15,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:15,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:15,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276170387] [2019-11-16 00:41:16,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:16,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:16,017 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 3 states. [2019-11-16 00:41:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:16,625 INFO L93 Difference]: Finished difference Result 731 states and 1328 transitions. [2019-11-16 00:41:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:16,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-16 00:41:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:16,659 INFO L225 Difference]: With dead ends: 731 [2019-11-16 00:41:16,659 INFO L226 Difference]: Without dead ends: 454 [2019-11-16 00:41:16,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-16 00:41:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 438. [2019-11-16 00:41:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-16 00:41:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 689 transitions. [2019-11-16 00:41:16,826 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 689 transitions. Word has length 28 [2019-11-16 00:41:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:16,828 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 689 transitions. [2019-11-16 00:41:16,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 689 transitions. [2019-11-16 00:41:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:41:16,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:16,841 INFO L380 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] [2019-11-16 00:41:16,842 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2019-11-16 00:41:16,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:16,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330407327] [2019-11-16 00:41:16,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:16,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:16,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:16,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330407327] [2019-11-16 00:41:16,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:16,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:16,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077660860] [2019-11-16 00:41:16,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:16,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:16,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:16,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:16,944 INFO L87 Difference]: Start difference. First operand 438 states and 689 transitions. Second operand 3 states. [2019-11-16 00:41:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:17,146 INFO L93 Difference]: Finished difference Result 1147 states and 1829 transitions. [2019-11-16 00:41:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:17,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-16 00:41:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:17,153 INFO L225 Difference]: With dead ends: 1147 [2019-11-16 00:41:17,154 INFO L226 Difference]: Without dead ends: 723 [2019-11-16 00:41:17,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-16 00:41:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 707. [2019-11-16 00:41:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-16 00:41:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1144 transitions. [2019-11-16 00:41:17,202 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1144 transitions. Word has length 38 [2019-11-16 00:41:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:17,203 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1144 transitions. [2019-11-16 00:41:17,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1144 transitions. [2019-11-16 00:41:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:41:17,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:17,206 INFO L380 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] [2019-11-16 00:41:17,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2019-11-16 00:41:17,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:17,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948872819] [2019-11-16 00:41:17,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:17,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:17,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:17,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948872819] [2019-11-16 00:41:17,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:17,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:17,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938558890] [2019-11-16 00:41:17,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:17,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:17,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:17,280 INFO L87 Difference]: Start difference. First operand 707 states and 1144 transitions. Second operand 3 states. [2019-11-16 00:41:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:17,363 INFO L93 Difference]: Finished difference Result 1781 states and 2881 transitions. [2019-11-16 00:41:17,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:17,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-16 00:41:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:17,375 INFO L225 Difference]: With dead ends: 1781 [2019-11-16 00:41:17,375 INFO L226 Difference]: Without dead ends: 1099 [2019-11-16 00:41:17,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-11-16 00:41:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1087. [2019-11-16 00:41:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-11-16 00:41:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1754 transitions. [2019-11-16 00:41:17,456 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1754 transitions. Word has length 39 [2019-11-16 00:41:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:17,456 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1754 transitions. [2019-11-16 00:41:17,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1754 transitions. [2019-11-16 00:41:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:41:17,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:17,460 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:41:17,460 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2019-11-16 00:41:17,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:17,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224295920] [2019-11-16 00:41:17,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:17,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:17,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:17,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224295920] [2019-11-16 00:41:17,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:17,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:17,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548775732] [2019-11-16 00:41:17,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:17,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:17,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:17,576 INFO L87 Difference]: Start difference. First operand 1087 states and 1754 transitions. Second operand 3 states. [2019-11-16 00:41:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:17,694 INFO L93 Difference]: Finished difference Result 2909 states and 4694 transitions. [2019-11-16 00:41:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:17,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-16 00:41:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:17,709 INFO L225 Difference]: With dead ends: 2909 [2019-11-16 00:41:17,709 INFO L226 Difference]: Without dead ends: 1847 [2019-11-16 00:41:17,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-11-16 00:41:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1701. [2019-11-16 00:41:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2019-11-16 00:41:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2708 transitions. [2019-11-16 00:41:17,798 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2708 transitions. Word has length 46 [2019-11-16 00:41:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:17,799 INFO L462 AbstractCegarLoop]: Abstraction has 1701 states and 2708 transitions. [2019-11-16 00:41:17,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2708 transitions. [2019-11-16 00:41:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:41:17,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:17,801 INFO L380 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] [2019-11-16 00:41:17,802 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-11-16 00:41:17,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:17,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689967212] [2019-11-16 00:41:17,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:17,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:17,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:17,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689967212] [2019-11-16 00:41:17,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:17,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:17,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824258202] [2019-11-16 00:41:17,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:17,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:17,889 INFO L87 Difference]: Start difference. First operand 1701 states and 2708 transitions. Second operand 3 states. [2019-11-16 00:41:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:18,148 INFO L93 Difference]: Finished difference Result 4749 states and 7540 transitions. [2019-11-16 00:41:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:18,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:41:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:18,172 INFO L225 Difference]: With dead ends: 4749 [2019-11-16 00:41:18,172 INFO L226 Difference]: Without dead ends: 3067 [2019-11-16 00:41:18,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2019-11-16 00:41:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3001. [2019-11-16 00:41:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3001 states. [2019-11-16 00:41:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4703 transitions. [2019-11-16 00:41:18,307 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4703 transitions. Word has length 52 [2019-11-16 00:41:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:18,308 INFO L462 AbstractCegarLoop]: Abstraction has 3001 states and 4703 transitions. [2019-11-16 00:41:18,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4703 transitions. [2019-11-16 00:41:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:41:18,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:18,310 INFO L380 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] [2019-11-16 00:41:18,311 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-11-16 00:41:18,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:18,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240020938] [2019-11-16 00:41:18,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:18,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:18,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:18,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240020938] [2019-11-16 00:41:18,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:18,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:18,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068941664] [2019-11-16 00:41:18,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:18,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:18,385 INFO L87 Difference]: Start difference. First operand 3001 states and 4703 transitions. Second operand 3 states. [2019-11-16 00:41:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:18,571 INFO L93 Difference]: Finished difference Result 7063 states and 11022 transitions. [2019-11-16 00:41:18,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:18,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:41:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:18,598 INFO L225 Difference]: With dead ends: 7063 [2019-11-16 00:41:18,599 INFO L226 Difference]: Without dead ends: 4085 [2019-11-16 00:41:18,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-11-16 00:41:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3901. [2019-11-16 00:41:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-11-16 00:41:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6033 transitions. [2019-11-16 00:41:18,801 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6033 transitions. Word has length 52 [2019-11-16 00:41:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:18,802 INFO L462 AbstractCegarLoop]: Abstraction has 3901 states and 6033 transitions. [2019-11-16 00:41:18,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6033 transitions. [2019-11-16 00:41:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:41:18,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:18,806 INFO L380 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] [2019-11-16 00:41:18,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1900061236, now seen corresponding path program 1 times [2019-11-16 00:41:18,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:18,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518836075] [2019-11-16 00:41:18,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:18,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:18,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:18,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518836075] [2019-11-16 00:41:18,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:18,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:18,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262170993] [2019-11-16 00:41:18,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:18,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:18,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:18,873 INFO L87 Difference]: Start difference. First operand 3901 states and 6033 transitions. Second operand 3 states. [2019-11-16 00:41:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:19,551 INFO L93 Difference]: Finished difference Result 9389 states and 14610 transitions. [2019-11-16 00:41:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:19,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-16 00:41:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:19,592 INFO L225 Difference]: With dead ends: 9389 [2019-11-16 00:41:19,593 INFO L226 Difference]: Without dead ends: 5511 [2019-11-16 00:41:19,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2019-11-16 00:41:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5421. [2019-11-16 00:41:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-11-16 00:41:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 8297 transitions. [2019-11-16 00:41:19,886 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 8297 transitions. Word has length 58 [2019-11-16 00:41:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:19,887 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 8297 transitions. [2019-11-16 00:41:19,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 8297 transitions. [2019-11-16 00:41:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:41:19,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:19,889 INFO L380 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] [2019-11-16 00:41:19,890 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2019-11-16 00:41:19,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:19,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395115241] [2019-11-16 00:41:19,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:19,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:19,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:19,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395115241] [2019-11-16 00:41:19,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:19,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:19,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714490475] [2019-11-16 00:41:19,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:19,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:19,944 INFO L87 Difference]: Start difference. First operand 5421 states and 8297 transitions. Second operand 3 states. [2019-11-16 00:41:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:20,305 INFO L93 Difference]: Finished difference Result 10819 states and 16564 transitions. [2019-11-16 00:41:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:20,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-16 00:41:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:20,344 INFO L225 Difference]: With dead ends: 10819 [2019-11-16 00:41:20,345 INFO L226 Difference]: Without dead ends: 5421 [2019-11-16 00:41:20,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-11-16 00:41:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5421. [2019-11-16 00:41:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-11-16 00:41:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 8161 transitions. [2019-11-16 00:41:20,761 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 8161 transitions. Word has length 60 [2019-11-16 00:41:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:20,762 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 8161 transitions. [2019-11-16 00:41:20,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 8161 transitions. [2019-11-16 00:41:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:41:20,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:20,765 INFO L380 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] [2019-11-16 00:41:20,765 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:20,766 INFO L82 PathProgramCache]: Analyzing trace with hash 64035235, now seen corresponding path program 1 times [2019-11-16 00:41:20,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:20,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946903499] [2019-11-16 00:41:20,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:20,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:20,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:20,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946903499] [2019-11-16 00:41:20,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:20,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:20,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613601542] [2019-11-16 00:41:20,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:20,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:20,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:20,820 INFO L87 Difference]: Start difference. First operand 5421 states and 8161 transitions. Second operand 3 states. [2019-11-16 00:41:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:21,523 INFO L93 Difference]: Finished difference Result 12227 states and 18448 transitions. [2019-11-16 00:41:21,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:21,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-16 00:41:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:21,572 INFO L225 Difference]: With dead ends: 12227 [2019-11-16 00:41:21,572 INFO L226 Difference]: Without dead ends: 6829 [2019-11-16 00:41:21,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2019-11-16 00:41:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 6075. [2019-11-16 00:41:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2019-11-16 00:41:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 8971 transitions. [2019-11-16 00:41:21,968 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 8971 transitions. Word has length 61 [2019-11-16 00:41:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:21,970 INFO L462 AbstractCegarLoop]: Abstraction has 6075 states and 8971 transitions. [2019-11-16 00:41:21,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 8971 transitions. [2019-11-16 00:41:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:41:21,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:21,973 INFO L380 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] [2019-11-16 00:41:21,973 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2019-11-16 00:41:21,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:21,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357613915] [2019-11-16 00:41:21,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:21,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:21,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:22,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357613915] [2019-11-16 00:41:22,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:22,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:41:22,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659929900] [2019-11-16 00:41:22,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:41:22,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:41:22,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:41:22,114 INFO L87 Difference]: Start difference. First operand 6075 states and 8971 transitions. Second operand 5 states. [2019-11-16 00:41:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:23,706 INFO L93 Difference]: Finished difference Result 31527 states and 46500 transitions. [2019-11-16 00:41:23,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:41:23,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-16 00:41:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:23,785 INFO L225 Difference]: With dead ends: 31527 [2019-11-16 00:41:23,785 INFO L226 Difference]: Without dead ends: 25475 [2019-11-16 00:41:23,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:41:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25475 states. [2019-11-16 00:41:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25475 to 8423. [2019-11-16 00:41:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8423 states. [2019-11-16 00:41:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12424 transitions. [2019-11-16 00:41:24,795 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12424 transitions. Word has length 63 [2019-11-16 00:41:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:24,796 INFO L462 AbstractCegarLoop]: Abstraction has 8423 states and 12424 transitions. [2019-11-16 00:41:24,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:41:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12424 transitions. [2019-11-16 00:41:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:41:24,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:24,799 INFO L380 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] [2019-11-16 00:41:24,800 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2019-11-16 00:41:24,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:24,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311556067] [2019-11-16 00:41:24,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:24,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:24,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:24,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311556067] [2019-11-16 00:41:24,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:24,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:41:24,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194425918] [2019-11-16 00:41:24,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:41:24,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:24,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:41:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:41:24,989 INFO L87 Difference]: Start difference. First operand 8423 states and 12424 transitions. Second operand 7 states. [2019-11-16 00:41:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:28,621 INFO L93 Difference]: Finished difference Result 41619 states and 61265 transitions. [2019-11-16 00:41:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:41:28,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-16 00:41:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:28,869 INFO L225 Difference]: With dead ends: 41619 [2019-11-16 00:41:28,869 INFO L226 Difference]: Without dead ends: 33219 [2019-11-16 00:41:28,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:41:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33219 states. [2019-11-16 00:41:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33219 to 5593. [2019-11-16 00:41:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5593 states. [2019-11-16 00:41:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 8137 transitions. [2019-11-16 00:41:29,576 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 8137 transitions. Word has length 64 [2019-11-16 00:41:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:29,577 INFO L462 AbstractCegarLoop]: Abstraction has 5593 states and 8137 transitions. [2019-11-16 00:41:29,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:41:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 8137 transitions. [2019-11-16 00:41:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:41:29,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:29,586 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:41:29,587 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash -642302294, now seen corresponding path program 1 times [2019-11-16 00:41:29,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:29,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544771325] [2019-11-16 00:41:29,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:29,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:29,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:29,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544771325] [2019-11-16 00:41:29,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:29,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:29,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581947476] [2019-11-16 00:41:29,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:29,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:29,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:29,639 INFO L87 Difference]: Start difference. First operand 5593 states and 8137 transitions. Second operand 3 states. [2019-11-16 00:41:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:30,165 INFO L93 Difference]: Finished difference Result 11802 states and 17131 transitions. [2019-11-16 00:41:30,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:30,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-16 00:41:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:30,180 INFO L225 Difference]: With dead ends: 11802 [2019-11-16 00:41:30,180 INFO L226 Difference]: Without dead ends: 6230 [2019-11-16 00:41:30,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-11-16 00:41:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 6138. [2019-11-16 00:41:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2019-11-16 00:41:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 8897 transitions. [2019-11-16 00:41:30,815 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 8897 transitions. Word has length 77 [2019-11-16 00:41:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:30,815 INFO L462 AbstractCegarLoop]: Abstraction has 6138 states and 8897 transitions. [2019-11-16 00:41:30,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 8897 transitions. [2019-11-16 00:41:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:41:30,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:30,820 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:30,820 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2019-11-16 00:41:30,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:30,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456343583] [2019-11-16 00:41:30,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:30,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:30,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:30,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456343583] [2019-11-16 00:41:30,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:30,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:30,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634437579] [2019-11-16 00:41:30,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:30,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:30,865 INFO L87 Difference]: Start difference. First operand 6138 states and 8897 transitions. Second operand 3 states. [2019-11-16 00:41:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:31,478 INFO L93 Difference]: Finished difference Result 15750 states and 22694 transitions. [2019-11-16 00:41:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:31,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-16 00:41:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:31,497 INFO L225 Difference]: With dead ends: 15750 [2019-11-16 00:41:31,498 INFO L226 Difference]: Without dead ends: 9501 [2019-11-16 00:41:31,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9501 states. [2019-11-16 00:41:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9501 to 9473. [2019-11-16 00:41:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2019-11-16 00:41:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 13515 transitions. [2019-11-16 00:41:31,963 INFO L78 Accepts]: Start accepts. Automaton has 9473 states and 13515 transitions. Word has length 88 [2019-11-16 00:41:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:31,963 INFO L462 AbstractCegarLoop]: Abstraction has 9473 states and 13515 transitions. [2019-11-16 00:41:31,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9473 states and 13515 transitions. [2019-11-16 00:41:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:41:31,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:31,968 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:31,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2019-11-16 00:41:31,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:31,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085367323] [2019-11-16 00:41:31,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:31,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:31,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:32,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085367323] [2019-11-16 00:41:32,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:32,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:32,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031763279] [2019-11-16 00:41:32,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:32,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:32,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:32,016 INFO L87 Difference]: Start difference. First operand 9473 states and 13515 transitions. Second operand 3 states. [2019-11-16 00:41:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:32,900 INFO L93 Difference]: Finished difference Result 17390 states and 24716 transitions. [2019-11-16 00:41:32,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:32,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-16 00:41:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:32,917 INFO L225 Difference]: With dead ends: 17390 [2019-11-16 00:41:32,918 INFO L226 Difference]: Without dead ends: 6954 [2019-11-16 00:41:32,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6954 states. [2019-11-16 00:41:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6954 to 6541. [2019-11-16 00:41:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6541 states. [2019-11-16 00:41:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 8897 transitions. [2019-11-16 00:41:33,413 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 8897 transitions. Word has length 95 [2019-11-16 00:41:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:33,414 INFO L462 AbstractCegarLoop]: Abstraction has 6541 states and 8897 transitions. [2019-11-16 00:41:33,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 8897 transitions. [2019-11-16 00:41:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:41:33,416 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:33,417 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:33,417 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1408787564, now seen corresponding path program 1 times [2019-11-16 00:41:33,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:33,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390257471] [2019-11-16 00:41:33,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:33,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:41:33,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390257471] [2019-11-16 00:41:33,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:33,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:33,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327894907] [2019-11-16 00:41:33,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:33,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:33,470 INFO L87 Difference]: Start difference. First operand 6541 states and 8897 transitions. Second operand 3 states. [2019-11-16 00:41:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:33,791 INFO L93 Difference]: Finished difference Result 10570 states and 14444 transitions. [2019-11-16 00:41:33,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:33,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:41:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:33,799 INFO L225 Difference]: With dead ends: 10570 [2019-11-16 00:41:33,800 INFO L226 Difference]: Without dead ends: 4143 [2019-11-16 00:41:33,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2019-11-16 00:41:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4125. [2019-11-16 00:41:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-11-16 00:41:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5490 transitions. [2019-11-16 00:41:34,112 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5490 transitions. Word has length 98 [2019-11-16 00:41:34,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:34,113 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 5490 transitions. [2019-11-16 00:41:34,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5490 transitions. [2019-11-16 00:41:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:41:34,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:34,115 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:34,115 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1416682179, now seen corresponding path program 1 times [2019-11-16 00:41:34,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:34,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187485940] [2019-11-16 00:41:34,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:34,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:34,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:41:34,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187485940] [2019-11-16 00:41:34,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:34,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:34,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745575934] [2019-11-16 00:41:34,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:34,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:34,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:34,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:34,205 INFO L87 Difference]: Start difference. First operand 4125 states and 5490 transitions. Second operand 3 states. [2019-11-16 00:41:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:34,453 INFO L93 Difference]: Finished difference Result 7312 states and 9768 transitions. [2019-11-16 00:41:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:34,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:41:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:34,460 INFO L225 Difference]: With dead ends: 7312 [2019-11-16 00:41:34,460 INFO L226 Difference]: Without dead ends: 3262 [2019-11-16 00:41:34,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-11-16 00:41:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2960. [2019-11-16 00:41:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2019-11-16 00:41:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3855 transitions. [2019-11-16 00:41:34,914 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3855 transitions. Word has length 98 [2019-11-16 00:41:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:34,914 INFO L462 AbstractCegarLoop]: Abstraction has 2960 states and 3855 transitions. [2019-11-16 00:41:34,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3855 transitions. [2019-11-16 00:41:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:41:34,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:34,917 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:34,917 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -965689605, now seen corresponding path program 1 times [2019-11-16 00:41:34,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:34,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865487483] [2019-11-16 00:41:34,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:34,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:34,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:41:34,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865487483] [2019-11-16 00:41:34,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:34,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:34,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314562250] [2019-11-16 00:41:34,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:34,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:34,987 INFO L87 Difference]: Start difference. First operand 2960 states and 3855 transitions. Second operand 3 states. [2019-11-16 00:41:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:35,229 INFO L93 Difference]: Finished difference Result 3286 states and 4247 transitions. [2019-11-16 00:41:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:35,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-16 00:41:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:35,233 INFO L225 Difference]: With dead ends: 3286 [2019-11-16 00:41:35,233 INFO L226 Difference]: Without dead ends: 3282 [2019-11-16 00:41:35,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-11-16 00:41:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3257. [2019-11-16 00:41:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2019-11-16 00:41:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 4200 transitions. [2019-11-16 00:41:35,430 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 4200 transitions. Word has length 99 [2019-11-16 00:41:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:35,430 INFO L462 AbstractCegarLoop]: Abstraction has 3257 states and 4200 transitions. [2019-11-16 00:41:35,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 4200 transitions. [2019-11-16 00:41:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-16 00:41:35,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:35,433 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:35,433 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash -488246995, now seen corresponding path program 1 times [2019-11-16 00:41:35,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:35,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721984503] [2019-11-16 00:41:35,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:35,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:35,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:41:35,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721984503] [2019-11-16 00:41:35,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:35,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:41:35,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432645727] [2019-11-16 00:41:35,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:41:35,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:41:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:41:35,549 INFO L87 Difference]: Start difference. First operand 3257 states and 4200 transitions. Second operand 5 states. [2019-11-16 00:41:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:36,447 INFO L93 Difference]: Finished difference Result 12108 states and 15680 transitions. [2019-11-16 00:41:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:41:36,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-11-16 00:41:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:36,457 INFO L225 Difference]: With dead ends: 12108 [2019-11-16 00:41:36,457 INFO L226 Difference]: Without dead ends: 9043 [2019-11-16 00:41:36,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:41:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9043 states. [2019-11-16 00:41:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9043 to 3259. [2019-11-16 00:41:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2019-11-16 00:41:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 4194 transitions. [2019-11-16 00:41:36,727 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 4194 transitions. Word has length 158 [2019-11-16 00:41:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:36,728 INFO L462 AbstractCegarLoop]: Abstraction has 3259 states and 4194 transitions. [2019-11-16 00:41:36,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:41:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 4194 transitions. [2019-11-16 00:41:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:41:36,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:36,732 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:36,732 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2019-11-16 00:41:36,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:36,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276056396] [2019-11-16 00:41:36,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:36,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:36,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:41:36,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276056396] [2019-11-16 00:41:36,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050479313] [2019-11-16 00:41:36,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:37,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:41:37,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:41:37,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:41:37,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-16 00:41:37,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182368066] [2019-11-16 00:41:37,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:41:37,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:37,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:41:37,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:41:37,279 INFO L87 Difference]: Start difference. First operand 3259 states and 4194 transitions. Second operand 9 states. [2019-11-16 00:41:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:40,329 INFO L93 Difference]: Finished difference Result 17481 states and 22705 transitions. [2019-11-16 00:41:40,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:41:40,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-11-16 00:41:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:40,373 INFO L225 Difference]: With dead ends: 17481 [2019-11-16 00:41:40,374 INFO L226 Difference]: Without dead ends: 14436 [2019-11-16 00:41:40,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:41:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14436 states. [2019-11-16 00:41:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14436 to 4893. [2019-11-16 00:41:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4893 states. [2019-11-16 00:41:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 6364 transitions. [2019-11-16 00:41:41,132 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 6364 transitions. Word has length 160 [2019-11-16 00:41:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:41,132 INFO L462 AbstractCegarLoop]: Abstraction has 4893 states and 6364 transitions. [2019-11-16 00:41:41,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:41:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 6364 transitions. [2019-11-16 00:41:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-16 00:41:41,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:41,138 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:41:41,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:41,344 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2019-11-16 00:41:41,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:41,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191213944] [2019-11-16 00:41:41,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:41,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:41,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:41:41,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191213944] [2019-11-16 00:41:41,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429112574] [2019-11-16 00:41:41,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:41,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:41:41,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:41:42,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:41:42,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-16 00:41:42,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406602387] [2019-11-16 00:41:42,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:41:42,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:41:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:41:42,278 INFO L87 Difference]: Start difference. First operand 4893 states and 6364 transitions. Second operand 11 states. [2019-11-16 00:41:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:46,277 INFO L93 Difference]: Finished difference Result 22829 states and 29640 transitions. [2019-11-16 00:41:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:41:46,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-11-16 00:41:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:46,304 INFO L225 Difference]: With dead ends: 22829 [2019-11-16 00:41:46,304 INFO L226 Difference]: Without dead ends: 18150 [2019-11-16 00:41:46,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:41:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18150 states. [2019-11-16 00:41:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18150 to 6358. [2019-11-16 00:41:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6358 states. [2019-11-16 00:41:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 8288 transitions. [2019-11-16 00:41:47,381 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 8288 transitions. Word has length 258 [2019-11-16 00:41:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:47,382 INFO L462 AbstractCegarLoop]: Abstraction has 6358 states and 8288 transitions. [2019-11-16 00:41:47,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:41:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 8288 transitions. [2019-11-16 00:41:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-16 00:41:47,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:47,389 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:41:47,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:47,595 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1870192825, now seen corresponding path program 1 times [2019-11-16 00:41:47,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:47,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163064624] [2019-11-16 00:41:47,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:47,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:47,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-16 00:41:48,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163064624] [2019-11-16 00:41:48,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:48,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:41:48,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686757759] [2019-11-16 00:41:48,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:41:48,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:48,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:41:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:41:48,104 INFO L87 Difference]: Start difference. First operand 6358 states and 8288 transitions. Second operand 9 states. [2019-11-16 00:41:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:49,432 INFO L93 Difference]: Finished difference Result 14100 states and 18349 transitions. [2019-11-16 00:41:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:41:49,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 357 [2019-11-16 00:41:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:49,441 INFO L225 Difference]: With dead ends: 14100 [2019-11-16 00:41:49,441 INFO L226 Difference]: Without dead ends: 7950 [2019-11-16 00:41:49,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:41:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7950 states. [2019-11-16 00:41:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7950 to 6204. [2019-11-16 00:41:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2019-11-16 00:41:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 8082 transitions. [2019-11-16 00:41:50,140 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 8082 transitions. Word has length 357 [2019-11-16 00:41:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:50,141 INFO L462 AbstractCegarLoop]: Abstraction has 6204 states and 8082 transitions. [2019-11-16 00:41:50,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:41:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 8082 transitions. [2019-11-16 00:41:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-16 00:41:50,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:50,145 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:50,145 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:50,145 INFO L82 PathProgramCache]: Analyzing trace with hash -228519270, now seen corresponding path program 1 times [2019-11-16 00:41:50,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:50,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872396621] [2019-11-16 00:41:50,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:50,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:50,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-16 00:41:50,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872396621] [2019-11-16 00:41:50,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:50,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:50,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176473215] [2019-11-16 00:41:50,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:50,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:50,326 INFO L87 Difference]: Start difference. First operand 6204 states and 8082 transitions. Second operand 3 states. [2019-11-16 00:41:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:51,522 INFO L93 Difference]: Finished difference Result 13947 states and 18249 transitions. [2019-11-16 00:41:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:51,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-11-16 00:41:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:51,531 INFO L225 Difference]: With dead ends: 13947 [2019-11-16 00:41:51,531 INFO L226 Difference]: Without dead ends: 7957 [2019-11-16 00:41:51,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-11-16 00:41:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7656. [2019-11-16 00:41:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-11-16 00:41:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 9757 transitions. [2019-11-16 00:41:52,350 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 9757 transitions. Word has length 357 [2019-11-16 00:41:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:52,351 INFO L462 AbstractCegarLoop]: Abstraction has 7656 states and 9757 transitions. [2019-11-16 00:41:52,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 9757 transitions. [2019-11-16 00:41:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-16 00:41:52,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:52,353 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:52,354 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:52,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1050472350, now seen corresponding path program 1 times [2019-11-16 00:41:52,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:52,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223286072] [2019-11-16 00:41:52,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:52,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:52,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-16 00:41:52,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223286072] [2019-11-16 00:41:52,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:52,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:52,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624988207] [2019-11-16 00:41:52,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:52,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:52,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:52,522 INFO L87 Difference]: Start difference. First operand 7656 states and 9757 transitions. Second operand 3 states. [2019-11-16 00:41:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:52,944 INFO L93 Difference]: Finished difference Result 8987 states and 11270 transitions. [2019-11-16 00:41:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:52,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-11-16 00:41:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:52,947 INFO L225 Difference]: With dead ends: 8987 [2019-11-16 00:41:52,947 INFO L226 Difference]: Without dead ends: 1431 [2019-11-16 00:41:52,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-11-16 00:41:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1428. [2019-11-16 00:41:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-16 00:41:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1578 transitions. [2019-11-16 00:41:53,144 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1578 transitions. Word has length 358 [2019-11-16 00:41:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:53,144 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1578 transitions. [2019-11-16 00:41:53,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1578 transitions. [2019-11-16 00:41:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-16 00:41:53,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:53,150 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:53,150 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2019-11-16 00:41:53,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:53,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698284996] [2019-11-16 00:41:53,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:53,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:53,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-16 00:41:53,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698284996] [2019-11-16 00:41:53,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:53,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:41:53,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285661984] [2019-11-16 00:41:53,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:41:53,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:53,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:41:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:41:53,383 INFO L87 Difference]: Start difference. First operand 1428 states and 1578 transitions. Second operand 7 states. [2019-11-16 00:41:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:53,950 INFO L93 Difference]: Finished difference Result 2901 states and 3211 transitions. [2019-11-16 00:41:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:41:53,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2019-11-16 00:41:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:53,954 INFO L225 Difference]: With dead ends: 2901 [2019-11-16 00:41:53,954 INFO L226 Difference]: Without dead ends: 2369 [2019-11-16 00:41:53,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:41:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-11-16 00:41:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1424. [2019-11-16 00:41:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-11-16 00:41:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1568 transitions. [2019-11-16 00:41:54,158 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1568 transitions. Word has length 359 [2019-11-16 00:41:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:54,159 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 1568 transitions. [2019-11-16 00:41:54,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:41:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1568 transitions. [2019-11-16 00:41:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-16 00:41:54,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:54,163 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:54,164 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2019-11-16 00:41:54,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939820219] [2019-11-16 00:41:54,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-16 00:41:54,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939820219] [2019-11-16 00:41:54,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:54,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:41:54,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231858926] [2019-11-16 00:41:54,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:41:54,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:41:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:41:54,341 INFO L87 Difference]: Start difference. First operand 1424 states and 1568 transitions. Second operand 5 states. [2019-11-16 00:41:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:54,705 INFO L93 Difference]: Finished difference Result 2338 states and 2584 transitions. [2019-11-16 00:41:54,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:41:54,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2019-11-16 00:41:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:54,708 INFO L225 Difference]: With dead ends: 2338 [2019-11-16 00:41:54,708 INFO L226 Difference]: Without dead ends: 1804 [2019-11-16 00:41:54,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-11-16 00:41:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1392. [2019-11-16 00:41:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-11-16 00:41:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1507 transitions. [2019-11-16 00:41:54,858 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1507 transitions. Word has length 360 [2019-11-16 00:41:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:54,859 INFO L462 AbstractCegarLoop]: Abstraction has 1392 states and 1507 transitions. [2019-11-16 00:41:54,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:41:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1507 transitions. [2019-11-16 00:41:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-16 00:41:54,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:54,862 INFO L380 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:54,862 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2019-11-16 00:41:54,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:54,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029622272] [2019-11-16 00:41:54,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:54,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-11-16 00:41:55,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029622272] [2019-11-16 00:41:55,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:55,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:41:55,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177739482] [2019-11-16 00:41:55,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:55,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:55,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:55,120 INFO L87 Difference]: Start difference. First operand 1392 states and 1507 transitions. Second operand 3 states. [2019-11-16 00:41:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:55,298 INFO L93 Difference]: Finished difference Result 2295 states and 2483 transitions. [2019-11-16 00:41:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:55,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-11-16 00:41:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:55,301 INFO L225 Difference]: With dead ends: 2295 [2019-11-16 00:41:55,301 INFO L226 Difference]: Without dead ends: 1217 [2019-11-16 00:41:55,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:41:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-11-16 00:41:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1001. [2019-11-16 00:41:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-11-16 00:41:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1090 transitions. [2019-11-16 00:41:55,444 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1090 transitions. Word has length 417 [2019-11-16 00:41:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:55,445 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1090 transitions. [2019-11-16 00:41:55,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1090 transitions. [2019-11-16 00:41:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-16 00:41:55,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:55,450 INFO L380 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:55,451 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2019-11-16 00:41:55,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:55,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170195984] [2019-11-16 00:41:55,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:55,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:55,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 20 proven. 267 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-16 00:41:56,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170195984] [2019-11-16 00:41:56,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862829650] [2019-11-16 00:41:56,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:56,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:41:56,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-11-16 00:41:57,479 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:41:57,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-11-16 00:41:57,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925439634] [2019-11-16 00:41:57,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-16 00:41:57,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:41:57,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:41:57,482 INFO L87 Difference]: Start difference. First operand 1001 states and 1090 transitions. Second operand 29 states. [2019-11-16 00:41:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:58,880 INFO L93 Difference]: Finished difference Result 1215 states and 1332 transitions. [2019-11-16 00:41:58,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:41:58,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 417 [2019-11-16 00:41:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:58,882 INFO L225 Difference]: With dead ends: 1215 [2019-11-16 00:41:58,882 INFO L226 Difference]: Without dead ends: 1213 [2019-11-16 00:41:58,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 414 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:41:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-16 00:41:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1001. [2019-11-16 00:41:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-11-16 00:41:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1089 transitions. [2019-11-16 00:41:58,995 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1089 transitions. Word has length 417 [2019-11-16 00:41:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:58,996 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1089 transitions. [2019-11-16 00:41:58,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-16 00:41:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1089 transitions. [2019-11-16 00:41:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-11-16 00:41:58,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:58,999 INFO L380 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:41:59,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:59,200 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2019-11-16 00:41:59,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:59,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373373660] [2019-11-16 00:41:59,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:59,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 187 proven. 100 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-16 00:41:59,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373373660] [2019-11-16 00:41:59,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345144115] [2019-11-16 00:41:59,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:59,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:41:59,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-11-16 00:42:00,202 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:00,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-11-16 00:42:00,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319358102] [2019-11-16 00:42:00,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:42:00,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:00,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:42:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:42:00,205 INFO L87 Difference]: Start difference. First operand 1001 states and 1089 transitions. Second operand 11 states. [2019-11-16 00:42:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:01,029 INFO L93 Difference]: Finished difference Result 1430 states and 1552 transitions. [2019-11-16 00:42:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-16 00:42:01,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 464 [2019-11-16 00:42:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:01,031 INFO L225 Difference]: With dead ends: 1430 [2019-11-16 00:42:01,031 INFO L226 Difference]: Without dead ends: 1221 [2019-11-16 00:42:01,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:42:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-11-16 00:42:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1000. [2019-11-16 00:42:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-11-16 00:42:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1085 transitions. [2019-11-16 00:42:01,151 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1085 transitions. Word has length 464 [2019-11-16 00:42:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:01,152 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 1085 transitions. [2019-11-16 00:42:01,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:42:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1085 transitions. [2019-11-16 00:42:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-11-16 00:42:01,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:01,156 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:42:01,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:01,359 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2019-11-16 00:42:01,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:01,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89621862] [2019-11-16 00:42:01,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:01,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:01,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 28 proven. 657 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:42:02,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89621862] [2019-11-16 00:42:02,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356403526] [2019-11-16 00:42:02,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:02,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:42:02,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-16 00:42:03,740 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:03,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 37 [2019-11-16 00:42:03,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992448378] [2019-11-16 00:42:03,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-16 00:42:03,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-16 00:42:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:42:03,743 INFO L87 Difference]: Start difference. First operand 1000 states and 1085 transitions. Second operand 37 states. [2019-11-16 00:42:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:06,054 INFO L93 Difference]: Finished difference Result 1161 states and 1265 transitions. [2019-11-16 00:42:06,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:42:06,055 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 523 [2019-11-16 00:42:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:06,057 INFO L225 Difference]: With dead ends: 1161 [2019-11-16 00:42:06,057 INFO L226 Difference]: Without dead ends: 1159 [2019-11-16 00:42:06,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 525 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=489, Invalid=4203, Unknown=0, NotChecked=0, Total=4692 [2019-11-16 00:42:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-11-16 00:42:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1000. [2019-11-16 00:42:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-11-16 00:42:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1084 transitions. [2019-11-16 00:42:06,245 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1084 transitions. Word has length 523 [2019-11-16 00:42:06,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:06,246 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 1084 transitions. [2019-11-16 00:42:06,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-16 00:42:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1084 transitions. [2019-11-16 00:42:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-11-16 00:42:06,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:06,252 INFO L380 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:42:06,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:06,457 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:06,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2019-11-16 00:42:06,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:06,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615483503] [2019-11-16 00:42:06,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:06,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:06,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 311 proven. 276 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-11-16 00:42:07,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615483503] [2019-11-16 00:42:07,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143980220] [2019-11-16 00:42:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:07,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:42:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-11-16 00:42:07,939 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:07,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 13 [2019-11-16 00:42:07,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796390341] [2019-11-16 00:42:07,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:42:07,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:42:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:42:07,942 INFO L87 Difference]: Start difference. First operand 1000 states and 1084 transitions. Second operand 13 states. [2019-11-16 00:42:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:08,999 INFO L93 Difference]: Finished difference Result 1227 states and 1334 transitions. [2019-11-16 00:42:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:42:08,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 570 [2019-11-16 00:42:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:09,001 INFO L225 Difference]: With dead ends: 1227 [2019-11-16 00:42:09,001 INFO L226 Difference]: Without dead ends: 1162 [2019-11-16 00:42:09,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 589 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:42:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-16 00:42:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 998. [2019-11-16 00:42:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-11-16 00:42:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1080 transitions. [2019-11-16 00:42:09,165 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1080 transitions. Word has length 570 [2019-11-16 00:42:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:09,166 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 1080 transitions. [2019-11-16 00:42:09,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:42:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1080 transitions. [2019-11-16 00:42:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-11-16 00:42:09,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:09,173 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:09,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:09,374 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2019-11-16 00:42:09,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:09,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647863470] [2019-11-16 00:42:09,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:09,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:09,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:42:10,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647863470] [2019-11-16 00:42:10,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259911656] [2019-11-16 00:42:10,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:11,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-16 00:42:11,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:42:12,476 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:12,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 43 [2019-11-16 00:42:12,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6764141] [2019-11-16 00:42:12,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:42:12,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:42:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1689, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:42:12,479 INFO L87 Difference]: Start difference. First operand 998 states and 1080 transitions. Second operand 43 states. [2019-11-16 00:42:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:14,744 INFO L93 Difference]: Finished difference Result 1162 states and 1264 transitions. [2019-11-16 00:42:14,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-16 00:42:14,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 630 [2019-11-16 00:42:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:14,746 INFO L225 Difference]: With dead ends: 1162 [2019-11-16 00:42:14,746 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:42:14,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=652, Invalid=6658, Unknown=0, NotChecked=0, Total=7310 [2019-11-16 00:42:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:42:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:42:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:42:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:42:14,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 630 [2019-11-16 00:42:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:14,750 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:42:14,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:42:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:42:14,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:42:14,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:14,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:42:15,875 WARN L191 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 253 [2019-11-16 00:42:16,587 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 253 [2019-11-16 00:42:17,228 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-11-16 00:42:22,400 WARN L191 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 1414 DAG size of output: 936 [2019-11-16 00:42:22,875 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-11-16 00:42:23,272 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 350 [2019-11-16 00:42:23,833 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 294 [2019-11-16 00:42:24,039 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 190 [2019-11-16 00:42:24,565 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 253 [2019-11-16 00:42:24,945 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 326 [2019-11-16 00:42:25,090 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 220 [2019-11-16 00:42:25,391 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 232 [2019-11-16 00:42:25,592 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 250 [2019-11-16 00:42:25,697 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 177 [2019-11-16 00:42:26,991 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-11-16 00:42:28,294 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-11-16 00:42:28,740 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-11-16 00:42:28,963 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 214 [2019-11-16 00:42:29,155 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 175 [2019-11-16 00:42:29,301 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 183 [2019-11-16 00:42:29,690 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-11-16 00:42:30,133 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 292 [2019-11-16 00:42:30,241 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 151 [2019-11-16 00:42:31,273 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 454 DAG size of output: 388 [2019-11-16 00:42:31,500 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 242 [2019-11-16 00:42:31,722 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 242 [2019-11-16 00:42:31,997 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 219 [2019-11-16 00:42:33,159 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-11-16 00:42:33,465 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 245 [2019-11-16 00:42:34,778 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 696 DAG size of output: 473 [2019-11-16 00:42:35,252 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-11-16 00:42:35,632 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 256 [2019-11-16 00:42:36,038 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-11-16 00:42:36,219 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 207 [2019-11-16 00:42:36,579 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 146 [2019-11-16 00:42:36,758 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 200 [2019-11-16 00:42:37,067 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 246 [2019-11-16 00:42:41,986 WARN L191 SmtUtils]: Spent 4.92 s on a formula simplification. DAG size of input: 1430 DAG size of output: 945 [2019-11-16 00:42:43,740 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 906 DAG size of output: 557 [2019-11-16 00:42:43,855 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 200 [2019-11-16 00:42:44,946 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 696 DAG size of output: 473 [2019-11-16 00:42:45,222 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 200 [2019-11-16 00:42:45,560 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 241 [2019-11-16 00:42:45,728 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 260 [2019-11-16 00:42:45,909 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 341 DAG size of output: 275 [2019-11-16 00:42:47,093 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-11-16 00:42:47,782 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 426 [2019-11-16 00:42:48,776 WARN L191 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 433 [2019-11-16 00:42:48,943 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 251 [2019-11-16 00:42:49,138 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 247 [2019-11-16 00:42:49,244 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 186 [2019-11-16 00:42:50,197 WARN L191 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 433 [2019-11-16 00:42:51,108 WARN L191 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 513 DAG size of output: 435 [2019-11-16 00:42:51,562 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 303 [2019-11-16 00:42:51,971 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 171 [2019-11-16 00:42:53,042 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 249 DAG size of output: 105 [2019-11-16 00:42:54,026 WARN L191 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 105 [2019-11-16 00:42:54,374 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-11-16 00:42:56,328 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-11-16 00:43:05,665 WARN L191 SmtUtils]: Spent 9.33 s on a formula simplification. DAG size of input: 903 DAG size of output: 205 [2019-11-16 00:43:06,136 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-11-16 00:43:08,081 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-11-16 00:43:10,047 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 335 DAG size of output: 113 [2019-11-16 00:43:11,549 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 288 DAG size of output: 145 [2019-11-16 00:43:12,371 WARN L191 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 108 [2019-11-16 00:43:13,380 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 249 DAG size of output: 105 [2019-11-16 00:43:14,941 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 316 DAG size of output: 115 [2019-11-16 00:43:15,623 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 103 [2019-11-16 00:43:16,405 WARN L191 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 108 [2019-11-16 00:43:17,264 WARN L191 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 108 [2019-11-16 00:43:18,318 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 166 DAG size of output: 99 [2019-11-16 00:43:21,703 WARN L191 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 456 DAG size of output: 163 [2019-11-16 00:43:22,219 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 101 [2019-11-16 00:43:25,564 WARN L191 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 456 DAG size of output: 163 [2019-11-16 00:43:26,014 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-11-16 00:43:27,934 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-11-16 00:43:28,312 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-11-16 00:43:29,078 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 95 [2019-11-16 00:43:29,756 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 95 [2019-11-16 00:43:30,199 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-11-16 00:43:30,962 WARN L191 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 102 [2019-11-16 00:43:32,859 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-11-16 00:43:33,922 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 271 DAG size of output: 112 [2019-11-16 00:43:34,259 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 76 [2019-11-16 00:43:37,022 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 369 DAG size of output: 157 [2019-11-16 00:43:37,309 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-16 00:43:38,249 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 107 [2019-11-16 00:43:38,538 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-16 00:43:39,487 WARN L191 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 107 [2019-11-16 00:43:39,749 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-11-16 00:43:40,462 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 94 [2019-11-16 00:43:43,844 WARN L191 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 456 DAG size of output: 163 [2019-11-16 00:43:44,353 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-11-16 00:43:45,214 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 95 [2019-11-16 00:43:48,580 WARN L191 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 461 DAG size of output: 162 [2019-11-16 00:43:49,106 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-11-16 00:43:51,085 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-11-16 00:43:52,394 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 248 DAG size of output: 94 [2019-11-16 00:43:52,873 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-11-16 00:43:54,954 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-11-16 00:43:55,656 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 90 [2019-11-16 00:43:56,096 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-11-16 00:43:56,427 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-11-16 00:43:56,962 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 38 [2019-11-16 00:43:58,003 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 197 DAG size of output: 107 [2019-11-16 00:43:58,265 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-16 00:43:59,146 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 107 [2019-11-16 00:44:08,562 WARN L191 SmtUtils]: Spent 9.41 s on a formula simplification. DAG size of input: 913 DAG size of output: 205 [2019-11-16 00:44:08,833 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-16 00:44:12,507 WARN L191 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 539 DAG size of output: 165 [2019-11-16 00:44:13,605 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 197 DAG size of output: 107 [2019-11-16 00:44:16,988 WARN L191 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 461 DAG size of output: 162 [2019-11-16 00:44:17,513 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-11-16 00:44:17,722 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2019-11-16 00:44:18,388 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 102 [2019-11-16 00:44:19,490 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 197 DAG size of output: 107 [2019-11-16 00:44:19,990 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-11-16 00:44:20,408 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-11-16 00:44:21,739 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 233 DAG size of output: 112 [2019-11-16 00:44:22,561 WARN L191 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 112 [2019-11-16 00:44:23,489 WARN L191 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 111 [2019-11-16 00:44:23,826 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-11-16 00:44:24,090 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-16 00:44:24,361 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-16 00:44:27,724 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 456 DAG size of output: 163 [2019-11-16 00:44:31,201 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 422 DAG size of output: 156 [2019-11-16 00:44:31,700 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-11-16 00:44:32,199 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-11-16 00:44:34,577 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 425 DAG size of output: 160 [2019-11-16 00:44:35,423 WARN L191 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 97 [2019-11-16 00:44:36,177 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 98 [2019-11-16 00:44:37,052 WARN L191 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 99 [2019-11-16 00:44:39,485 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 425 DAG size of output: 160 [2019-11-16 00:44:42,190 WARN L191 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 422 DAG size of output: 149 [2019-11-16 00:44:42,384 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2019-11-16 00:44:44,100 WARN L191 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 301 DAG size of output: 118 [2019-11-16 00:44:44,446 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-11-16 00:44:44,787 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-11-16 00:44:45,200 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-11-16 00:44:45,720 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 94 [2019-11-16 00:44:45,722 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,722 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 617) no Hoare annotation was computed. [2019-11-16 00:44:45,722 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 130) no Hoare annotation was computed. [2019-11-16 00:44:45,722 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 835) no Hoare annotation was computed. [2019-11-16 00:44:45,723 INFO L439 ceAbstractionStarter]: At program point L829-1(lines 829 835) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= ~c_m_lock~0 0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~s_run_st~0)) (.cse14 (= ~s_run_pc~0 2))) (let ((.cse6 (= 0 ~c_req_type~0)) (.cse1 (= 6 ~m_run_pc~0)) (.cse0 (and .cse12 (and (= ~c_empty_req~0 1) .cse15 .cse16 .cse17) .cse13 .cse14)) (.cse4 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse9 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse2 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse3 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse7 .cse8 (and (= 0 ~c_req_a~0) .cse0 .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse6 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse1 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse11 (= ~a_t~0 1)) (and (and (= 3 ~m_run_pc~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse2 .cse3) (and .cse13 (<= 2 ~s_run_pc~0) .cse15 .cse16 (not .cse14) (<= 3 ~m_run_pc~0) .cse17)))) [2019-11-16 00:44:45,723 INFO L439 ceAbstractionStarter]: At program point L763(lines 756 809) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse5 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and .cse1 .cse2 .cse3 (and .cse5 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,723 INFO L439 ceAbstractionStarter]: At program point L697(lines 690 725) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 6 ~m_run_pc~0)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) .cse6 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse8 (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse6 .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 (= ~req_tt_a~0 2) (and (and .cse6 .cse5 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,723 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 569) no Hoare annotation was computed. [2019-11-16 00:44:45,724 INFO L439 ceAbstractionStarter]: At program point L1094(lines 1087 1104) the Hoare annotation is: (let ((.cse27 (<= 2 ~c_write_req_ev~0)) (.cse28 (<= 1 ~c_m_lock~0)) (.cse25 (= ~c_empty_req~0 1)) (.cse26 (= ~m_run_st~0 0))) (let ((.cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse3 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory2~0 52)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (and .cse27 .cse28 (and .cse25 .cse26 (<= 3 ~m_run_pc~0)) (= ~s_run_pc~0 2))) (.cse10 (= 6 ~m_run_pc~0)) (.cse13 (= 0 ~c_req_type~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse5 (= ~s_memory0~0 50)) (.cse19 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse1 (= ~s_memory1~0 51)) (.cse8 (= 1 ~c_write_rsp_ev~0)) (.cse17 (and (let ((.cse24 (and (= 3 ~m_run_pc~0) .cse25 .cse26))) (or (and (= 0 ~s_run_pc~0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse27 .cse28)) (.cse21 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= 2 ~a_t~0)) (.cse23 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse2 .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (= 51 ~c_rsp_d~0) (and (<= 1 ~c_req_a~0) .cse5 .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (and .cse9 (and .cse10 (and .cse11 .cse12)) .cse13) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~a_t~0 1)) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse1 .cse8 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (and (and (= 0 ~c_req_a~0) (and .cse14 .cse12) .cse10 .cse15) .cse9 .cse13) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse16) (and (and .cse17 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse18 .cse7 .cse8 (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse11 (<= 1 ~a_t~0) .cse19 .cse3) (and (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (and (<= 0 ~a_t~0) (and (and .cse14 .cse17) (<= ~a_t~0 0))) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse18 .cse8 .cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse16) (and .cse0 (= ~req_tt_a~0 2) .cse4 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse2 (and (<= 2 ~c_req_a~0) .cse20 (and .cse5 .cse8 (and .cse9 (and .cse12 .cse10 .cse21 .cse22) .cse13)) .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse23 (<= ~c_req_a~0 2))) (and (and .cse20 .cse5 .cse19 .cse1 .cse8 .cse17 .cse21 .cse22 .cse23) (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= 52 ~c_req_d~0) .cse18 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52))))) [2019-11-16 00:44:45,725 INFO L439 ceAbstractionStarter]: At program point L1161(lines 1113 1166) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse22 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse19 (<= ~a_t~0 1)) (.cse17 (<= 1 ~a_t~0)) (.cse35 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse33 (and .cse21 .cse27 .cse24 .cse23 .cse50)) (.cse43 (<= 2 ~c_req_a~0)) (.cse41 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse44 (<= ~c_req_a~0 2)) (.cse3 (<= ~m_run_pc~0 0)) (.cse30 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse40 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse15 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 2 ~a_t~0)) (.cse45 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse46 (= ~s_memory2~0 52)) (.cse32 (<= 1 ~c_req_a~0)) (.cse38 (= ~s_memory0~0 50)) (.cse47 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= 0 ~c_req_type~0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse37 (and .cse21 .cse22 .cse24 .cse23)) (.cse9 (= 6 ~m_run_pc~0)) (.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= ~c_req_a~0 1)) (.cse39 (= ~s_memory1~0 51)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 (let ((.cse12 (and (and .cse21 .cse4 .cse22 .cse23) .cse24))) (or (and (and .cse10 (and .cse11 .cse12)) .cse13 .cse14) (and .cse15 .cse12 .cse16) (and .cse17 .cse18 (and .cse19 .cse20 .cse12))))) (and .cse13 .cse10 (and .cse25 .cse26 (and .cse11 (and .cse21 .cse27 .cse28 .cse5 .cse24))) .cse14) (and .cse13 .cse3 .cse29 .cse10 .cse5 .cse8 .cse30 .cse2 .cse21 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse31 (<= 51 ~c_req_d~0) (and .cse32 .cse33 .cse34) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse19 .cse20 .cse17 .cse35 .cse36 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse29 (and .cse30 .cse37 .cse9)) .cse38 .cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse35 (= ~a_t~0 0) .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse40 (and .cse7 (not .cse23) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse35 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse41 .cse42 .cse15 .cse16 (and .cse43 .cse33 .cse44)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse45 (= ~req_tt_a~0 2) .cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse43 (and (and .cse37 .cse9 .cse15 .cse16) .cse47 .cse29) .cse38 .cse39 .cse41 .cse42 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse48) (and .cse13 .cse3 .cse29 .cse10 .cse8 .cse30 .cse2 .cse21 .cse4 .cse23 .cse6 .cse7) (and .cse4 .cse28 .cse5) (and .cse40 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse25 .cse26 (and .cse13 (and (and .cse11 (and .cse21 .cse27 .cse28 .cse24 .cse23)) .cse10))) .cse14) (and (and .cse49 .cse7 .cse8) .cse21 .cse4 .cse23) (and .cse9 (and (and .cse2 .cse21 .cse4 .cse23 .cse7 .cse8) .cse15 .cse16)) (and .cse45 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse46 (and .cse32 .cse38 (and .cse47 .cse29 (and (and .cse20 .cse37) .cse9 .cse36)) .cse34) .cse39 (= ~req_tt_a~0 1) .cse48 .cse18 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,725 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2019-11-16 00:44:45,725 INFO L443 ceAbstractionStarter]: For program point L765(lines 765 769) no Hoare annotation was computed. [2019-11-16 00:44:45,725 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 703) no Hoare annotation was computed. [2019-11-16 00:44:45,725 INFO L439 ceAbstractionStarter]: At program point L1294(lines 1287 1313) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse22 (and .cse7 .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse15 (<= ~a_t~0 1)) (.cse17 (<= 1 ~a_t~0)) (.cse35 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse33 (and .cse21 .cse27 .cse24 .cse23 .cse50)) (.cse43 (<= 2 ~c_req_a~0)) (.cse41 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse44 (<= ~c_req_a~0 2)) (.cse3 (<= ~m_run_pc~0 0)) (.cse30 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse40 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse19 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= 2 ~a_t~0)) (.cse45 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse46 (= ~s_memory2~0 52)) (.cse32 (<= 1 ~c_req_a~0)) (.cse38 (= ~s_memory0~0 50)) (.cse47 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= 0 ~c_req_type~0)) (.cse16 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse37 (and .cse21 .cse22 .cse24 .cse23)) (.cse9 (= 6 ~m_run_pc~0)) (.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= ~c_req_a~0 1)) (.cse39 (= ~s_memory1~0 51)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 (let ((.cse12 (and (and .cse21 .cse4 .cse22 .cse23) .cse24))) (or (and (and .cse10 (and .cse11 .cse12)) .cse13 .cse14) (and (and .cse12 .cse15 .cse16) .cse17 .cse18) (and .cse12 .cse19 .cse20)))) (and .cse13 .cse10 (and .cse25 .cse26 (and .cse11 (and .cse21 .cse27 .cse28 .cse5 .cse24))) .cse14) (and .cse13 .cse3 .cse29 .cse10 .cse5 .cse8 .cse30 .cse2 .cse21 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse31 (<= 51 ~c_req_d~0) (and .cse32 .cse33 .cse34) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse15 .cse16 .cse17 .cse35 .cse36 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse29 (and .cse30 .cse37 .cse9)) .cse38 .cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse35 (= ~a_t~0 0) .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse40 (and .cse7 (not .cse23) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse35 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse41 .cse42 .cse19 .cse20 (and .cse43 .cse33 .cse44)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse45 (= ~req_tt_a~0 2) .cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse43 (and (and .cse37 .cse9 .cse19 .cse20) .cse47 .cse29) .cse38 .cse39 .cse41 .cse42 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse48) (and .cse13 .cse3 .cse29 .cse10 .cse8 .cse30 .cse2 .cse21 .cse4 .cse23 .cse6 .cse7) (and .cse4 .cse28 .cse5) (and .cse40 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse25 .cse26 (and .cse13 (and (and .cse11 (and .cse21 .cse27 .cse28 .cse24 .cse23)) .cse10))) .cse14) (and (and .cse49 .cse7 .cse8) .cse21 .cse4 .cse23) (and .cse9 (and (and .cse2 .cse21 .cse4 .cse23 .cse7 .cse8) .cse19 .cse20)) (and .cse45 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse46 (and .cse32 .cse38 (and .cse47 .cse29 (and (and .cse16 .cse37) .cse9 .cse36)) .cse34) .cse39 (= ~req_tt_a~0 1) .cse48 .cse18 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,726 INFO L439 ceAbstractionStarter]: At program point L237(lines 230 265) the Hoare annotation is: (let ((.cse21 (= ~c_empty_rsp~0 1)) (.cse22 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse26 (<= 1 ~c_req_type~0)) (.cse28 (and (= 3 ~m_run_pc~0) .cse21 .cse22)) (.cse27 (and (<= ~m_run_pc~0 0) .cse22 .cse21))) (let ((.cse11 (<= ~c_req_a~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse13 (and .cse26 (or .cse28 .cse27))) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse23 (and .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (<= ~a_t~0 0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (and .cse11 .cse12 .cse14 .cse15 (and .cse26 .cse10 (or .cse27 .cse28)) .cse18 .cse16)) (.cse20 (= 0 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse6 .cse4 .cse20 .cse7 .cse8 .cse17) (and (and (not .cse9) .cse21 .cse22) .cse5 (<= 2 ~s_run_pc~0)) (and (and (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse23 (<= ~c_req_a~0 2)) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse24 (<= 52 ~c_req_d~0) .cse25 (<= ~c_req_d~0 52)) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse23 (<= ~c_req_a~0 1)) .cse3 .cse4 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse24 (<= ~c_req_d~0 51) .cse25 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse19 .cse5 .cse20)))))) [2019-11-16 00:44:45,726 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 129) no Hoare annotation was computed. [2019-11-16 00:44:45,726 INFO L443 ceAbstractionStarter]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2019-11-16 00:44:45,726 INFO L439 ceAbstractionStarter]: At program point L106(lines 101 843) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (= ~c_empty_rsp~0 1)) [2019-11-16 00:44:45,726 INFO L439 ceAbstractionStarter]: At program point L437(lines 430 456) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse1 (and (<= 2 ~c_write_req_ev~0) .cse4 .cse7 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse6 .cse8))) (.cse0 (= ~s_memory0~0 50)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 (and .cse5 .cse6 (not .cse7) .cse8) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (<= 0 ~a_t~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1)) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse1 (<= ~a_t~0 1)) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse2 (<= ~c_req_d~0 51) .cse3)))) [2019-11-16 00:44:45,727 INFO L443 ceAbstractionStarter]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2019-11-16 00:44:45,727 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 243) no Hoare annotation was computed. [2019-11-16 00:44:45,727 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,727 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 970) no Hoare annotation was computed. [2019-11-16 00:44:45,728 INFO L439 ceAbstractionStarter]: At program point L174(lines 144 175) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse2 (= ~s_run_pc~0 2)) (.cse11 (= ~c_empty_req~0 1)) (.cse16 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse7 (and .cse12 .cse0 .cse15 .cse2 (and (= 3 ~m_run_pc~0) .cse11 .cse16 .cse3 .cse4))) (.cse8 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse9 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse5 (<= 0 ~a_t~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (<= ~m_run_pc~0 0)) (.cse20 (= 0 ~c_req_type~0)) (.cse6 (<= ~a_t~0 0)) (.cse22 (= 0 ~s_run_pc~0)) (.cse18 (= 0 ~c_req_a~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse5 .cse6 (and (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse7) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_m_run_~a~0 1) .cse8 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse3 .cse17) .cse18 .cse19 .cse5 .cse20 .cse6 .cse21) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse13 .cse14 .cse0 .cse22 .cse16 .cse4 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17) (and (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= ~a_t~0 1) .cse7 (<= 1 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a~0 2)) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9) (and .cse10 .cse5 .cse13 .cse14 .cse20 .cse6 .cse22 .cse3 .cse18 .cse19 .cse11 .cse12 .cse15 .cse16 .cse21 .cse4 .cse17)))) [2019-11-16 00:44:45,728 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 128) no Hoare annotation was computed. [2019-11-16 00:44:45,728 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2019-11-16 00:44:45,728 INFO L439 ceAbstractionStarter]: At program point L571(lines 564 617) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_st~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~s_run_pc~0 2))) (let ((.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~s_memory2~0 52)) (.cse16 (= 6 ~m_run_pc~0)) (.cse15 (and .cse1 .cse17 (and .cse4 .cse5) .cse18)) (.cse9 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse12 (= ~s_memory1~0 51)) (.cse0 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse3 (not .cse18)) (.cse2 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse13 (<= ~c_req_a~0 1) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) (and (and .cse15 (<= 1 ULTIMATE.start_m_run_~a~0)) .cse16 (= 0 ULTIMATE.start_s_run_~req_a~1))) (and .cse9 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) .cse7 .cse8 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) (and .cse16 (and .cse15 (<= 2 ULTIMATE.start_m_run_~a~0))) (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (and .cse0 (and .cse1 .cse17 .cse18 (and (= 3 ~m_run_pc~0) .cse4 .cse5))) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse6) (and (and .cse3 .cse4 .cse5 (<= 3 ~m_run_pc~0)) .cse1 .cse2)))) [2019-11-16 00:44:45,729 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-16 00:44:45,729 INFO L439 ceAbstractionStarter]: At program point L109(lines 101 843) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (= ~c_empty_rsp~0 1)) [2019-11-16 00:44:45,729 INFO L443 ceAbstractionStarter]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2019-11-16 00:44:45,730 INFO L439 ceAbstractionStarter]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse3 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse48 (and .cse3 .cse2)) (.cse45 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2))) (let ((.cse1 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse46 (<= 2 ~c_req_a~0)) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse15 (<= 1 ~a_t~0)) (.cse38 (and .cse0 .cse48 .cse45 .cse5)) (.cse7 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse6 (= 6 ~m_run_pc~0)) (.cse26 (= ~s_memory0~0 50)) (.cse27 (= ~s_memory1~0 51)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse31 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse35 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse47 (<= ~c_req_a~0 2))) (let ((.cse13 (and .cse46 (and (and .cse24 .cse25 (and (and .cse15 .cse38 .cse7) .cse6)) .cse26 .cse27 .cse28 .cse29 .cse31 .cse35) .cse47)) (.cse17 (= ~a_t~0 1)) (.cse16 (and (and .cse0 .cse4 .cse48 .cse5) .cse45)) (.cse30 (= ~req_tt_a~0 1)) (.cse23 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse33 (<= 1 ~c_req_a~0)) (.cse21 (<= ~a_t~0 1)) (.cse19 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse32 (<= ~c_req_a~0 1)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse37 (= 0 ~c_req_a~0)) (.cse18 (<= 0 ~a_t~0)) (.cse41 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~a_t~0 0)) (.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ~req_tt_a~0 2)) (.cse34 (and .cse1 .cse0 .cse4 .cse45 .cse5 .cse2)) (.cse8 (<= 2 ~a_t~0)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse36 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse40 (<= 2 ULTIMATE.start_s_run_~req_a~1))) (or (and (and .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse2 (not .cse5) .cse3) .cse4 (<= 2 ~s_run_pc~0)) (and .cse15 .cse16 .cse7) (and .cse9 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 2) .cse17) (and (or (and .cse18 .cse19 .cse20 .cse16) (and .cse21 .cse15 .cse16)) .cse22) (and .cse23 .cse9 .cse24 .cse25 .cse26 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse27 .cse28 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse29 .cse30 .cse31 .cse14 .cse32 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse33 .cse11 (and (and .cse34 .cse19) .cse6 .cse22) (= 51 ~c_rsp_d~0) .cse35 .cse17) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and .cse36 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (and (= ULTIMATE.start_m_run_~a~0 0) (and (and .cse25 (and .cse37 (and .cse18 .cse38))) .cse26 .cse39) .cse27) .cse40) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and .cse41 .cse16) .cse18 .cse42) (and .cse9 .cse11 (and (let ((.cse43 (and .cse33 (and (and .cse24 .cse25 (and .cse6 .cse44 (or (and .cse18 .cse38 .cse19 .cse20) (and .cse21 .cse38 .cse19 .cse15)))) .cse26) .cse32))) (or (and .cse23 .cse27 .cse43 .cse30) (and .cse23 .cse27 (= ~a_t~0 0) .cse43))) .cse22) .cse14) (and .cse9 .cse24 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse25 .cse26 .cse27 .cse14 .cse39 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (and .cse37 .cse18 .cse6 (and (and .cse41 .cse1 .cse0 .cse4 .cse45 .cse5 .cse2) .cse20) .cse44) .cse42) (and .cse9 .cse10 (and (and .cse6 .cse34 .cse7 .cse8) .cse24 .cse25 .cse26) (= 52 ~c_rsp_d~0) .cse27 (<= ULTIMATE.start_s_memory_read_~i 2) .cse14 .cse11 .cse46 .cse12 .cse36 (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse40 .cse47)))))) [2019-11-16 00:44:45,730 INFO L439 ceAbstractionStarter]: At program point L771(lines 764 808) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse5 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and .cse1 .cse2 .cse3 (and .cse5 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,730 INFO L439 ceAbstractionStarter]: At program point L705(lines 698 724) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 6 ~m_run_pc~0)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) .cse6 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse8 (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse6 .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 (= ~req_tt_a~0 2) (and (and .cse6 .cse5 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,731 INFO L443 ceAbstractionStarter]: For program point L639(lines 638 666) no Hoare annotation was computed. [2019-11-16 00:44:45,731 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-16 00:44:45,731 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 127) no Hoare annotation was computed. [2019-11-16 00:44:45,731 INFO L439 ceAbstractionStarter]: At program point L904(lines 878 905) the Hoare annotation is: (let ((.cse18 (<= ~c_req_type~0 1)) (.cse20 (= 3 ~m_run_pc~0)) (.cse23 (<= 1 ~c_req_type~0)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse26 (= ~s_run_pc~0 2))) (let ((.cse0 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse1 (<= 1 ~c_req_a~0)) (.cse3 (<= ~c_req_a~0 1)) (.cse5 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~s_memory2~0 52)) (.cse11 (= 6 ~m_run_pc~0)) (.cse10 (and .cse17 (and .cse24 .cse25) .cse19 .cse26)) (.cse9 (= 0 ~c_req_type~0)) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse2 (and .cse17 .cse18 .cse19 .cse26 (and .cse20 .cse23 .cse24 .cse25))) (.cse8 (<= 2 ~c_req_a~0)) (.cse15 (<= ~c_req_a~0 2)) (.cse12 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse13 (<= 2 ~a_t~0)) (.cse4 (= ~s_memory0~0 50)) (.cse14 (= ~s_memory1~0 51))) (or (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (and (<= 1 ~a_t~0) (and (<= ~a_t~0 1) .cse0 (and .cse1 .cse2 .cse3))) .cse4 (<= ~c_req_d~0 51) (<= 51 ~c_req_d~0)) .cse5) (and .cse6 (= ~req_tt_a~0 2) .cse7 (and .cse8 .cse4 (and .cse9 (and .cse10 .cse11 .cse12 .cse13)) .cse14 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and .cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse0 (and .cse1 .cse4 (and (and .cse10 .cse11) .cse9) .cse3) .cse14 (= ~req_tt_a~0 1) .cse16 .cse5 (= ~a_t~0 1)) (and .cse6 .cse7 (= ~req_tt_a~0 0) .cse4 .cse14 (= ~a_t~0 0) (and (and (= 0 ~c_req_a~0) .cse11 (and (<= ULTIMATE.start_m_run_~a~0 0) .cse10)) .cse9) .cse16 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and (and .cse17 .cse18 .cse19 (let ((.cse21 (<= ~c_req_a~0 0)) (.cse22 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse25) (and .cse20 .cse21 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse25)))) (= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0))) (and (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse2 .cse8 .cse15) .cse12 .cse13) .cse4 .cse14 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52))))) [2019-11-16 00:44:45,731 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 644) no Hoare annotation was computed. [2019-11-16 00:44:45,731 INFO L439 ceAbstractionStarter]: At program point L112(lines 101 843) the Hoare annotation is: (let ((.cse11 (<= ~c_req_a~0 0)) (.cse12 (<= 0 ~c_req_a~0)) (.cse39 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= 3 ~m_run_pc~0)) (.cse13 (<= 1 ~c_req_type~0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= ~c_req_type~0 1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (let ((.cse26 (and .cse1 .cse13 .cse14 .cse15 .cse16 .cse3 .cse2 .cse4)) (.cse31 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse35 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 52 ~c_req_d~0)) (.cse28 (<= ~c_req_d~0 52)) (.cse29 (<= 2 ~a_t~0)) (.cse33 (<= ~a_t~0 1)) (.cse38 (and (and .cse1 .cse39 .cse2) .cse14 .cse0 .cse16 .cse3)) (.cse18 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse34 (<= 1 ~a_t~0)) (.cse19 (= ~s_memory0~0 50)) (.cse22 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse30 (<= ~c_req_d~0 51)) (.cse23 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse32 (<= 51 ~c_req_d~0)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= 0 ~a_t~0)) (.cse6 (and .cse11 .cse12 (and .cse1 .cse13 .cse2 .cse4))) (.cse17 (<= ~a_t~0 0)) (.cse7 (= 0 ~s_run_pc~0)) (.cse5 (<= 2 ~s_run_pc~0))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) .cse5) (and .cse6 .cse0 .cse7) (and .cse8 .cse9 (and .cse10 (and .cse1 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse2 .cse4) .cse17)) (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and (<= 2 ~c_req_a~0) .cse26 (<= ~c_req_a~0 2)) .cse27 .cse28 .cse29) (and .cse1 .cse14 .cse0 .cse5 .cse2 .cse4) (and .cse20 .cse30 .cse31 .cse24 .cse32 (and .cse33 .cse34 (and (<= 1 ~c_req_a~0) .cse26 (<= ~c_req_a~0 1))) .cse35 .cse36 .cse37) (and .cse8 .cse9 .cse10 .cse38 .cse17 .cse20 .cse31 .cse24 .cse35 .cse36 .cse37) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse19 (= ~s_memory1~0 51) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse20 .cse21 .cse24 .cse28 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (and .cse33 .cse38) .cse18 .cse34 .cse19 .cse22 .cse20 .cse30 .cse23 .cse25 .cse24 .cse27 .cse32) (and .cse8 .cse9 .cse14 .cse10 .cse6 .cse15 .cse17 .cse7 .cse16) (and (and .cse1 .cse39 .cse2 .cse4) .cse5)))) [2019-11-16 00:44:45,732 INFO L439 ceAbstractionStarter]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse10 (<= 2 ~c_write_req_ev~0)) (.cse21 (<= 2 ~s_run_st~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse24 (= ~s_run_pc~0 2)) (.cse13 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse6 (= 0 ~s_run_pc~0)) (.cse17 (and .cse10 .cse21 .cse11 .cse12 .cse24 .cse13 (and (= 3 ~m_run_pc~0) .cse9 .cse7 .cse15))) (.cse18 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse19 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse8 (= 0 ~c_req_a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse4 (= 0 ~c_req_type~0)) (.cse5 (<= ~a_t~0 0)) (.cse14 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse5 (and (<= ULTIMATE.start_m_run_~req_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse17) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse18 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse19 (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse20 .cse9 .cse2 .cse3 .cse21 .cse6 .cse13 .cse15 .cse7 .cse22 .cse16) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse17) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse18 (<= ~c_req_d~0 51) .cse19) (and .cse0 .cse8 .cse1 .cse4 .cse5 .cse14 (and .cse20 .cse2 .cse3 .cse23 .cse7 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse15 .cse16) .cse22) (and .cse21 (and (not .cse24) .cse7 .cse15) .cse23)))) [2019-11-16 00:44:45,732 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2019-11-16 00:44:45,732 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 711) no Hoare annotation was computed. [2019-11-16 00:44:45,733 INFO L439 ceAbstractionStarter]: At program point L1302(lines 1295 1312) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse22 (and .cse7 .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse15 (<= ~a_t~0 1)) (.cse17 (<= 1 ~a_t~0)) (.cse35 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse33 (and .cse21 .cse27 .cse24 .cse23 .cse50)) (.cse43 (<= 2 ~c_req_a~0)) (.cse41 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse44 (<= ~c_req_a~0 2)) (.cse3 (<= ~m_run_pc~0 0)) (.cse30 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse40 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse19 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= 2 ~a_t~0)) (.cse45 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse46 (= ~s_memory2~0 52)) (.cse32 (<= 1 ~c_req_a~0)) (.cse38 (= ~s_memory0~0 50)) (.cse47 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= 0 ~c_req_type~0)) (.cse16 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse37 (and .cse21 .cse22 .cse24 .cse23)) (.cse9 (= 6 ~m_run_pc~0)) (.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= ~c_req_a~0 1)) (.cse39 (= ~s_memory1~0 51)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 (let ((.cse12 (and (and .cse21 .cse4 .cse22 .cse23) .cse24))) (or (and (and .cse10 (and .cse11 .cse12)) .cse13 .cse14) (and (and .cse12 .cse15 .cse16) .cse17 .cse18) (and .cse12 .cse19 .cse20)))) (and .cse13 .cse10 (and .cse25 .cse26 (and .cse11 (and .cse21 .cse27 .cse28 .cse5 .cse24))) .cse14) (and .cse13 .cse3 .cse29 .cse10 .cse5 .cse8 .cse30 .cse2 .cse21 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse31 (<= 51 ~c_req_d~0) (and .cse32 .cse33 .cse34) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse15 .cse16 .cse17 .cse35 .cse36 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse29 (and .cse30 .cse37 .cse9)) .cse38 .cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse35 (= ~a_t~0 0) .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse40 (and .cse7 (not .cse23) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse35 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse41 .cse42 .cse19 .cse20 (and .cse43 .cse33 .cse44)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse45 (= ~req_tt_a~0 2) .cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse43 (and (and .cse37 .cse9 .cse19 .cse20) .cse47 .cse29) .cse38 .cse39 .cse41 .cse42 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse48) (and .cse13 .cse3 .cse29 .cse10 .cse8 .cse30 .cse2 .cse21 .cse4 .cse23 .cse6 .cse7) (and .cse4 .cse28 .cse5) (and .cse40 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse25 .cse26 (and .cse13 (and (and .cse11 (and .cse21 .cse27 .cse28 .cse24 .cse23)) .cse10))) .cse14) (and (and .cse49 .cse7 .cse8) .cse21 .cse4 .cse23) (and .cse9 (and (and .cse2 .cse21 .cse4 .cse23 .cse7 .cse8) .cse19 .cse20)) (and .cse45 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse46 (and .cse32 .cse38 (and .cse47 .cse29 (and (and .cse16 .cse37) .cse9 .cse36)) .cse34) .cse39 (= ~req_tt_a~0 1) .cse48 .cse18 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,733 INFO L439 ceAbstractionStarter]: At program point L245(lines 238 264) the Hoare annotation is: (let ((.cse21 (= ~c_empty_rsp~0 1)) (.cse22 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse26 (<= 1 ~c_req_type~0)) (.cse28 (and (= 3 ~m_run_pc~0) .cse21 .cse22)) (.cse27 (and (<= ~m_run_pc~0 0) .cse22 .cse21))) (let ((.cse11 (<= ~c_req_a~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse13 (and .cse26 (or .cse28 .cse27))) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse23 (and .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (<= ~a_t~0 0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (and .cse11 .cse12 .cse14 .cse15 (and .cse26 .cse10 (or .cse27 .cse28)) .cse18 .cse16)) (.cse20 (= 0 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse6 .cse4 .cse20 .cse7 .cse8 .cse17) (and (and (not .cse9) .cse21 .cse22) .cse5 (<= 2 ~s_run_pc~0)) (and (and (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse23 (<= ~c_req_a~0 2)) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse24 (<= 52 ~c_req_d~0) .cse25 (<= ~c_req_d~0 52)) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse23 (<= ~c_req_a~0 1)) .cse3 .cse4 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse24 (<= ~c_req_d~0 51) .cse25 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse19 .cse5 .cse20)))))) [2019-11-16 00:44:45,733 INFO L443 ceAbstractionStarter]: For program point L179(lines 178 206) no Hoare annotation was computed. [2019-11-16 00:44:45,734 INFO L439 ceAbstractionStarter]: At program point L972(lines 965 982) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (<= ~c_req_type~0 1)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse32 (= ~s_run_pc~0 2)) (.cse13 (= 3 ~m_run_pc~0)) (.cse17 (<= 1 ~c_req_type~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse22 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse27 (and .cse11 .cse18 .cse12 .cse21 .cse32 (and .cse13 .cse17 .cse16 .cse19 .cse20) .cse22)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= 1 ~c_req_a~0)) (.cse6 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 6 ~m_run_pc~0)) (.cse4 (and (and .cse16 .cse19 (<= 3 ~m_run_pc~0) .cse20) .cse11 .cse21 .cse32)) (.cse2 (= 0 ~c_req_type~0)) (.cse29 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~s_memory2~0 52)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 (and (= 0 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and .cse11 .cse12 (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~s_run_pc~0) .cse5 .cse19 .cse20) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~s_run_pc~0) .cse5 .cse19 .cse20))) .cse21 .cse22)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse0 (= ~req_tt_a~0 2) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse23 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and .cse1 .cse2 (and .cse4 .cse3 .cse24 .cse25)) .cse26 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse8) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse23 .cse27 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse26) .cse24 .cse25) .cse6 .cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (and .cse28 .cse27 (= 1 ULTIMATE.start_s_run_~req_a~1) .cse29) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse30 (<= 1 ~a_t~0) .cse31) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse28 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse1 (and .cse3 .cse4) .cse2) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29) .cse7 (= ~req_tt_a~0 1) .cse8 .cse31 .cse9 .cse30 (= ~a_t~0 1))))) [2019-11-16 00:44:45,734 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2019-11-16 00:44:45,734 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2019-11-16 00:44:45,734 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 184) no Hoare annotation was computed. [2019-11-16 00:44:45,735 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 126) no Hoare annotation was computed. [2019-11-16 00:44:45,735 INFO L443 ceAbstractionStarter]: For program point L973(lines 965 982) no Hoare annotation was computed. [2019-11-16 00:44:45,735 INFO L439 ceAbstractionStarter]: At program point L445(lines 438 455) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse1 (and (<= 2 ~c_write_req_ev~0) .cse4 .cse7 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse6 .cse8))) (.cse0 (= ~s_memory0~0 50)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 (and .cse5 .cse6 (not .cse7) .cse8) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (<= 0 ~a_t~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1)) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse1 (<= ~a_t~0 1)) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse2 (<= ~c_req_d~0 51) .cse3)))) [2019-11-16 00:44:45,735 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-11-16 00:44:45,735 INFO L443 ceAbstractionStarter]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2019-11-16 00:44:45,735 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2019-11-16 00:44:45,736 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2019-11-16 00:44:45,736 INFO L439 ceAbstractionStarter]: At program point L115(lines 101 843) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2019-11-16 00:44:45,736 INFO L443 ceAbstractionStarter]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2019-11-16 00:44:45,737 INFO L439 ceAbstractionStarter]: At program point L1040(lines 1033 1086) the Hoare annotation is: (let ((.cse29 (= 3 ~m_run_pc~0)) (.cse27 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2)) (.cse30 (= ~c_empty_req~0 1))) (let ((.cse1 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse9 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse4 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= 2 ~a_t~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse19 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse10 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~s_memory2~0 52)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse15 (= 0 ~c_req_type~0)) (.cse17 (and .cse27 .cse32 .cse31 (and .cse30 (<= 3 ~m_run_pc~0)))) (.cse16 (= 6 ~m_run_pc~0)) (.cse21 (<= ~c_req_d~0 50)) (.cse22 (<= 50 ~c_req_d~0)) (.cse2 (= 1 ~c_write_rsp_ev~0)) (.cse25 (<= 0 ~a_t~0)) (.cse24 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (and .cse27 (and .cse29 .cse30) .cse32 .cse31)) (.cse26 (<= ~a_t~0 0)) (.cse7 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse23 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse35 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse33 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse34 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse36 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= 52 ~c_req_d~0) .cse0 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (and .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9)) (and .cse10 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse11 .cse12 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (and (<= 1 ~c_req_a~0) (and (and .cse14 .cse15 (and .cse16 (and .cse17 .cse18))) .cse2) .cse6 .cse19 .cse20 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= ~a_t~0 1)) (and .cse10 (= ~req_tt_a~0 2) .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) .cse1 .cse8 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse9 (and (and .cse2 (and .cse14 .cse15 (and .cse16 .cse17 .cse4 .cse5))) .cse6) (<= ~c_req_a~0 2)) .cse11) (and (and .cse2 .cse12 (and (<= ~a_t~0 1) .cse18 (<= 1 ~a_t~0) .cse3)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse19 .cse0 .cse20 (<= 51 ~c_req_d~0)) (and (and .cse21 .cse22 .cse7 .cse23 .cse0 (and (and .cse24 .cse25 .cse26 (and (<= 1 ~c_req_type~0) .cse27 (let ((.cse28 (and .cse29 .cse30 (not .cse31)))) (or (and (= 0 ~s_run_pc~0) .cse28) (and (<= 2 ~s_run_pc~0) .cse28))) (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse32 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse2) .cse33 .cse34) .cse35 .cse36) (and .cse10 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse8 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse14 .cse15 (and (= 0 ~c_req_a~0) (and .cse24 .cse17) .cse16 .cse35)) .cse2) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse36) (and (and .cse21 .cse22 (and .cse2 (and .cse25 (and (and .cse24 .cse3) .cse26))) .cse7 .cse23 .cse0 .cse35 .cse33 .cse34) .cse36)))) [2019-11-16 00:44:45,737 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 978) no Hoare annotation was computed. [2019-11-16 00:44:45,737 INFO L443 ceAbstractionStarter]: For program point L446(lines 134 480) no Hoare annotation was computed. [2019-11-16 00:44:45,737 INFO L439 ceAbstractionStarter]: At program point L579(lines 572 616) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (let ((.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (and .cse0 (and .cse2 .cse3) .cse14 .cse1)) (.cse5 (= 6 ~m_run_pc~0)) (.cse12 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~s_memory2~0 52)) (.cse4 (= 0 ~c_req_type~0)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and .cse4 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and .cse5 .cse6) (<= 2 ~c_req_a~0) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse12 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse9 .cse10 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse6) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse11 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse12 (<= ~c_req_a~0 1) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse4 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (and (= 3 ~m_run_pc~0) .cse2 .cse3) .cse14 .cse1) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1))))) [2019-11-16 00:44:45,738 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-16 00:44:45,738 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 125) no Hoare annotation was computed. [2019-11-16 00:44:45,738 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2019-11-16 00:44:45,738 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,738 INFO L439 ceAbstractionStarter]: At program point L118(lines 101 843) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2019-11-16 00:44:45,738 INFO L443 ceAbstractionStarter]: For program point L911(lines 911 964) no Hoare annotation was computed. [2019-11-16 00:44:45,739 INFO L439 ceAbstractionStarter]: At program point L779(lines 772 807) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse5 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and .cse1 .cse2 .cse3 (and .cse5 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,739 INFO L439 ceAbstractionStarter]: At program point L713(lines 706 723) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 6 ~m_run_pc~0)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) .cse6 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse8 (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse6 .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 (= ~req_tt_a~0 2) (and (and .cse6 .cse5 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,739 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 585) no Hoare annotation was computed. [2019-11-16 00:44:45,740 INFO L446 ceAbstractionStarter]: At program point L1374(lines 1351 1376) the Hoare annotation is: true [2019-11-16 00:44:45,740 INFO L439 ceAbstractionStarter]: At program point L317(lines 287 318) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse2 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0))) (.cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse1 (<= ~c_req_d~0 51) (and (<= ~a_t~0 1) .cse2) .cse3) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse2) (<= 50 ~c_req_d~0) .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:44:45,740 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 916) no Hoare annotation was computed. [2019-11-16 00:44:45,740 INFO L443 ceAbstractionStarter]: For program point L714(lines 485 837) no Hoare annotation was computed. [2019-11-16 00:44:45,740 INFO L439 ceAbstractionStarter]: At program point L1243(lines 1236 1253) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1)) (.cse0 (<= ~m_run_pc~0 0)) (.cse1 (= 0 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse0 (<= 2 ~s_run_st~0) .cse1 .cse4 .cse5 .cse2))) [2019-11-16 00:44:45,741 INFO L443 ceAbstractionStarter]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2019-11-16 00:44:45,741 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 124) no Hoare annotation was computed. [2019-11-16 00:44:45,741 INFO L443 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2019-11-16 00:44:45,741 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 719) no Hoare annotation was computed. [2019-11-16 00:44:45,741 INFO L439 ceAbstractionStarter]: At program point L385(lines 378 395) the Hoare annotation is: (let ((.cse4 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~s_memory0~0 50)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 51) .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,742 INFO L439 ceAbstractionStarter]: At program point L253(lines 246 263) the Hoare annotation is: (let ((.cse21 (= ~c_empty_rsp~0 1)) (.cse22 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse26 (<= 1 ~c_req_type~0)) (.cse28 (and (= 3 ~m_run_pc~0) .cse21 .cse22)) (.cse27 (and (<= ~m_run_pc~0 0) .cse22 .cse21))) (let ((.cse11 (<= ~c_req_a~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse13 (and .cse26 (or .cse28 .cse27))) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse23 (and .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (<= ~a_t~0 0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (and .cse11 .cse12 .cse14 .cse15 (and .cse26 .cse10 (or .cse27 .cse28)) .cse18 .cse16)) (.cse20 (= 0 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse6 .cse4 .cse20 .cse7 .cse8 .cse17) (and (and (not .cse9) .cse21 .cse22) .cse5 (<= 2 ~s_run_pc~0)) (and (and (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse23 (<= ~c_req_a~0 2)) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse24 (<= 52 ~c_req_d~0) .cse25 (<= ~c_req_d~0 52)) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse23 (<= ~c_req_a~0 1)) .cse3 .cse4 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse24 (<= ~c_req_d~0 51) .cse25 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse19 .cse5 .cse20)))))) [2019-11-16 00:44:45,742 INFO L439 ceAbstractionStarter]: At program point L121(lines 101 843) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse8 (<= 3 ~m_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse26 (and .cse2 .cse3))) (let ((.cse14 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (= ~req_tt_a~0 1)) (.cse20 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse21 (= ~a_t~0 1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse30 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse31 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse22 (= 0 ~c_req_a~0)) (.cse13 (and .cse0 .cse27 .cse5 .cse26)) (.cse23 (= ~req_tt_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse32 (= ~req_tt_a~0 2)) (.cse17 (= ~s_memory1~0 51)) (.cse19 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse33 (<= 2 ~c_req_a~0)) (.cse35 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse36 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse15 (= 0 ~c_req_type~0)) (.cse6 (= 6 ~m_run_pc~0)) (.cse25 (and .cse1 .cse0 .cse4 .cse27 .cse5 .cse2 .cse8)) (.cse7 (<= 2 ~a_t~0)) (.cse16 (= ~s_memory0~0 50)) (.cse34 (<= ~c_req_a~0 2))) (or (and (and .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5) .cse6 .cse7) (and .cse4 (<= 2 ~s_run_pc~0) .cse2 (not .cse5) .cse8 .cse3) (and .cse9 .cse10 .cse11 .cse12 (and .cse6 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse9 .cse12 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse6 .cse16 .cse17 .cse14 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse23 (= 50 ~c_rsp_d~0) .cse24 .cse25) (and .cse6 (and (<= 0 ~a_t~0) (and (and .cse0 .cse4 .cse5 .cse26) .cse27))) (and .cse9 .cse12 .cse15 .cse16 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse28 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse29 .cse30 .cse18 .cse19 .cse20 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse10 .cse11 (= 51 ~c_rsp_d~0) (and .cse6 .cse25) .cse21 .cse31) (and .cse9 .cse32 .cse12 .cse15 .cse16 .cse17 .cse28 .cse29 .cse30 .cse19 .cse11 .cse33 (and .cse13 .cse6 .cse7) .cse34 .cse31) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse15 .cse16 .cse6 .cse17 .cse22 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse35 .cse13 .cse23 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse24 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse36) (and .cse9 .cse32 (= 52 ~c_rsp_d~0) .cse17 (<= ULTIMATE.start_s_memory_read_~i 2) .cse19 .cse11 .cse33 .cse35 (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse36 (and .cse12 .cse15 (and .cse6 .cse25 .cse7) .cse16) .cse34))))) [2019-11-16 00:44:45,743 INFO L443 ceAbstractionStarter]: For program point L386(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:44:45,743 INFO L443 ceAbstractionStarter]: For program point L254(lines 134 480) no Hoare annotation was computed. [2019-11-16 00:44:45,743 INFO L443 ceAbstractionStarter]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2019-11-16 00:44:45,743 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-16 00:44:45,743 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 259) no Hoare annotation was computed. [2019-11-16 00:44:45,744 INFO L439 ceAbstractionStarter]: At program point L1048(lines 1041 1085) the Hoare annotation is: (let ((.cse29 (= 3 ~m_run_pc~0)) (.cse27 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2)) (.cse30 (= ~c_empty_req~0 1))) (let ((.cse1 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse9 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse4 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= 2 ~a_t~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse19 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse10 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~s_memory2~0 52)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse15 (= 0 ~c_req_type~0)) (.cse17 (and .cse27 .cse32 .cse31 (and .cse30 (<= 3 ~m_run_pc~0)))) (.cse16 (= 6 ~m_run_pc~0)) (.cse21 (<= ~c_req_d~0 50)) (.cse22 (<= 50 ~c_req_d~0)) (.cse2 (= 1 ~c_write_rsp_ev~0)) (.cse25 (<= 0 ~a_t~0)) (.cse24 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (and .cse27 (and .cse29 .cse30) .cse32 .cse31)) (.cse26 (<= ~a_t~0 0)) (.cse7 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse23 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse35 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse33 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse34 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse36 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= 52 ~c_req_d~0) .cse0 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (and .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9)) (and .cse10 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse11 .cse12 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (and (<= 1 ~c_req_a~0) (and (and .cse14 .cse15 (and .cse16 (and .cse17 .cse18))) .cse2) .cse6 .cse19 .cse20 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= ~a_t~0 1)) (and .cse10 (= ~req_tt_a~0 2) .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) .cse1 .cse8 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse9 (and (and .cse2 (and .cse14 .cse15 (and .cse16 .cse17 .cse4 .cse5))) .cse6) (<= ~c_req_a~0 2)) .cse11) (and (and .cse2 .cse12 (and (<= ~a_t~0 1) .cse18 (<= 1 ~a_t~0) .cse3)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse19 .cse0 .cse20 (<= 51 ~c_req_d~0)) (and (and .cse21 .cse22 .cse7 .cse23 .cse0 (and (and .cse24 .cse25 .cse26 (and (<= 1 ~c_req_type~0) .cse27 (let ((.cse28 (and .cse29 .cse30 (not .cse31)))) (or (and (= 0 ~s_run_pc~0) .cse28) (and (<= 2 ~s_run_pc~0) .cse28))) (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse32 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse2) .cse33 .cse34) .cse35 .cse36) (and .cse10 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse8 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse14 .cse15 (and (= 0 ~c_req_a~0) (and .cse24 .cse17) .cse16 .cse35)) .cse2) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse36) (and (and .cse21 .cse22 (and .cse2 (and .cse25 (and (and .cse24 .cse3) .cse26))) .cse7 .cse23 .cse0 .cse35 .cse33 .cse34) .cse36)))) [2019-11-16 00:44:45,744 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:44:45,744 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 65) no Hoare annotation was computed. [2019-11-16 00:44:45,744 INFO L439 ceAbstractionStarter]: At program point L587(lines 580 615) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (let ((.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse10 (and .cse0 (and .cse2 .cse3) .cse4 .cse1)) (.cse9 (= 6 ~m_run_pc~0)) (.cse8 (= ~s_memory1~0 51)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~s_memory2~0 52))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= 0 ~a_t~0) (and (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse0 .cse4 .cse1)) .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse5 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and .cse9 .cse10) (<= 2 ~c_req_a~0) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse11 .cse12 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and .cse11 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse6 .cse7 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse10) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse9 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse8 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse13 (<= ~c_req_a~0 1) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) (= ~a_t~0 0))))) [2019-11-16 00:44:45,745 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2019-11-16 00:44:45,745 INFO L439 ceAbstractionStarter]: At program point L918(lines 911 964) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (<= ~c_req_type~0 1)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse32 (= ~s_run_pc~0 2)) (.cse13 (= 3 ~m_run_pc~0)) (.cse17 (<= 1 ~c_req_type~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse22 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse27 (and .cse11 .cse18 .cse12 .cse21 .cse32 (and .cse13 .cse17 .cse16 .cse19 .cse20) .cse22)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= 1 ~c_req_a~0)) (.cse6 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 6 ~m_run_pc~0)) (.cse4 (and (and .cse16 .cse19 (<= 3 ~m_run_pc~0) .cse20) .cse11 .cse21 .cse32)) (.cse2 (= 0 ~c_req_type~0)) (.cse29 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~s_memory2~0 52)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 (and (= 0 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and .cse11 .cse12 (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~s_run_pc~0) .cse5 .cse19 .cse20) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~s_run_pc~0) .cse5 .cse19 .cse20))) .cse21 .cse22)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse0 (= ~req_tt_a~0 2) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse23 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and .cse1 .cse2 (and .cse4 .cse3 .cse24 .cse25)) .cse26 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse8) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse23 .cse27 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse26) .cse24 .cse25) .cse6 .cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (and .cse28 .cse27 (= 1 ULTIMATE.start_s_run_~req_a~1) .cse29) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse30 (<= 1 ~a_t~0) .cse31) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse28 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse1 (and .cse3 .cse4) .cse2) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29) .cse7 (= ~req_tt_a~0 1) .cse8 .cse31 .cse9 .cse30 (= ~a_t~0 1))))) [2019-11-16 00:44:45,745 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 377) no Hoare annotation was computed. [2019-11-16 00:44:45,746 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2019-11-16 00:44:45,746 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 65) no Hoare annotation was computed. [2019-11-16 00:44:45,746 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 999) no Hoare annotation was computed. [2019-11-16 00:44:45,746 INFO L439 ceAbstractionStarter]: At program point L787(lines 780 806) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse5 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and .cse1 .cse2 .cse3 (and .cse5 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,746 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-11-16 00:44:45,747 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-16 00:44:45,747 INFO L443 ceAbstractionStarter]: For program point L920(lines 920 924) no Hoare annotation was computed. [2019-11-16 00:44:45,747 INFO L439 ceAbstractionStarter]: At program point L524(lines 494 525) the Hoare annotation is: (let ((.cse18 (= ~c_empty_req~0 1)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 2 ~s_run_st~0)) (.cse19 (= ~s_run_pc~0 2))) (let ((.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (and (and .cse18 .cse14 .cse15) .cse17 .cse11 .cse19)) (.cse2 (= 6 ~m_run_pc~0)) (.cse9 (= ~s_memory2~0 52)) (.cse12 (<= 2 ~s_run_pc~0)) (.cse13 (not .cse19)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse7 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and .cse1 .cse2) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse3 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse8 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1)) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse3 .cse4 (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse5 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (and (= 0 ~c_req_a~0) .cse1 .cse2 (= 0 ULTIMATE.start_s_run_~req_a~1)) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse11 .cse12 (and .cse13 .cse14 .cse15 (<= 3 ~m_run_pc~0))) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (and (and .cse17 .cse11 (and (= 3 ~m_run_pc~0) .cse18 .cse14 .cse15) .cse19) .cse10) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse16)))) [2019-11-16 00:44:45,747 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 65) no Hoare annotation was computed. [2019-11-16 00:44:45,747 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 793) no Hoare annotation was computed. [2019-11-16 00:44:45,748 INFO L443 ceAbstractionStarter]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2019-11-16 00:44:45,748 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2019-11-16 00:44:45,748 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 465) no Hoare annotation was computed. [2019-11-16 00:44:45,748 INFO L439 ceAbstractionStarter]: At program point L131(lines 101 843) the Hoare annotation is: (let ((.cse2 (<= 2 ~s_run_st~0)) (.cse10 (<= 2 ~s_run_pc~0)) (.cse7 (<= 0 ~a_t~0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse9 (<= ~a_t~0 0)) (.cse3 (= 0 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse6 .cse11 .cse0 .cse12 .cse2 .cse4 .cse5) (and .cse2 .cse10 .cse5 (not (= ~s_run_pc~0 2)) .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse3 .cse6 .cse11 .cse0 .cse12 .cse4 .cse5))) [2019-11-16 00:44:45,748 INFO L439 ceAbstractionStarter]: At program point L1056(lines 1049 1084) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse7 (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 3 ~m_run_pc~0)))) (.cse6 (= 6 ~m_run_pc~0)) (.cse8 (= 1 ~c_write_rsp_ev~0))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (and (<= 1 ~c_req_a~0) (and (and .cse4 .cse5 (and .cse6 (and .cse7 (<= ULTIMATE.start_m_run_~a~0 1)))) .cse8) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) .cse3 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and .cse8 (and .cse4 .cse5 (and .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)))) .cse9) (<= ~c_req_a~0 2)) .cse2) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse1 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse4 .cse5 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse7) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1))) .cse8) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-11-16 00:44:45,749 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:44:45,749 INFO L439 ceAbstractionStarter]: At program point L528-2(lines 528 556) the Hoare annotation is: (let ((.cse18 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse21 (<= 3 ~m_run_pc~0)) (.cse1 (<= 2 ~s_run_st~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (= ~s_run_pc~0 2))) (let ((.cse11 (= 0 ~c_req_type~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse16 (= ~s_memory2~0 52)) (.cse8 (= 6 ~m_run_pc~0)) (.cse9 (and .cse18 (and .cse17 .cse4 .cse5 .cse21) .cse1 .cse19 .cse20)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse14 (= ~s_memory1~0 51)) (.cse0 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse3 (not .cse20)) (.cse2 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (and (= 0 ~c_req_a~0) .cse8 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9) .cse10 (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse15 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse16 (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse11 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) .cse7 .cse10 .cse12 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse15 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse16 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) (and .cse8 (and (<= 2 ULTIMATE.start_m_run_~a~0) .cse9)) (= ~a_t~0 1)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse13 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and (and (= 3 ~m_run_pc~0) .cse17 .cse4 .cse5) .cse18 .cse1 .cse19 .cse20)) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse6) (and (and .cse3 .cse4 .cse5 .cse21) .cse1 .cse2)))) [2019-11-16 00:44:45,749 INFO L439 ceAbstractionStarter]: At program point L1189(lines 1182 1235) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1)) (.cse0 (<= ~m_run_pc~0 0)) (.cse1 (= 0 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse0 (<= 2 ~s_run_st~0) .cse1 .cse4 .cse5 .cse2))) [2019-11-16 00:44:45,750 INFO L443 ceAbstractionStarter]: For program point L991(lines 991 998) no Hoare annotation was computed. [2019-11-16 00:44:45,750 INFO L439 ceAbstractionStarter]: At program point L595(lines 588 614) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (let ((.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse10 (and .cse0 (and .cse2 .cse3) .cse4 .cse1)) (.cse9 (= 6 ~m_run_pc~0)) (.cse8 (= ~s_memory1~0 51)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~s_memory2~0 52))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= 0 ~a_t~0) (and (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse0 .cse4 .cse1)) .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse5 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and .cse9 .cse10) (<= 2 ~c_req_a~0) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse11 .cse12 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and .cse11 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse6 .cse7 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse10) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse9 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse8 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse13 (<= ~c_req_a~0 1) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) (= ~a_t~0 0))))) [2019-11-16 00:44:45,750 INFO L443 ceAbstractionStarter]: For program point L529(lines 528 556) no Hoare annotation was computed. [2019-11-16 00:44:45,750 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 403) no Hoare annotation was computed. [2019-11-16 00:44:45,751 INFO L439 ceAbstractionStarter]: At program point L397-1(lines 397 403) the Hoare annotation is: (let ((.cse2 (<= 2 ~s_run_st~0)) (.cse3 (<= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (let ((.cse4 (= ~s_memory0~0 50)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse2 .cse3 .cse0 .cse1))) (or (and (and .cse0 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse3) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse4 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and (<= ~a_t~0 1) .cse5 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse4 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) .cse5 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 (<= 52 ~c_req_d~0) .cse7 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse6 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (and (<= ULTIMATE.start_m_run_~a~0 0) .cse5) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,751 INFO L439 ceAbstractionStarter]: At program point L331(lines 324 377) the Hoare annotation is: (let ((.cse4 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~s_memory0~0 50)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 51) .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,751 INFO L443 ceAbstractionStarter]: For program point L1256(line 1256) no Hoare annotation was computed. [2019-11-16 00:44:45,751 INFO L443 ceAbstractionStarter]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2019-11-16 00:44:45,751 INFO L443 ceAbstractionStarter]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2019-11-16 00:44:45,752 INFO L439 ceAbstractionStarter]: At program point L67(lines 54 68) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~s_memory2~0 52)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= 6 ~m_run_pc~0))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (and (<= 1 ~c_req_a~0) (and .cse2 .cse3 (and .cse4 .cse5)) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 1) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (= ~req_tt_a~0 1) (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) .cse1 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse7 (and .cse6 (and .cse2 .cse3 (and .cse5 .cse4 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)))) (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) .cse8) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) .cse5 (<= ~a_t~0 0)) .cse2 .cse3 .cse4 (= ULTIMATE.start_s_memory_read_~i 0) (= 0 ULTIMATE.start_s_run_~req_a~1)) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-11-16 00:44:45,752 INFO L443 ceAbstractionStarter]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2019-11-16 00:44:45,752 INFO L439 ceAbstractionStarter]: At program point L926(lines 919 963) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (<= ~c_req_type~0 1)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse32 (= ~s_run_pc~0 2)) (.cse13 (= 3 ~m_run_pc~0)) (.cse17 (<= 1 ~c_req_type~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse22 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse27 (and .cse11 .cse18 .cse12 .cse21 .cse32 (and .cse13 .cse17 .cse16 .cse19 .cse20) .cse22)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= 1 ~c_req_a~0)) (.cse6 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 6 ~m_run_pc~0)) (.cse4 (and (and .cse16 .cse19 (<= 3 ~m_run_pc~0) .cse20) .cse11 .cse21 .cse32)) (.cse2 (= 0 ~c_req_type~0)) (.cse29 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~s_memory2~0 52)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 (and (= 0 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and .cse11 .cse12 (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~s_run_pc~0) .cse5 .cse19 .cse20) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~s_run_pc~0) .cse5 .cse19 .cse20))) .cse21 .cse22)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse0 (= ~req_tt_a~0 2) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse23 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and .cse1 .cse2 (and .cse4 .cse3 .cse24 .cse25)) .cse26 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse8) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse23 .cse27 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse26) .cse24 .cse25) .cse6 .cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (and .cse28 .cse27 (= 1 ULTIMATE.start_s_run_~req_a~1) .cse29) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse30 (<= 1 ~a_t~0) .cse31) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse28 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse1 (and .cse3 .cse4) .cse2) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29) .cse7 (= ~req_tt_a~0 1) .cse8 .cse31 .cse9 .cse30 (= ~a_t~0 1))))) [2019-11-16 00:44:45,753 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-11-16 00:44:45,753 INFO L443 ceAbstractionStarter]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2019-11-16 00:44:45,753 INFO L439 ceAbstractionStarter]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse21 (= ~s_run_pc~0 2)) (.cse12 (= ~c_empty_req~0 1)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (let ((.cse8 (= 0 ~c_req_type~0)) (.cse10 (= 0 ~c_req_a~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse9 (<= ~a_t~0 0)) (.cse17 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 0 ~a_t~0)) (.cse16 (and .cse13 .cse0 .cse21 (and (= 3 ~m_run_pc~0) .cse12 .cse1 .cse2 .cse4))) (.cse18 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse21)) (.cse19 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= ~m_run_pc~0 0)) (.cse14 (= 0 ~s_run_pc~0)) (.cse20 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse5 .cse4 .cse10 .cse11 .cse12 .cse13 .cse0 .cse1 .cse2) (and .cse6 .cse7 .cse8 .cse9 .cse14 .cse4 .cse10 .cse11 .cse12 .cse13 .cse1 .cse2) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse15 (<= 3 ULTIMATE.start_m_run_~a~0) (= ~s_memory1~0 51) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 .cse17 (<= 52 ~c_req_d~0) .cse18 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse15 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse17 (<= ~c_req_d~0 51) .cse18 (and .cse16 (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0))) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse9 .cse17 (and .cse6 .cse16) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse18 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse19 .cse0 .cse5 .cse2 .cse3 .cse4 .cse20) (and (<= ~c_req_a~0 0) .cse19 (<= 0 ~c_req_a~0) .cse12 .cse7 .cse0 .cse14 .cse1 .cse2 .cse4 .cse20)))) [2019-11-16 00:44:45,753 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 873) no Hoare annotation was computed. [2019-11-16 00:44:45,754 INFO L439 ceAbstractionStarter]: At program point L795(lines 788 805) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse5 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and .cse1 .cse2 .cse3 (and .cse5 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,754 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 733) no Hoare annotation was computed. [2019-11-16 00:44:45,754 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 601) no Hoare annotation was computed. [2019-11-16 00:44:45,754 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 337) no Hoare annotation was computed. [2019-11-16 00:44:45,755 INFO L439 ceAbstractionStarter]: At program point L1324(lines 1317 1334) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse48 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= ~c_req_type~0 1)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse36 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse28 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse23 (and .cse14 .cse15 .cse17 .cse36 .cse50)) (.cse41 (<= 2 ~c_req_a~0)) (.cse37 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse38 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse42 (<= ~c_req_a~0 2)) (.cse25 (<= ~a_t~0 1)) (.cse27 (<= 1 ~a_t~0)) (.cse39 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse40 (<= 2 ~a_t~0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse20 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse13 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse43 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse44 (= ~s_memory2~0 52)) (.cse22 (<= 1 ~c_req_a~0)) (.cse33 (= ~s_memory0~0 50)) (.cse45 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= 0 ~c_req_type~0)) (.cse26 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse31 (and .cse14 .cse48 .cse17 .cse36)) (.cse32 (= 6 ~m_run_pc~0)) (.cse29 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ~c_req_a~0 1)) (.cse34 (= ~s_memory1~0 51)) (.cse46 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 (and .cse13 (and .cse14 .cse15 .cse16 .cse5 .cse17))) .cse18) (and .cse9 .cse3 .cse19 .cse10 .cse5 .cse8 .cse20 .cse2 .cse14 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse21 (<= 51 ~c_req_d~0) (and .cse22 .cse23 .cse24) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse19 (and .cse20 .cse31 .cse32)) .cse33 .cse34 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse28 (= ~a_t~0 0) .cse21 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse35 (and .cse7 (not .cse36) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse33 .cse28 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse21 .cse37 .cse38 .cse39 .cse40 (and .cse41 .cse23 .cse42)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse43 (= ~req_tt_a~0 2) .cse44 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse41 (and (and .cse31 .cse32 .cse39 .cse40) .cse45 .cse19) .cse33 .cse34 .cse37 .cse38 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse42 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse46) (and (and .cse39 (and .cse14 (and .cse2 .cse4 .cse35 .cse7 .cse8)) .cse40) .cse32) (and .cse32 (let ((.cse47 (and (and (and .cse4 .cse48) .cse14 .cse36) .cse17))) (or (and .cse9 (and (and .cse13 .cse47) .cse10) .cse18) (and (and .cse47 .cse25 .cse26 .cse27) .cse30) (and .cse39 .cse40 .cse47)))) (and .cse9 .cse3 .cse19 .cse10 .cse8 .cse20 .cse2 .cse14 .cse4 .cse36 .cse6 .cse7) (and .cse4 .cse16 .cse5) (and .cse35 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse11 .cse12 (and .cse9 (and (and .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse36)) .cse10))) .cse18) (and (and .cse49 .cse7 .cse8) .cse14 .cse4 .cse36) (and .cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse44 (and .cse22 .cse33 (and .cse45 .cse19 (and (and .cse26 .cse31) .cse32 .cse29)) .cse24) .cse34 (= ~req_tt_a~0 1) .cse46 .cse30 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,755 INFO L443 ceAbstractionStarter]: For program point L135(lines 134 480) no Hoare annotation was computed. [2019-11-16 00:44:45,755 INFO L443 ceAbstractionStarter]: For program point L928(lines 928 932) no Hoare annotation was computed. [2019-11-16 00:44:45,755 INFO L443 ceAbstractionStarter]: For program point L796(lines 485 837) no Hoare annotation was computed. [2019-11-16 00:44:45,756 INFO L443 ceAbstractionStarter]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2019-11-16 00:44:45,756 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2019-11-16 00:44:45,756 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 801) no Hoare annotation was computed. [2019-11-16 00:44:45,756 INFO L439 ceAbstractionStarter]: At program point L467(lines 460 477) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse1 (and (<= 2 ~c_write_req_ev~0) .cse4 .cse7 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse6 .cse8))) (.cse0 (= ~s_memory0~0 50)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 (and .cse5 .cse6 (not .cse7) .cse8) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (<= 0 ~a_t~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1)) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse1 (<= ~a_t~0 1)) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse2 (<= ~c_req_d~0 51) .cse3)))) [2019-11-16 00:44:45,756 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2019-11-16 00:44:45,756 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-16 00:44:45,757 INFO L443 ceAbstractionStarter]: For program point L864(lines 864 872) no Hoare annotation was computed. [2019-11-16 00:44:45,757 INFO L443 ceAbstractionStarter]: For program point L468(lines 460 477) no Hoare annotation was computed. [2019-11-16 00:44:45,757 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 79) no Hoare annotation was computed. [2019-11-16 00:44:45,757 INFO L439 ceAbstractionStarter]: At program point L865(lines 860 1111) the Hoare annotation is: false [2019-11-16 00:44:45,757 INFO L439 ceAbstractionStarter]: At program point L667(lines 637 668) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse8 (= 6 ~m_run_pc~0)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~s_memory2~0 52)) (.cse7 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse5 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse7) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse5 .cse6 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (and .cse8 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and .cse0 .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse8 .cse4 .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-11-16 00:44:45,757 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 473) no Hoare annotation was computed. [2019-11-16 00:44:45,758 INFO L439 ceAbstractionStarter]: At program point L1130(lines 1119 1160) the Hoare annotation is: (let ((.cse66 (= 3 ~m_run_pc~0)) (.cse28 (<= 2 ~c_write_rsp_ev~0)) (.cse29 (= ~c_empty_rsp~0 1))) (let ((.cse22 (<= ~c_req_a~0 0)) (.cse23 (<= 0 ~c_req_a~0)) (.cse14 (and .cse28 (<= 3 ~m_run_pc~0) .cse29)) (.cse13 (<= 2 ~s_run_st~0)) (.cse24 (= ~c_empty_req~0 1)) (.cse27 (= ~m_run_st~0 0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= ~c_req_type~0 1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse15 (= ~s_run_pc~0 2)) (.cse79 (and .cse66 (<= 1 ~c_req_type~0) .cse28 .cse29))) (let ((.cse37 (and .cse12 .cse19 .cse16 .cse15 .cse79)) (.cse33 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse40 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse25 (<= ~m_run_pc~0 0)) (.cse26 (<= ~c_m_lock~0 0)) (.cse10 (<= ~a_t~0 1)) (.cse8 (<= 1 ~a_t~0)) (.cse55 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse32 (<= ~c_req_d~0 51)) (.cse56 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse57 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse35 (<= 51 ~c_req_d~0)) (.cse43 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (.cse64 (and .cse12 .cse13 .cse16 .cse15 (and .cse66 .cse24 .cse27 .cse28))) (.cse41 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse49 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse62 (<= 52 ~c_req_d~0)) (.cse34 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse63 (<= ~c_req_d~0 52)) (.cse53 (<= ULTIMATE.start_s_run_~req_d~1 52)) (.cse68 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse36 (<= 1 ~c_req_a~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse38 (<= ~c_req_a~0 1)) (.cse71 (= ~req_tt_a~0 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse73 (= ~a_t~0 1)) (.cse44 (and .cse12 .cse14 .cse16 .cse15)) (.cse58 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse59 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse75 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse76 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse31 (= 0 ~c_req_a~0)) (.cse42 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse47 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse48 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (= ~req_tt_a~0 0)) (.cse52 (= ~a_t~0 0)) (.cse21 (= 0 ~s_run_pc~0)) (.cse65 (<= 2 ~s_run_pc~0)) (.cse17 (<= ~c_req_d~0 50)) (.cse18 (<= 50 ~c_req_d~0)) (.cse4 (<= 0 ~a_t~0)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (and .cse22 .cse23 .cse79)) (.cse1 (<= ~a_t~0 0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse67 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse77 (= ~req_tt_a~0 2)) (.cse45 (= ~s_memory0~0 50)) (.cse0 (= 6 ~m_run_pc~0)) (.cse74 (and .cse12 .cse13 (and .cse24 .cse27 .cse28) .cse16 .cse15)) (.cse6 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= 2 ~a_t~0)) (.cse70 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse30 (= 0 ~c_req_type~0)) (.cse60 (<= 2 ~c_req_a~0)) (.cse50 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse46 (= ~s_memory1~0 51)) (.cse54 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse61 (<= ~c_req_a~0 2)) (.cse69 (= ~s_memory2~0 52)) (.cse78 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse72 (<= ULTIMATE.start_s_memory_write_~v 52))) (or (and .cse0 (let ((.cse3 (and (and .cse12 .cse13 .cse14 .cse15) .cse16))) (or (and (and .cse1 (and .cse2 .cse3)) .cse4 .cse5) (and .cse6 .cse3 .cse7) (and .cse8 .cse9 (and .cse10 .cse11 .cse3))))) (and .cse4 .cse1 (and .cse17 .cse18 (and .cse2 (and .cse12 .cse19 .cse20 .cse21 .cse16))) .cse5) (and .cse22 .cse23 .cse24 .cse25 .cse13 .cse21 .cse26 .cse27 .cse28 .cse29) (and .cse4 .cse25 .cse30 .cse1 .cse21 .cse29 .cse31 .cse24 .cse12 .cse26 .cse28) (and (and .cse32 .cse33 .cse34 .cse35 (and .cse36 .cse37 .cse38) .cse39 .cse40) .cse10 .cse11 .cse8 .cse41 .cse42 .cse9) (and .cse43 (and .cse30 (and .cse31 .cse44 .cse0)) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse41 .cse52 .cse34 .cse53 .cse54) (and (and .cse55 .cse45 .cse41 .cse56 .cse57 .cse34 .cse58 .cse59 .cse6 .cse7 (and .cse60 .cse37 .cse61)) .cse62 .cse63) (and .cse17 (and .cse2 .cse4 .cse64 .cse1) .cse18 .cse41 .cse33 .cse34 .cse42 .cse39 .cse40 .cse5) (and .cse25 .cse4 .cse30 .cse1 .cse65 .cse29 .cse31 .cse24 .cse12 .cse13 .cse26 .cse27 .cse28) (and (and .cse66 .cse28 .cse29) .cse12 .cse13 .cse15) (and .cse0 (and (and .cse24 .cse12 .cse13 .cse15 .cse28 .cse29) .cse6 .cse7)) (and .cse67 .cse68 .cse69 (and .cse36 .cse45 (and .cse70 .cse30 (and (and .cse11 .cse44) .cse0 .cse42)) .cse38) .cse46 .cse71 .cse72 .cse9 .cse73) (and .cse10 .cse11 .cse8 .cse41 (and .cse55 .cse64 .cse45 .cse32 .cse56 .cse57 .cse58 .cse34 .cse59 .cse35) .cse9) (and .cse43 (and .cse50 .cse64 .cse45 .cse41 .cse46 .cse6 .cse7 .cse54) .cse49 .cse62 .cse34 .cse63 .cse53) (and .cse13 .cse65 (and .cse28 (not .cse15) .cse29)) (and .cse67 .cse68 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse46 (and .cse36 .cse45 (and .cse70 (and (and .cse11 .cse74) .cse0) .cse30) .cse58 .cse59 .cse75 .cse38 .cse76) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse71 .cse72 .cse9 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse69 (= 51 ~c_rsp_d~0) .cse73) (and .cse67 .cse77 .cse69 .cse78 (and .cse60 (and (and .cse44 .cse0 .cse6 .cse7) .cse70 .cse30) .cse45 .cse46 .cse58 .cse59 .cse75 .cse61 .cse76) .cse72) (and .cse67 (and .cse31 .cse74 .cse70 .cse30 .cse0 .cse42) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse45 .cse46 .cse72 .cse47 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse69 .cse48 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse51 (= 50 ~c_rsp_d~0) .cse52) (and .cse13 .cse20 .cse21) (and .cse65 (and .cse66 .cse24 .cse28 .cse29)) (and (and .cse17 .cse18 (and .cse4 (and (and .cse2 (and .cse12 .cse19 .cse20 .cse16 .cse15)) .cse1))) .cse5) (and .cse67 .cse77 (and (and .cse45 (and (and .cse0 .cse74 .cse6 .cse7) .cse70 .cse30)) .cse60 .cse50 .cse46 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse54 .cse61) .cse69 .cse78 (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse72))))) [2019-11-16 00:44:45,759 INFO L439 ceAbstractionStarter]: At program point L1064(lines 1057 1083) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse7 (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 3 ~m_run_pc~0)))) (.cse6 (= 6 ~m_run_pc~0)) (.cse8 (= 1 ~c_write_rsp_ev~0))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (and (<= 1 ~c_req_a~0) (and (and .cse4 .cse5 (and .cse6 (and .cse7 (<= ULTIMATE.start_m_run_~a~0 1)))) .cse8) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) .cse3 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and .cse8 (and .cse4 .cse5 (and .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)))) .cse9) (<= ~c_req_a~0 2)) .cse2) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse1 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse4 .cse5 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse7) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1))) .cse8) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-11-16 00:44:45,759 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,759 INFO L443 ceAbstractionStarter]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2019-11-16 00:44:45,759 INFO L439 ceAbstractionStarter]: At program point L1197(lines 1190 1234) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1)) (.cse0 (<= ~m_run_pc~0 0)) (.cse1 (= 0 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse0 (<= 2 ~s_run_st~0) .cse1 .cse4 .cse5 .cse2))) [2019-11-16 00:44:45,760 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-16 00:44:45,760 INFO L443 ceAbstractionStarter]: For program point L867(lines 867 871) no Hoare annotation was computed. [2019-11-16 00:44:45,760 INFO L439 ceAbstractionStarter]: At program point L735(lines 728 745) the Hoare annotation is: (let ((.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse2 (= 6 ~m_run_pc~0)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse1) .cse2 (<= 1 ULTIMATE.start_m_run_~a~0)) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse3 (= ~req_tt_a~0 2) (and (and .cse2 .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse4 .cse0 .cse5) (= 52 ~c_rsp_d~0) .cse6 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and .cse3 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse4 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse5 .cse2 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse8 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-11-16 00:44:45,761 INFO L439 ceAbstractionStarter]: At program point L603(lines 596 613) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (let ((.cse12 (= 6 ~m_run_pc~0)) (.cse11 (and .cse0 (and .cse2 .cse3) .cse4 .cse1)) (.cse5 (= 0 ~c_req_type~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse8 (= ~s_memory1~0 51)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~s_memory2~0 52))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= 0 ~a_t~0) (and (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse0 .cse4 .cse1)) .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse9 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse6 .cse7 .cse8 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse11) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse12 (= 0 ULTIMATE.start_s_run_~req_a~1)) (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse13 (<= ~c_req_a~0 1) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (and .cse12 .cse11) .cse5 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse9 .cse10 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1) (<= ~c_req_a~0 2))))) [2019-11-16 00:44:45,761 INFO L439 ceAbstractionStarter]: At program point L339(lines 332 376) the Hoare annotation is: (let ((.cse4 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~s_memory0~0 50)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 51) .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,761 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2019-11-16 00:44:45,762 INFO L439 ceAbstractionStarter]: At program point L207(lines 177 208) the Hoare annotation is: (let ((.cse18 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 2 ~s_run_st~0)) (.cse19 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse22 (= ~s_run_pc~0 2)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse0 (and .cse18 .cse8 .cse19 .cse20 (and (= 3 ~m_run_pc~0) .cse12 .cse11) .cse22 .cse10)) (.cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 0 ~s_run_pc~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse17 (= 0 ~c_req_a~0)) (.cse3 (<= 0 ~a_t~0)) (.cse16 (= 0 ~c_req_type~0)) (.cse5 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (<= ~m_run_pc~0 0)) (.cse23 (<= 2 ~s_run_pc~0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse4 (<= ~a_t~0 0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= ~a_t~0 1) (<= 1 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse0) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 (<= ~c_req_d~0 51) .cse2) (and (and (<= ULTIMATE.start_m_run_~req_a~0 1) .cse0 (<= 1 ULTIMATE.start_m_run_~req_a~0)) .cse3 .cse4 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse1 .cse2 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse3 .cse6 .cse7 .cse16 .cse4 .cse9 .cse12 .cse17 (= ULTIMATE.start_m_run_~a~0 0) .cse18 .cse19 .cse20 .cse10 .cse21 .cse11 .cse14) (and .cse8 (and (not .cse22) .cse12 .cse11) .cse23) (and .cse15 .cse17 .cse3 .cse16 (and .cse5 .cse18 .cse7 .cse6 .cse8 .cse23 .cse19 .cse20 .cse10 .cse11 .cse12 .cse14) .cse4 .cse21 .cse13)))) [2019-11-16 00:44:45,762 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2019-11-16 00:44:45,762 INFO L439 ceAbstractionStarter]: At program point L934(lines 927 962) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (<= ~c_req_type~0 1)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse32 (= ~s_run_pc~0 2)) (.cse13 (= 3 ~m_run_pc~0)) (.cse17 (<= 1 ~c_req_type~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse22 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse27 (and .cse11 .cse18 .cse12 .cse21 .cse32 (and .cse13 .cse17 .cse16 .cse19 .cse20) .cse22)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= 1 ~c_req_a~0)) (.cse6 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 6 ~m_run_pc~0)) (.cse4 (and (and .cse16 .cse19 (<= 3 ~m_run_pc~0) .cse20) .cse11 .cse21 .cse32)) (.cse2 (= 0 ~c_req_type~0)) (.cse29 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~s_memory2~0 52)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 (and (= 0 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and .cse11 .cse12 (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~s_run_pc~0) .cse5 .cse19 .cse20) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~s_run_pc~0) .cse5 .cse19 .cse20))) .cse21 .cse22)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse0 (= ~req_tt_a~0 2) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse23 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and .cse1 .cse2 (and .cse4 .cse3 .cse24 .cse25)) .cse26 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse8) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse23 .cse27 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse26) .cse24 .cse25) .cse6 .cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (and .cse28 .cse27 (= 1 ULTIMATE.start_s_run_~req_a~1) .cse29) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse30 (<= 1 ~a_t~0) .cse31) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse28 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse1 (and .cse3 .cse4) .cse2) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29) .cse7 (= ~req_tt_a~0 1) .cse8 .cse31 .cse9 .cse30 (= ~a_t~0 1))))) [2019-11-16 00:44:45,763 INFO L439 ceAbstractionStarter]: At program point L868(lines 860 1111) the Hoare annotation is: (let ((.cse6 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse23 (<= ~c_req_type~0 1)) (.cse21 (and .cse6 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse22 (<= 2 ~c_write_req_ev~0)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse25 (= ~s_run_pc~0 2))) (let ((.cse0 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse1 (<= 1 ~c_req_a~0)) (.cse3 (<= ~c_req_a~0 1)) (.cse5 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ~s_memory2~0 52)) (.cse14 (= 6 ~m_run_pc~0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (and .cse22 (and .cse7 .cse8) .cse24 .cse25)) (.cse12 (= 0 ~c_req_type~0)) (.cse19 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (and .cse22 .cse23 .cse24 .cse25 .cse21)) (.cse11 (<= 2 ~c_req_a~0)) (.cse18 (<= ~c_req_a~0 2)) (.cse15 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 2 ~a_t~0)) (.cse4 (= ~s_memory0~0 50)) (.cse17 (= ~s_memory1~0 51))) (or (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (and (<= 1 ~a_t~0) (and (<= ~a_t~0 1) .cse0 (and .cse1 .cse2 .cse3))) .cse4 (<= ~c_req_d~0 51) (<= 51 ~c_req_d~0)) .cse5) (and (and .cse6 (= ~c_empty_req~0 1) .cse7 .cse8) (<= 2 ~s_run_pc~0)) (and .cse9 (= ~req_tt_a~0 2) .cse10 (and .cse11 .cse4 (and .cse12 (and .cse13 .cse14 .cse15 .cse16)) .cse17 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse18 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse19) (and .cse9 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse0 (and .cse1 .cse4 (and (and .cse13 .cse14) .cse12) .cse3) .cse17 (= ~req_tt_a~0 1) .cse19 .cse5 (= ~a_t~0 1)) (and (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and (<= 0 ~a_t~0) (<= ~a_t~0 0) (and .cse20 (and (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse21) .cse22 .cse23 .cse24 .cse25)))) .cse26) (and .cse9 .cse10 (= ~req_tt_a~0 0) .cse4 .cse17 (= ~a_t~0 0) (and (and (= 0 ~c_req_a~0) .cse14 (and .cse20 .cse13)) .cse12) .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse26) (and (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse2 .cse11 .cse18) .cse15 .cse16) .cse4 .cse17 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)))))) [2019-11-16 00:44:45,763 INFO L443 ceAbstractionStarter]: For program point L736(lines 728 745) no Hoare annotation was computed. [2019-11-16 00:44:45,763 INFO L443 ceAbstractionStarter]: For program point L604(lines 485 837) no Hoare annotation was computed. [2019-11-16 00:44:45,763 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 459) no Hoare annotation was computed. [2019-11-16 00:44:45,763 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 79) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L1001-1(lines 876 1106) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,764 INFO L443 ceAbstractionStarter]: For program point L737(lines 737 741) no Hoare annotation was computed. [2019-11-16 00:44:45,765 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-11-16 00:44:45,765 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-16 00:44:45,765 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-16 00:44:45,765 INFO L439 ceAbstractionStarter]: At program point L275(lines 268 285) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse3 (= ~c_empty_rsp~0 1))) (let ((.cse6 (and .cse4 (not .cse5) .cse3))) (let ((.cse0 (and (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 0) (and .cse6 (<= 1 ~c_req_type~0) (<= 1 ULTIMATE.start_m_run_~req_type~0)) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse2 (= 0 ~s_run_pc~0)) (.cse1 (<= 2 ~s_run_st~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 (and .cse3 .cse4) .cse5) (and (<= ULTIMATE.start_m_run_~req_d~0 50) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 0 ~a_t~0) .cse0 (<= ~c_req_type~0 1) (<= ~a_t~0 0) .cse2 (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_m_run_~req_d~0)) (and .cse1 (<= 2 ~s_run_pc~0) .cse6))))) [2019-11-16 00:44:45,765 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2019-11-16 00:44:45,765 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:44:45,766 INFO L443 ceAbstractionStarter]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2019-11-16 00:44:45,766 INFO L443 ceAbstractionStarter]: For program point L936(lines 936 940) no Hoare annotation was computed. [2019-11-16 00:44:45,766 INFO L439 ceAbstractionStarter]: At program point L11-3(lines 1 1376) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= ~s_memory2~0 52)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse7 (= 6 ~m_run_pc~0)) (.cse6 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse3 (= ~s_memory0~0 50)) (.cse2 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52))) (or (and .cse0 (= ~req_tt_a~0 2) .cse1 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (and .cse3 (and .cse4 .cse5 (and .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)))) (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) .cse8) (and .cse0 .cse3 .cse2 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (and (= 0 ~c_req_a~0) .cse4 .cse5 .cse7 (and (<= ULTIMATE.start_m_run_~a~0 0) .cse6) (= ULTIMATE.start_s_memory_read_~i 0) (= 0 ULTIMATE.start_s_run_~req_a~1)) (= ~a_t~0 0) (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (and (<= 1 ~c_req_a~0) (and .cse4 .cse5 (and .cse7 .cse6)) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 1) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse2 (= ~req_tt_a~0 1) .cse8 (= ~a_t~0 1)))) [2019-11-16 00:44:45,767 INFO L439 ceAbstractionStarter]: At program point L11-4(lines 70 82) the Hoare annotation is: (let ((.cse20 (<= 2 ~c_write_req_ev~0)) (.cse22 (<= 1 ~c_m_lock~0)) (.cse15 (= 3 ~m_run_pc~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse21 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse18 (= ~s_run_pc~0 2)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse13 (= ~s_memory0~0 50)) (.cse6 (and .cse20 .cse22 (and .cse15 .cse16 .cse21 .cse17 .cse19) .cse18 .cse23)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse5 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= 0 ~a_t~0)) (.cse8 (<= ~a_t~0 0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (and (and (and .cse5 .cse6) .cse7 .cse8) .cse9) .cse10 .cse11 .cse12) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse2 (= ~s_memory1~0 51) (and .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= 52 ~c_req_d~0) .cse4 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (and (<= 1 ~a_t~0) (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) .cse6) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_a~1 1)) (and .cse0 .cse1 (and .cse5 (and (let ((.cse14 (and .cse15 .cse16 .cse17 (not .cse18) .cse19))) (or (and .cse14 (<= 2 ~s_run_pc~0)) (and .cse14 (= 0 ~s_run_pc~0)))) (<= 1 ~c_req_type~0) .cse20 .cse21 (<= ~c_req_type~0 1) .cse22 .cse23) .cse7 .cse8 .cse9) .cse2 .cse3 .cse4 .cse10 .cse11 .cse12)))) [2019-11-16 00:44:45,767 INFO L443 ceAbstractionStarter]: For program point L276(lines 268 285) no Hoare annotation was computed. [2019-11-16 00:44:45,767 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1007) no Hoare annotation was computed. [2019-11-16 00:44:45,767 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 281) no Hoare annotation was computed. [2019-11-16 00:44:45,767 INFO L439 ceAbstractionStarter]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse21 (<= 2 ~s_run_st~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse13 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= ~c_m_lock~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse23 (= ~s_run_pc~0 2))) (let ((.cse6 (= 0 ~s_run_pc~0)) (.cse18 (and .cse11 .cse21 (and (= 3 ~m_run_pc~0) .cse9 .cse13 .cse15 .cse7 .cse16) .cse12 .cse23)) (.cse19 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse20 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse5 (<= ~a_t~0 0)) (.cse8 (= 0 ~c_req_a~0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse22 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse18 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a~0 2)) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse19 (<= ~c_req_d~0 51) .cse20) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse1 .cse6 .cse7 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse9 .cse21 .cse13 .cse15 .cse16 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17) (and (and (<= ULTIMATE.start_m_run_~req_a~0 1) .cse2 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse18) .cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse19 .cse20 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse21 .cse22 .cse16 (not .cse23) .cse7)))) [2019-11-16 00:44:45,768 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 727) no Hoare annotation was computed. [2019-11-16 00:44:45,768 INFO L443 ceAbstractionStarter]: For program point L146(lines 145 173) no Hoare annotation was computed. [2019-11-16 00:44:45,768 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 679) no Hoare annotation was computed. [2019-11-16 00:44:45,768 INFO L439 ceAbstractionStarter]: At program point L1270(lines 1263 1316) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse22 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse19 (<= ~a_t~0 1)) (.cse17 (<= 1 ~a_t~0)) (.cse35 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse33 (and .cse21 .cse27 .cse24 .cse23 .cse50)) (.cse43 (<= 2 ~c_req_a~0)) (.cse41 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse44 (<= ~c_req_a~0 2)) (.cse3 (<= ~m_run_pc~0 0)) (.cse30 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse40 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse15 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 2 ~a_t~0)) (.cse45 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse46 (= ~s_memory2~0 52)) (.cse32 (<= 1 ~c_req_a~0)) (.cse38 (= ~s_memory0~0 50)) (.cse47 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= 0 ~c_req_type~0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse37 (and .cse21 .cse22 .cse24 .cse23)) (.cse9 (= 6 ~m_run_pc~0)) (.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= ~c_req_a~0 1)) (.cse39 (= ~s_memory1~0 51)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 (let ((.cse12 (and (and .cse21 .cse4 .cse22 .cse23) .cse24))) (or (and (and .cse10 (and .cse11 .cse12)) .cse13 .cse14) (and .cse15 .cse12 .cse16) (and .cse17 .cse18 (and .cse19 .cse20 .cse12))))) (and .cse13 .cse10 (and .cse25 .cse26 (and .cse11 (and .cse21 .cse27 .cse28 .cse5 .cse24))) .cse14) (and .cse13 .cse3 .cse29 .cse10 .cse5 .cse8 .cse30 .cse2 .cse21 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse31 (<= 51 ~c_req_d~0) (and .cse32 .cse33 .cse34) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse19 .cse20 .cse17 .cse35 .cse36 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse29 (and .cse30 .cse37 .cse9)) .cse38 .cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse35 (= ~a_t~0 0) .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse40 (and .cse7 (not .cse23) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse35 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse41 .cse42 .cse15 .cse16 (and .cse43 .cse33 .cse44)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse45 (= ~req_tt_a~0 2) .cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse43 (and (and .cse37 .cse9 .cse15 .cse16) .cse47 .cse29) .cse38 .cse39 .cse41 .cse42 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse48) (and .cse13 .cse3 .cse29 .cse10 .cse8 .cse30 .cse2 .cse21 .cse4 .cse23 .cse6 .cse7) (and .cse4 .cse28 .cse5) (and .cse40 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse25 .cse26 (and .cse13 (and (and .cse11 (and .cse21 .cse27 .cse28 .cse24 .cse23)) .cse10))) .cse14) (and (and .cse49 .cse7 .cse8) .cse21 .cse4 .cse23) (and .cse9 (and (and .cse2 .cse21 .cse4 .cse23 .cse7 .cse8) .cse15 .cse16)) (and .cse45 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse46 (and .cse32 .cse38 (and .cse47 .cse29 (and (and .cse20 .cse37) .cse9 .cse36)) .cse34) .cse39 (= ~req_tt_a~0 1) .cse48 .cse18 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,769 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 151) no Hoare annotation was computed. [2019-11-16 00:44:45,769 INFO L439 ceAbstractionStarter]: At program point L1072(lines 1065 1082) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse7 (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 3 ~m_run_pc~0)))) (.cse6 (= 6 ~m_run_pc~0)) (.cse8 (= 1 ~c_write_rsp_ev~0))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (and (<= 1 ~c_req_a~0) (and (and .cse4 .cse5 (and .cse6 (and .cse7 (<= ULTIMATE.start_m_run_~a~0 1)))) .cse8) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) .cse3 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and .cse8 (and .cse4 .cse5 (and .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)))) .cse9) (<= ~c_req_a~0 2)) .cse2) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse1 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse4 .cse5 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse7) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1))) .cse8) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-11-16 00:44:45,769 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 267) no Hoare annotation was computed. [2019-11-16 00:44:45,769 INFO L439 ceAbstractionStarter]: At program point L1205(lines 1198 1233) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1)) (.cse0 (<= ~m_run_pc~0 0)) (.cse1 (= 0 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse0 (<= 2 ~s_run_st~0) .cse1 .cse4 .cse5 .cse2))) [2019-11-16 00:44:45,770 INFO L443 ceAbstractionStarter]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2019-11-16 00:44:45,770 INFO L439 ceAbstractionStarter]: At program point L413(lines 406 459) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse1 (and (<= 2 ~c_write_req_ev~0) .cse4 .cse7 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse6 .cse8))) (.cse0 (= ~s_memory0~0 50)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 (and .cse5 .cse6 (not .cse7) .cse8) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (<= 0 ~a_t~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1)) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse1 (<= ~a_t~0 1)) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse2 (<= ~c_req_d~0 51) .cse3)))) [2019-11-16 00:44:45,770 INFO L439 ceAbstractionStarter]: At program point L347(lines 340 375) the Hoare annotation is: (let ((.cse4 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~s_memory0~0 50)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 51) .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,770 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2019-11-16 00:44:45,770 INFO L443 ceAbstractionStarter]: For program point L1338-1(lines 1170 1349) no Hoare annotation was computed. [2019-11-16 00:44:45,771 INFO L443 ceAbstractionStarter]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2019-11-16 00:44:45,771 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 219) no Hoare annotation was computed. [2019-11-16 00:44:45,771 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2019-11-16 00:44:45,771 INFO L439 ceAbstractionStarter]: At program point L942(lines 935 961) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (<= ~c_req_type~0 1)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse32 (= ~s_run_pc~0 2)) (.cse13 (= 3 ~m_run_pc~0)) (.cse17 (<= 1 ~c_req_type~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse22 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse27 (and .cse11 .cse18 .cse12 .cse21 .cse32 (and .cse13 .cse17 .cse16 .cse19 .cse20) .cse22)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= 1 ~c_req_a~0)) (.cse6 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 6 ~m_run_pc~0)) (.cse4 (and (and .cse16 .cse19 (<= 3 ~m_run_pc~0) .cse20) .cse11 .cse21 .cse32)) (.cse2 (= 0 ~c_req_type~0)) (.cse29 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~s_memory2~0 52)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 (and (= 0 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and .cse11 .cse12 (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~s_run_pc~0) .cse5 .cse19 .cse20) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~s_run_pc~0) .cse5 .cse19 .cse20))) .cse21 .cse22)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse0 (= ~req_tt_a~0 2) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse23 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and .cse1 .cse2 (and .cse4 .cse3 .cse24 .cse25)) .cse26 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse8) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse23 .cse27 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse26) .cse24 .cse25) .cse6 .cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (and .cse28 .cse27 (= 1 ULTIMATE.start_s_run_~req_a~1) .cse29) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse30 (<= 1 ~a_t~0) .cse31) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse28 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse1 (and .cse3 .cse4) .cse2) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29) .cse7 (= ~req_tt_a~0 1) .cse8 .cse31 .cse9 .cse30 (= ~a_t~0 1))))) [2019-11-16 00:44:45,771 INFO L439 ceAbstractionStarter]: At program point L876-1(lines 860 1111) the Hoare annotation is: (let ((.cse33 (= 3 ~m_run_pc~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ~c_m_lock~0)) (.cse36 (= ~s_run_pc~0 2)) (.cse14 (= ~c_empty_req~0 1)) (.cse37 (= ~m_run_st~0 0)) (.cse15 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse26 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse17 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse24 (= ~s_memory2~0 52)) (.cse19 (= 6 ~m_run_pc~0)) (.cse0 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse20 (and .cse8 .cse32 .cse36 (and .cse14 .cse37 .cse15))) (.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse12 (<= ~c_req_a~0 0)) (.cse13 (<= 0 ~c_req_a~0)) (.cse25 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= ~c_req_d~0 50)) (.cse31 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse2 (and .cse8 .cse32 (and .cse33 .cse14 .cse37 .cse15))) (.cse11 (<= ~a_t~0 0)) (.cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse21 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse35 (<= 2 ~s_run_pc~0))) (or (and .cse0 (<= 1 ~a_t~0) .cse1 (and (and (<= ~a_t~0 1) .cse2) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 .cse5 .cse6 (<= 51 ~c_req_d~0)) .cse7) (and .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 (<= ~m_run_pc~0 0) (<= ~c_m_lock~0 0) .cse15 .cse16)) (and .cse17 (and (= 0 ~c_req_a~0) .cse18 .cse10 .cse19 .cse20 .cse21) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse22 .cse23 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse25 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= 52 ~c_req_d~0) .cse5 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (and .cse26 .cse3 .cse1 .cse22 .cse27 .cse2 .cse28 .cse29)) (and .cse17 (= ~req_tt_a~0 2) .cse24 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and (<= 2 ~c_req_a~0) .cse26 .cse22 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse29 (and .cse3 (and .cse18 .cse10 (and .cse20 .cse19 .cse27 .cse28))) (<= ~c_req_a~0 2)) .cse23) (and .cse17 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse23 .cse7 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 (= 51 ~c_rsp_d~0) (and (<= 1 ~c_req_a~0) (and (and .cse19 (and .cse0 .cse20)) .cse18 .cse10) .cse3 .cse4 .cse6 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~a_t~0 1)) (and .cse30 .cse31 (and (and .cse8 (<= ~c_req_type~0 1) .cse32 (let ((.cse34 (<= 1 ~c_req_type~0))) (or (and .cse33 .cse12 .cse13 .cse34 .cse35 .cse15 (not .cse36) .cse16) (and .cse33 .cse12 .cse13 .cse34 (= 0 ~s_run_pc~0) .cse15 .cse16)))) .cse25 .cse9 .cse11)) (and .cse30 .cse31 (and (<= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse2) .cse11 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse33 .cse14 .cse15 .cse16) .cse35)))) [2019-11-16 00:44:45,771 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 815) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L439 ceAbstractionStarter]: At program point L481(lines 133 482) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= 3 ULTIMATE.start_m_run_~a~0) (= ~s_memory1~0 51) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4)) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)))) [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 353) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point L944(lines 944 948) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point L879-1(lines 876 1106) no Hoare annotation was computed. [2019-11-16 00:44:45,772 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 753) no Hoare annotation was computed. [2019-11-16 00:44:45,773 INFO L439 ceAbstractionStarter]: At program point L747-1(lines 747 753) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory2~0 52))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse5 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse7) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse8 (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and (= 0 ~c_req_a~0) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse5 (and (and .cse7 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,773 INFO L439 ceAbstractionStarter]: At program point L681(lines 674 727) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 6 ~m_run_pc~0)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) .cse6 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse8 (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse6 .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 (= ~req_tt_a~0 2) (and (and .cse6 .cse5 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,773 INFO L443 ceAbstractionStarter]: For program point L880(lines 879 903) no Hoare annotation was computed. [2019-11-16 00:44:45,774 INFO L439 ceAbstractionStarter]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse62 (= 3 ~m_run_pc~0)) (.cse28 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (= ~c_empty_rsp~0 1))) (let ((.cse70 (<= ~c_req_a~0 0)) (.cse71 (<= 0 ~c_req_a~0)) (.cse14 (and .cse28 (<= 3 ~m_run_pc~0) .cse24)) (.cse13 (<= 2 ~s_run_st~0)) (.cse26 (= ~c_empty_req~0 1)) (.cse78 (= ~m_run_st~0 0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= ~c_req_type~0 1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse15 (= ~s_run_pc~0 2)) (.cse79 (and .cse62 (<= 1 ~c_req_type~0) .cse28 .cse24))) (let ((.cse34 (and .cse12 .cse19 .cse16 .cse15 .cse79)) (.cse30 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (<= ~a_t~0 1)) (.cse8 (<= 1 ~a_t~0)) (.cse52 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse29 (<= ~c_req_d~0 51)) (.cse53 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse54 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse32 (<= 51 ~c_req_d~0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse27 (<= ~c_m_lock~0 0)) (.cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (.cse61 (and .cse12 .cse13 .cse16 .cse15 (and .cse62 .cse26 .cse78 .cse28))) (.cse38 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse46 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse59 (<= 52 ~c_req_d~0)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse60 (<= ~c_req_d~0 52)) (.cse50 (<= ULTIMATE.start_s_run_~req_d~1 52)) (.cse64 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse33 (<= 1 ~c_req_a~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse35 (<= ~c_req_a~0 1)) (.cse67 (= ~req_tt_a~0 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse69 (= ~a_t~0 1)) (.cse41 (and .cse12 .cse14 .cse16 .cse15)) (.cse55 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse56 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse74 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse75 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse25 (= 0 ~c_req_a~0)) (.cse39 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse44 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse45 (= ULTIMATE.start_m_run_~a~0 0)) (.cse48 (= ~req_tt_a~0 0)) (.cse49 (= ~a_t~0 0)) (.cse21 (= 0 ~s_run_pc~0)) (.cse72 (<= 2 ~s_run_pc~0)) (.cse17 (<= ~c_req_d~0 50)) (.cse18 (<= 50 ~c_req_d~0)) (.cse4 (<= 0 ~a_t~0)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (and .cse70 .cse71 .cse79)) (.cse1 (<= ~a_t~0 0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse63 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse76 (= ~req_tt_a~0 2)) (.cse42 (= ~s_memory0~0 50)) (.cse0 (= 6 ~m_run_pc~0)) (.cse73 (and .cse12 .cse13 (and .cse26 .cse78 .cse28) .cse16 .cse15)) (.cse6 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= 2 ~a_t~0)) (.cse66 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse23 (= 0 ~c_req_type~0)) (.cse57 (<= 2 ~c_req_a~0)) (.cse47 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse43 (= ~s_memory1~0 51)) (.cse51 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse58 (<= ~c_req_a~0 2)) (.cse65 (= ~s_memory2~0 52)) (.cse77 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse68 (<= ULTIMATE.start_s_memory_write_~v 52))) (or (and .cse0 (let ((.cse3 (and (and .cse12 .cse13 .cse14 .cse15) .cse16))) (or (and (and .cse1 (and .cse2 .cse3)) .cse4 .cse5) (and .cse6 .cse3 .cse7) (and .cse8 .cse9 (and .cse10 .cse11 .cse3))))) (and .cse4 .cse1 (and .cse17 .cse18 (and .cse2 (and .cse12 .cse19 .cse20 .cse21 .cse16))) .cse5) (and .cse4 .cse22 .cse23 .cse1 .cse21 .cse24 .cse25 .cse26 .cse12 .cse27 .cse28) (and (and .cse29 .cse30 .cse31 .cse32 (and .cse33 .cse34 .cse35) .cse36 .cse37) .cse10 .cse11 .cse8 .cse38 .cse39 .cse9) (and .cse40 (and .cse23 (and .cse25 .cse41 .cse0)) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse38 .cse49 .cse31 .cse50 .cse51) (and (and .cse52 .cse42 .cse38 .cse53 .cse54 .cse31 .cse55 .cse56 .cse6 .cse7 (and .cse57 .cse34 .cse58)) .cse59 .cse60) (and .cse17 (and .cse2 .cse4 .cse61 .cse1) .cse18 .cse38 .cse30 .cse31 .cse39 .cse36 .cse37 .cse5) (and .cse4 .cse22 .cse23 .cse1 .cse24 .cse25 .cse26 .cse12 .cse13 .cse15 .cse27 .cse28) (and (and .cse62 .cse28 .cse24) .cse12 .cse13 .cse15) (and .cse0 (and (and .cse26 .cse12 .cse13 .cse15 .cse28 .cse24) .cse6 .cse7)) (and .cse63 .cse64 .cse65 (and .cse33 .cse42 (and .cse66 .cse23 (and (and .cse11 .cse41) .cse0 .cse39)) .cse35) .cse43 .cse67 .cse68 .cse9 .cse69) (and .cse10 .cse11 .cse8 .cse38 (and .cse52 .cse61 .cse42 .cse29 .cse53 .cse54 .cse55 .cse31 .cse56 .cse32) .cse9) (and .cse70 .cse71 .cse26 .cse22 .cse13 .cse21 .cse27 .cse28 .cse24) (and .cse40 (and .cse47 .cse61 .cse42 .cse38 .cse43 .cse6 .cse7 .cse51) .cse46 .cse59 .cse31 .cse60 .cse50) (and .cse13 .cse72 (and .cse28 (not .cse15) .cse24)) (and .cse63 .cse64 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse43 (and .cse33 .cse42 (and .cse66 (and (and .cse11 .cse73) .cse0) .cse23) .cse55 .cse56 .cse74 .cse35 .cse75) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse67 .cse68 .cse9 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse65 (= 51 ~c_rsp_d~0) .cse69) (and .cse63 .cse76 .cse65 .cse77 (and .cse57 (and (and .cse41 .cse0 .cse6 .cse7) .cse66 .cse23) .cse42 .cse43 .cse55 .cse56 .cse74 .cse58 .cse75) .cse68) (and .cse63 (and .cse25 .cse73 .cse66 .cse23 .cse0 .cse39) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse43 .cse68 .cse44 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse65 .cse45 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse48 (= 50 ~c_rsp_d~0) .cse49) (and .cse13 .cse20 .cse21) (and .cse72 (and .cse62 .cse26 .cse28 .cse24)) (and (and .cse17 .cse18 (and .cse4 (and (and .cse2 (and .cse12 .cse19 .cse20 .cse16 .cse15)) .cse1))) .cse5) (and .cse63 .cse76 (and (and .cse42 (and (and .cse0 .cse73 .cse6 .cse7) .cse66 .cse23)) .cse57 .cse47 .cse43 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse51 .cse58) .cse65 .cse77 (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse68))))) [2019-11-16 00:44:45,774 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 885) no Hoare annotation was computed. [2019-11-16 00:44:45,774 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 687) no Hoare annotation was computed. [2019-11-16 00:44:45,774 INFO L439 ceAbstractionStarter]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse21 (= ~c_empty_req~0 1)) (.cse14 (<= ~c_m_lock~0 0)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~s_run_st~0)) (.cse13 (= ~s_run_pc~0 2))) (let ((.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse7 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= ~s_memory2~0 52)) (.cse2 (and .cse11 (and .cse21 .cse14 .cse15 .cse16) .cse12 .cse13)) (.cse1 (= 6 ~m_run_pc~0)) (.cse17 (<= 3 ULTIMATE.start_m_run_~a~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse10 (= 3 ~m_run_pc~0)) (.cse18 (<= 2 ~a_t~0)) (.cse19 (<= 2 ~s_run_pc~0)) (.cse20 (not .cse13))) (or (and .cse0 .cse1 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse8 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse9 (= ~a_t~0 1)) (and (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18) (and .cse3 .cse4 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse5 .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (= 0 ~c_req_a~0) .cse2 .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse2 .cse1 .cse17 .cse18) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse19 .cse14 .cse15 .cse20 .cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 (and (and .cse12 (and .cse10 .cse21 .cse14 .cse15 .cse16)) .cse11 .cse13) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse12 .cse19 .cse14 .cse15 .cse20 (<= 3 ~m_run_pc~0) .cse16)))) [2019-11-16 00:44:45,775 INFO L439 ceAbstractionStarter]: At program point L1278(lines 1271 1315) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse22 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse19 (<= ~a_t~0 1)) (.cse17 (<= 1 ~a_t~0)) (.cse35 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse33 (and .cse21 .cse27 .cse24 .cse23 .cse50)) (.cse43 (<= 2 ~c_req_a~0)) (.cse41 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse44 (<= ~c_req_a~0 2)) (.cse3 (<= ~m_run_pc~0 0)) (.cse30 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse40 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse15 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 2 ~a_t~0)) (.cse45 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse46 (= ~s_memory2~0 52)) (.cse32 (<= 1 ~c_req_a~0)) (.cse38 (= ~s_memory0~0 50)) (.cse47 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= 0 ~c_req_type~0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse37 (and .cse21 .cse22 .cse24 .cse23)) (.cse9 (= 6 ~m_run_pc~0)) (.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= ~c_req_a~0 1)) (.cse39 (= ~s_memory1~0 51)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 (let ((.cse12 (and (and .cse21 .cse4 .cse22 .cse23) .cse24))) (or (and (and .cse10 (and .cse11 .cse12)) .cse13 .cse14) (and .cse15 .cse12 .cse16) (and .cse17 .cse18 (and .cse19 .cse20 .cse12))))) (and .cse13 .cse10 (and .cse25 .cse26 (and .cse11 (and .cse21 .cse27 .cse28 .cse5 .cse24))) .cse14) (and .cse13 .cse3 .cse29 .cse10 .cse5 .cse8 .cse30 .cse2 .cse21 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse31 (<= 51 ~c_req_d~0) (and .cse32 .cse33 .cse34) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse19 .cse20 .cse17 .cse35 .cse36 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse29 (and .cse30 .cse37 .cse9)) .cse38 .cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse35 (= ~a_t~0 0) .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse40 (and .cse7 (not .cse23) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse35 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse41 .cse42 .cse15 .cse16 (and .cse43 .cse33 .cse44)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse45 (= ~req_tt_a~0 2) .cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse43 (and (and .cse37 .cse9 .cse15 .cse16) .cse47 .cse29) .cse38 .cse39 .cse41 .cse42 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse48) (and .cse13 .cse3 .cse29 .cse10 .cse8 .cse30 .cse2 .cse21 .cse4 .cse23 .cse6 .cse7) (and .cse4 .cse28 .cse5) (and .cse40 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse25 .cse26 (and .cse13 (and (and .cse11 (and .cse21 .cse27 .cse28 .cse24 .cse23)) .cse10))) .cse14) (and (and .cse49 .cse7 .cse8) .cse21 .cse4 .cse23) (and .cse9 (and (and .cse2 .cse21 .cse4 .cse23 .cse7 .cse8) .cse15 .cse16)) (and .cse45 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse46 (and .cse32 .cse38 (and .cse47 .cse29 (and (and .cse20 .cse37) .cse9 .cse36)) .cse34) .cse39 (= ~req_tt_a~0 1) .cse48 .cse18 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,775 INFO L439 ceAbstractionStarter]: At program point L221(lines 214 267) the Hoare annotation is: (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse1 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= 2 ~s_run_pc~0)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~s_run_st~0)) (.cse24 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse3 (<= 1 ~c_req_type~0)) (.cse4 (<= 0 ~a_t~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse19 (<= ~m_run_pc~0 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse6 (<= ~a_t~0 0)) (.cse25 (= 0 ~s_run_pc~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse23 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse0 (<= ~c_req_d~0 51) .cse1 (<= ULTIMATE.start_m_run_~req_d~0 51) (and .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse5 .cse6 .cse7 .cse8 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) .cse9 .cse10 .cse11 .cse12 .cse13) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse9 .cse7 (not (= ~s_run_pc~0 2)) .cse8 .cse13) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 2 ~c_req_a~0) (and .cse2 .cse3 .cse9 .cse5 .cse7 .cse10 .cse11 .cse12 .cse8 .cse13) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse0 (<= 52 ~c_req_d~0) .cse1 (<= ~c_req_d~0 52) (<= ~c_req_a~0 2)) (and .cse14 .cse15 .cse16 .cse6 (and .cse4 (and .cse17 .cse3 .cse18 .cse19 .cse5 .cse7 .cse8 .cse20 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22)) .cse23 .cse24) (and .cse17 .cse3 .cse18 .cse19 .cse25 .cse8 .cse20 .cse21 .cse9 .cse12 .cse13 .cse24 .cse22) (and .cse14 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse25 .cse8 .cse15 .cse20 .cse21 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse11 .cse12 .cse23 .cse13 .cse22))) [2019-11-16 00:44:45,775 INFO L443 ceAbstractionStarter]: For program point L486(lines 485 837) no Hoare annotation was computed. [2019-11-16 00:44:45,775 INFO L446 ceAbstractionStarter]: At program point L1345(lines 1167 1350) the Hoare annotation is: true [2019-11-16 00:44:45,775 INFO L439 ceAbstractionStarter]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse14 (= ~s_run_pc~0 2)) (.cse43 (<= 1 ~c_req_type~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse4 (<= ~c_req_type~0 1)) (.cse38 (and .cse43 .cse12 .cse13)) (.cse33 (= 3 ~m_run_pc~0)) (.cse34 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse36 (<= ~c_req_a~0 0)) (.cse37 (<= 0 ~c_req_a~0)) (.cse42 (and .cse13 (not .cse14) .cse12))) (let ((.cse5 (= 0 ~s_run_pc~0)) (.cse7 (and .cse36 .cse37 (and .cse42 .cse43))) (.cse23 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (<= ~a_t~0 1)) (.cse29 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse26 (<= ~c_req_d~0 51)) (.cse21 (<= 51 ~c_req_d~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse8 (<= 0 ~a_t~0)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= ~a_t~0 0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (and (and .cse33 .cse34 .cse13) .cse3 .cse11 .cse6 .cse14)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse24 (<= 1 ~a_t~0)) (.cse32 (and .cse3 .cse4 .cse6 .cse14 .cse38)) (.cse39 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (= ~s_memory0~0 50)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse19 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (<= 52 ~c_req_d~0)) (.cse41 (<= ~c_req_d~0 52))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10)) (and .cse3 .cse11 (and .cse12 .cse13) .cse14) (and .cse15 (and .cse16 (= ULTIMATE.start_s_memory_write_~i 1)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse11 .cse5 .cse7) (and .cse2 .cse8 .cse9 .cse28 .cse29 .cse30 .cse0 .cse1 .cse16 .cse25 .cse27 .cse10 .cse31) (and .cse23 (and .cse17 .cse25 .cse29 (and (and .cse28 .cse27 (and .cse8 (and (<= 1 ~c_req_a~0) (<= ~c_req_a~0 1) .cse32)) .cse30 .cse31) .cse26 .cse21)) .cse22) (and (and .cse33 .cse34 .cse13 .cse12) .cse35) (and (and .cse0 .cse1 (and .cse8 (and .cse2 (and .cse3 .cse4 (and .cse36 .cse37 .cse38) .cse6 .cse14)))) .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (= ULTIMATE.start_s_memory_write_~i 2) .cse16) .cse18 (= ~s_memory1~0 51) .cse39 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse25 .cse40 .cse27 .cse41 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0)) (and .cse11 .cse35 .cse42) (and (and (and .cse24 (and (<= 2 ~c_req_a~0) .cse32 (<= ~c_req_a~0 2)) .cse39) .cse15 .cse18 .cse25 .cse19 .cse20 .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1)) .cse40 .cse41))))) [2019-11-16 00:44:45,776 INFO L439 ceAbstractionStarter]: At program point L1213(lines 1206 1232) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-16 00:44:45,776 INFO L439 ceAbstractionStarter]: At program point L817(lines 810 827) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse6 (= 6 ~m_run_pc~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse5 .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (and .cse6 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= ~a_t~0 1)) (and .cse0 (= ~req_tt_a~0 2) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (and .cse1 .cse2 .cse3 (and .cse5 .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,776 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 623) no Hoare annotation was computed. [2019-11-16 00:44:45,776 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-16 00:44:45,776 INFO L439 ceAbstractionStarter]: At program point L421(lines 414 458) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse1 (and (<= 2 ~c_write_req_ev~0) .cse4 .cse7 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse6 .cse8))) (.cse0 (= ~s_memory0~0 50)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 (and .cse5 .cse6 (not .cse7) .cse8) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (<= 0 ~a_t~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1)) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse1 (<= ~a_t~0 1)) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse2 (<= ~c_req_d~0 51) .cse3)))) [2019-11-16 00:44:45,777 INFO L439 ceAbstractionStarter]: At program point L355(lines 348 374) the Hoare annotation is: (let ((.cse4 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~s_memory0~0 50)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 51) .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,777 INFO L443 ceAbstractionStarter]: For program point L289(lines 288 316) no Hoare annotation was computed. [2019-11-16 00:44:45,777 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2019-11-16 00:44:45,777 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 227) no Hoare annotation was computed. [2019-11-16 00:44:45,778 INFO L439 ceAbstractionStarter]: At program point L950(lines 943 960) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (<= ~c_req_type~0 1)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse32 (= ~s_run_pc~0 2)) (.cse13 (= 3 ~m_run_pc~0)) (.cse17 (<= 1 ~c_req_type~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse22 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse27 (and .cse11 .cse18 .cse12 .cse21 .cse32 (and .cse13 .cse17 .cse16 .cse19 .cse20) .cse22)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= 1 ~c_req_a~0)) (.cse6 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 6 ~m_run_pc~0)) (.cse4 (and (and .cse16 .cse19 (<= 3 ~m_run_pc~0) .cse20) .cse11 .cse21 .cse32)) (.cse2 (= 0 ~c_req_type~0)) (.cse29 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~s_memory2~0 52)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 (and (= 0 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and .cse11 .cse12 (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~s_run_pc~0) .cse5 .cse19 .cse20) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~s_run_pc~0) .cse5 .cse19 .cse20))) .cse21 .cse22)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse0 (= ~req_tt_a~0 2) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse23 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and .cse1 .cse2 (and .cse4 .cse3 .cse24 .cse25)) .cse26 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse8) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse23 .cse27 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse26) .cse24 .cse25) .cse6 .cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (and .cse28 .cse27 (= 1 ULTIMATE.start_s_run_~req_a~1) .cse29) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (<= ~a_t~0 1) .cse30 (<= 1 ~a_t~0) .cse31) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse28 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse1 (and .cse3 .cse4) .cse2) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29) .cse7 (= ~req_tt_a~0 1) .cse8 .cse31 .cse9 .cse30 (= ~a_t~0 1))))) [2019-11-16 00:44:45,778 INFO L443 ceAbstractionStarter]: For program point L818(lines 810 827) no Hoare annotation was computed. [2019-11-16 00:44:45,778 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-11-16 00:44:45,778 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2019-11-16 00:44:45,778 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2019-11-16 00:44:45,778 INFO L443 ceAbstractionStarter]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2019-11-16 00:44:45,779 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 823) no Hoare annotation was computed. [2019-11-16 00:44:45,779 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2019-11-16 00:44:45,779 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-16 00:44:45,779 INFO L443 ceAbstractionStarter]: For program point L952(lines 952 956) no Hoare annotation was computed. [2019-11-16 00:44:45,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:44:45,779 INFO L439 ceAbstractionStarter]: At program point L689(lines 682 726) the Hoare annotation is: (let ((.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 6 ~m_run_pc~0)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~s_memory2~0 52))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) .cse6 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse8 (= 51 ~c_rsp_d~0) (<= ULTIMATE.start_s_memory_read_~i 1) (= ~a_t~0 1)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (and (= 0 ~c_req_a~0) .cse6 .cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 (= ~req_tt_a~0 2) (and (and .cse6 .cse5 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1 .cse2 .cse3) (= 52 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)))) [2019-11-16 00:44:45,780 INFO L439 ceAbstractionStarter]: At program point L557(lines 527 558) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2))) (let ((.cse3 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= 2 ~s_run_pc~0)) (.cse19 (not .cse9)) (.cse14 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse11 (and .cse4 .cse7 (and .cse5 .cse6) .cse8 .cse9)) (.cse12 (= 6 ~m_run_pc~0)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse2 (= ~s_memory1~0 51)) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~s_memory2~0 52))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (and .cse3 (and .cse4 (and (= 3 ~m_run_pc~0) .cse5 .cse6) .cse7 .cse8 .cse9)) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (and .cse11 .cse12) .cse13 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse14 .cse15 .cse0 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse2 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse16 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse17 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1)) (and .cse3 .cse7 .cse18 .cse19 .cse5 .cse6 .cse10) (and .cse7 .cse18 (and .cse19 .cse5 .cse6 (<= 3 ~m_run_pc~0))) (and .cse14 (and (= 0 ~c_req_a~0) .cse11 .cse12 (= 0 ULTIMATE.start_s_run_~req_a~1)) .cse15 (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse0 .cse1 .cse2 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse16 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse17 (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0))))) [2019-11-16 00:44:45,780 INFO L443 ceAbstractionStarter]: For program point L756(lines 756 809) no Hoare annotation was computed. [2019-11-16 00:44:45,780 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 761) no Hoare annotation was computed. [2019-11-16 00:44:45,780 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 695) no Hoare annotation was computed. [2019-11-16 00:44:45,781 INFO L439 ceAbstractionStarter]: At program point L625(lines 618 635) the Hoare annotation is: (let ((.cse6 (<= 2 ~s_run_st~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~s_run_pc~0 2))) (let ((.cse2 (<= 0 ~a_t~0)) (.cse1 (and .cse6 (and .cse5 .cse3) (<= 1 ~c_m_lock~0) .cse4)) (.cse0 (<= 1 ~a_t~0))) (or (and (<= 1 ULTIMATE.start_m_run_~a~0) (or (and (<= ~a_t~0 1) .cse0 .cse1) (and .cse2 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~a_t~0 0) .cse1))) (and .cse2 (and .cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse3 (not .cse4) .cse5) .cse6 (<= 2 ~s_run_pc~0)) (and .cse1 .cse0 (<= 2 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:44:45,781 INFO L439 ceAbstractionStarter]: At program point L1286(lines 1279 1314) the Hoare annotation is: (let ((.cse49 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse22 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse50 (and .cse49 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse19 (<= ~a_t~0 1)) (.cse17 (<= 1 ~a_t~0)) (.cse35 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse33 (and .cse21 .cse27 .cse24 .cse23 .cse50)) (.cse43 (<= 2 ~c_req_a~0)) (.cse41 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse42 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse44 (<= ~c_req_a~0 2)) (.cse3 (<= ~m_run_pc~0 0)) (.cse30 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse40 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (and .cse0 .cse1 .cse50)) (.cse10 (<= ~a_t~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse15 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 2 ~a_t~0)) (.cse45 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse46 (= ~s_memory2~0 52)) (.cse32 (<= 1 ~c_req_a~0)) (.cse38 (= ~s_memory0~0 50)) (.cse47 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= 0 ~c_req_type~0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse37 (and .cse21 .cse22 .cse24 .cse23)) (.cse9 (= 6 ~m_run_pc~0)) (.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= ~c_req_a~0 1)) (.cse39 (= ~s_memory1~0 51)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 (let ((.cse12 (and (and .cse21 .cse4 .cse22 .cse23) .cse24))) (or (and (and .cse10 (and .cse11 .cse12)) .cse13 .cse14) (and .cse15 .cse12 .cse16) (and .cse17 .cse18 (and .cse19 .cse20 .cse12))))) (and .cse13 .cse10 (and .cse25 .cse26 (and .cse11 (and .cse21 .cse27 .cse28 .cse5 .cse24))) .cse14) (and .cse13 .cse3 .cse29 .cse10 .cse5 .cse8 .cse30 .cse2 .cse21 .cse6 .cse7) (and (and (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse31 (<= 51 ~c_req_d~0) (and .cse32 .cse33 .cse34) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse19 .cse20 .cse17 .cse35 .cse36 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (and .cse29 (and .cse30 .cse37 .cse9)) .cse38 .cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ~req_tt_a~0 0) .cse35 (= ~a_t~0 0) .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 .cse40 (and .cse7 (not .cse23) .cse8)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse35 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse41 .cse42 .cse15 .cse16 (and .cse43 .cse33 .cse44)) (<= 52 ~c_req_d~0) (<= ~c_req_d~0 52)) (and .cse45 (= ~req_tt_a~0 2) .cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (and .cse43 (and (and .cse37 .cse9 .cse15 .cse16) .cse47 .cse29) .cse38 .cse39 .cse41 .cse42 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse48) (and .cse13 .cse3 .cse29 .cse10 .cse8 .cse30 .cse2 .cse21 .cse4 .cse23 .cse6 .cse7) (and .cse4 .cse28 .cse5) (and .cse40 (and .cse49 .cse2 .cse7 .cse8)) (and (and .cse25 .cse26 (and .cse13 (and (and .cse11 (and .cse21 .cse27 .cse28 .cse24 .cse23)) .cse10))) .cse14) (and (and .cse49 .cse7 .cse8) .cse21 .cse4 .cse23) (and .cse9 (and (and .cse2 .cse21 .cse4 .cse23 .cse7 .cse8) .cse15 .cse16)) (and .cse45 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse46 (and .cse32 .cse38 (and .cse47 .cse29 (and (and .cse20 .cse37) .cse9 .cse36)) .cse34) .cse39 (= ~req_tt_a~0 1) .cse48 .cse18 (= ~a_t~0 1)))))) [2019-11-16 00:44:45,782 INFO L439 ceAbstractionStarter]: At program point L229(lines 222 266) the Hoare annotation is: (let ((.cse11 (<= 2 ~s_run_st~0)) (.cse7 (<= ~c_req_type~0 1)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse4 (<= 1 ~c_req_type~0)) (.cse15 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse3 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (and .cse11 .cse7 .cse12 .cse13 .cse14 (and (= 3 ~m_run_pc~0) .cse4 .cse15 .cse8 .cse16))) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse18 (<= 0 ~a_t~0)) (.cse5 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (<= ~m_run_pc~0 0)) (.cse19 (<= ~a_t~0 0)) (.cse22 (= 0 ~s_run_pc~0)) (.cse1 (<= ~c_req_d~0 50)) (.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse2 (<= 50 ~c_req_d~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse15 .cse16 .cse21 .cse17) (and (and (not .cse14) .cse8 .cse16) .cse11 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 52 ULTIMATE.start_m_run_~req_d~0) (and .cse23 (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (<= ~a_t~0 1) (<= 1 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ~c_req_a~0 2)) .cse24 (<= 52 ~c_req_d~0) .cse25 (<= ~c_req_d~0 52)) (and .cse18 .cse19 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse23 (<= ~c_req_a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse24 (<= ~c_req_d~0 51) .cse25 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse22 .cse8 .cse1 .cse9 .cse10 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse13 .cse15 .cse20 .cse16 .cse17)))) [2019-11-16 00:44:45,782 INFO L443 ceAbstractionStarter]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2019-11-16 00:44:45,782 INFO L443 ceAbstractionStarter]: For program point L626(lines 618 635) no Hoare annotation was computed. [2019-11-16 00:44:45,782 INFO L439 ceAbstractionStarter]: At program point L1221(lines 1214 1231) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1)) (.cse0 (<= ~m_run_pc~0 0)) (.cse1 (= 0 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse0 (<= 2 ~s_run_st~0) .cse1 .cse4 .cse5 .cse2))) [2019-11-16 00:44:45,782 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 631) no Hoare annotation was computed. [2019-11-16 00:44:45,783 INFO L439 ceAbstractionStarter]: At program point L429(lines 422 457) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse1 (and (<= 2 ~c_write_req_ev~0) .cse4 .cse7 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse6 .cse8))) (.cse0 (= ~s_memory0~0 50)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse4 (and .cse5 .cse6 (not .cse7) .cse8) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (<= 0 ~a_t~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1)) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse1 (<= ~a_t~0 1)) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse2 (<= ~c_req_d~0 51) .cse3)))) [2019-11-16 00:44:45,783 INFO L439 ceAbstractionStarter]: At program point L495-2(lines 495 523) the Hoare annotation is: (let ((.cse15 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (<= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse12 (= ~s_memory1~0 51)) (.cse6 (= 6 ~m_run_pc~0)) (.cse7 (and .cse15 .cse0 .cse16 (and .cse17 .cse18 .cse4 .cse2))) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~s_memory2~0 52)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse16))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0) .cse4) (and .cse5 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and .cse6 .cse7) (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse8 .cse9 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 1)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (and .cse15 .cse0 .cse16 (and (= 3 ~m_run_pc~0) .cse17 .cse18 .cse4 .cse2)) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse8 .cse9 (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse10 .cse11 .cse12 (and (= 0 ~c_req_a~0) .cse6 .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1)) (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0)) (and .cse0 .cse1 (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse18 .cse2 .cse3 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0)))))) [2019-11-16 00:44:45,784 INFO L439 ceAbstractionStarter]: At program point L363(lines 356 373) the Hoare annotation is: (let ((.cse4 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse1 (= ~s_memory0~0 50)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and (<= ~a_t~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~s_memory1~0 51) .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse2 (<= 52 ~c_req_d~0) .cse3 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ~a_t~0 0) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-16 00:44:45,784 INFO L443 ceAbstractionStarter]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2019-11-16 00:44:45,784 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 235) no Hoare annotation was computed. [2019-11-16 00:44:45,784 INFO L443 ceAbstractionStarter]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2019-11-16 00:44:45,784 INFO L443 ceAbstractionStarter]: For program point L496(lines 495 523) no Hoare annotation was computed. [2019-11-16 00:44:45,784 INFO L443 ceAbstractionStarter]: For program point L364(lines 134 480) no Hoare annotation was computed. [2019-11-16 00:44:45,785 INFO L443 ceAbstractionStarter]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2019-11-16 00:44:45,785 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 501) no Hoare annotation was computed. [2019-11-16 00:44:45,785 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-11-16 00:44:45,785 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-16 00:44:45,785 INFO L439 ceAbstractionStarter]: At program point L1026(lines 1000 1027) the Hoare annotation is: (let ((.cse29 (= 3 ~m_run_pc~0)) (.cse30 (= ~c_empty_req~0 1)) (.cse32 (<= 2 ~c_write_rsp_ev~0)) (.cse37 (= ~c_empty_rsp~0 1)) (.cse26 (<= 2 ~c_write_req_ev~0)) (.cse27 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse21 (<= ~c_req_d~0 50)) (.cse22 (<= 50 ~c_req_d~0)) (.cse33 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse25 (<= ~a_t~0 0)) (.cse23 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse24 (<= 0 ~a_t~0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse35 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse36 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and (and .cse29 .cse30 .cse32 .cse37) .cse26 .cse27 .cse31)) (.cse6 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= 2 ~a_t~0)) (.cse2 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse16 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= ~s_memory1~0 51)) (.cse12 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse1 (= ~s_memory2~0 52)) (.cse5 (= 6 ~m_run_pc~0)) (.cse13 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse4 (and .cse30 .cse26 .cse27 .cse31 .cse32 .cse37)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory0~0 50)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_a~1 1))) (or (and .cse0 (= ~req_tt_a~0 2) .cse1 (and (<= 2 ~c_req_a~0) .cse2 .cse3 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (and (and (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) .cse10) .cse11 (<= ~c_req_a~0 2)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse12) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and (and (<= ~a_t~0 1) .cse13 .cse14) (<= 1 ~a_t~0) .cse15) .cse10 .cse16 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse17 .cse18 .cse19 (<= 51 ~c_req_d~0)) (and .cse20 (and .cse21 .cse22 (and .cse23 .cse24 .cse25 (and (<= 1 ~c_req_type~0) .cse26 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse27 (let ((.cse28 (and .cse29 .cse30 (not .cse31) .cse32))) (or (and .cse28 (<= 2 ~s_run_pc~0)) (and .cse28 (= 0 ~s_run_pc~0)))) (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse16 .cse33 .cse18 .cse34 .cse35) .cse36) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse3 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (and .cse8 .cse9 (and (= 0 ~c_req_a~0) .cse5 .cse4 .cse20)) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0)) (and .cse21 .cse22 .cse16 .cse33 .cse18 (and .cse25 (and .cse23 .cse24 .cse14)) .cse20 .cse34 .cse35 .cse36) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and (and .cse14 .cse6 .cse7) .cse2 .cse10 .cse16 .cse3 .cse11) (<= 52 ~c_req_d~0) .cse18 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52)) (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse12 .cse15 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (and (<= 1 ~c_req_a~0) (and (and .cse5 (and .cse13 .cse4)) .cse8 .cse9) .cse10 .cse17 .cse19 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~a_t~0 1))))) [2019-11-16 00:44:45,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:44:45 BoogieIcfgContainer [2019-11-16 00:44:45,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:44:45,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:45,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:45,980 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:45,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:41:15" (3/4) ... [2019-11-16 00:44:45,984 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:44:46,006 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:44:46,007 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:44:46,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && a_t <= 0) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1)) || (((((a_t <= 1 && a <= 1) && 1 <= a_t) && i == req_a) && ((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((52 <= req_d && ((((((req_a <= 2 && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && (a <= 1 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && a_t == 1)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((((52 <= v && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((((((52 <= v && req_tt_a == 2) && (((((((s_memory0 == 50 && ((((6 == m_run_pc && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && 2 <= c_req_a) && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) [2019-11-16 00:44:46,038 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && a_t <= 0) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1)) || (((((a_t <= 1 && a <= 1) && 1 <= a_t) && i == req_a) && ((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a)) || ((((((52 <= req_d && ((((((req_a <= 2 && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && (a <= 1 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && a_t == 1)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((((52 <= v && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((((((52 <= v && req_tt_a == 2) && (((((((s_memory0 == 50 && ((((6 == m_run_pc && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && 2 <= c_req_a) && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) [2019-11-16 00:44:46,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a <= 1 && 1 <= a_t) && i == req_a) && (((((((((a_t <= 1 && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) || ((((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && (((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 0 == req_a) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((((((52 <= req_d && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && ((((((req_a <= 2 && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= a) && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 2 <= a_t) && 2 <= req_a)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && v <= 52)) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && ((((((1 <= c_req_a && ((6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a_t == 1)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || ((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && a == 0) && 0 <= a_t) && a_t <= 0)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && 0 <= a_t) && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) [2019-11-16 00:44:46,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && ((((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) || ((((((((((51 <= req_d && (((a_t <= 1 && a <= 1) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a_t) && 1 <= a) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || ((0 == req_a && ((((((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && (((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) || ((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 0 == s_run_pc))) && req_type <= 1) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && 6 == m_run_pc) && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && a == 0) && 50 == x) && req_tt_a == 0) && a_t == 0)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && a_t <= 0 && (a <= 0 && 0 <= a_t) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((52 <= req_d && s_memory2 == req_d) && ((((((((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_a <= 2) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((6 == m_run_pc && a <= 1 && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a_t == 1) [2019-11-16 00:44:46,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 == c_req_type && 6 == m_run_pc) && req_tt_a == 1) && 51 == rsp_d) && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 51 == c_rsp_d) && a == 2) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1) || ((((((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 3 <= a) && 2 <= a_t)) || (((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && v <= 52) && 1 <= a) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 3 <= a) && 2 <= a_t)) || (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((2 <= s_run_st && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((2 <= s_run_st && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-11-16 00:44:46,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= c_write_req_ev && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a_t) || (((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || (((((((((((52 <= v && 1 <= c_req_a) && s_memory2 == 52) && req_type == 0) && (6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 == req_a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && c_req_a <= 1) && a_t == 1)) || ((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || (6 == m_run_pc && 0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock)) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1) && i <= 1)) || ((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && ((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && 2 <= a_t) && c_req_a <= 2) && i <= 1)) || ((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && s_memory1 == 51) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || (((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && 2 <= i) && 2 <= req_a) && ((req_type == 0 && 0 == c_req_type) && (6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) [2019-11-16 00:44:46,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && ((c_empty_req == 1 && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1)) || (((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && ((c_empty_req == 1 && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 == req_a) && req_a___0 <= 1) && v <= 52) && 1 <= a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && 2 <= s_run_pc) && (a <= 0 && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) [2019-11-16 00:44:46,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && (((((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && 1 <= a) && ((0 == c_req_a && ((((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || (((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && a <= 0) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a) [2019-11-16 00:44:46,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((52 <= req_d && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && ((((req_a <= 2 && ((1 == c_write_rsp_ev && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= req_a) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || ((((((((((((1 == c_write_rsp_ev && 1 <= a) && ((a_t <= 1 && a <= 1) && 1 <= a_t) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 51 <= req_d) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 1 == c_write_rsp_ev) && 50 <= req_d) && req_d <= 50) && 0 == req_a) && 0 <= a)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 1 == c_write_rsp_ev && 0 <= a_t && (a <= 0 && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a) [2019-11-16 00:44:46,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((52 <= v && ((0 == c_req_a && 6 == m_run_pc) && 0 == req_a) && (((2 <= c_write_req_ev && ((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && 1 <= a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && 6 == m_run_pc && 2 <= a && (((2 <= c_write_req_ev && ((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 1)) || (((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && a <= 0 && ((((((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) [2019-11-16 00:44:46,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((52 <= req_d && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && ((((req_a <= 2 && ((1 == c_write_rsp_ev && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= req_a) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || ((((((((((((1 == c_write_rsp_ev && 1 <= a) && ((a_t <= 1 && a <= 1) && 1 <= a_t) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 51 <= req_d) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 1 == c_write_rsp_ev) && 50 <= req_d) && req_d <= 50) && 0 == req_a) && 0 <= a)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 1 == c_write_rsp_ev && 0 <= a_t && (a <= 0 && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a) [2019-11-16 00:44:46,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a) || (((((((((((((((((((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1)) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || ((((((((((((((((((52 <= v && ((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && 1 <= a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) [2019-11-16 00:44:46,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a) [2019-11-16 00:44:46,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && (((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 == c_write_rsp_ev) && 1 <= i) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_st == 0) && 3 <= m_run_pc) && s_run_pc == 2) && 0 == c_req_type) && i <= 1) && a_t == 1) || ((((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && ((((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_st == 0) && 3 <= m_run_pc) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a)) || (((((((((((((((((((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 1 == c_write_rsp_ev) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 1 <= a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && 0 <= a_t && (a <= 0 && (((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t <= 0) && s_memory0 == req_d) && v == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) && ((((((2 <= c_req_a && req_a <= 2) && (s_memory0 == 50 && 1 == c_write_rsp_ev) && (req_type == 0 && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_st == 0) && 3 <= m_run_pc) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && 0 == c_req_type) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((req_a <= 2 && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 1 == c_write_rsp_ev) && (((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && 52 <= req_d) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) [2019-11-16 00:44:46,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a) [2019-11-16 00:44:46,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a) [2019-11-16 00:44:46,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= c_write_req_ev && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (2 <= c_req_a && (((((((req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && v <= 52)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((1 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a)) || ((((((52 <= v && s_memory2 == 52) && 2 == req_a___0) && (2 <= c_req_a && (((((((req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && v <= 52) && a == 2) && a_t == 1)) || (((((0 <= a_t && a <= 1) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock) || ((a_t <= 1 && 1 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock)) && 1 <= a)) || ((((((((((((((((((((1 == req_a___0 && 52 <= v) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && a <= 1) && 6 == m_run_pc) && 1 <= a) && 51 == c_rsp_d) && i <= 1) && a_t == 1)) || ((((52 <= req_d && s_memory2 == req_d) && ((req_a <= 2 && i == req_a) && (a == 0 && ((0 == c_req_type && 0 == c_req_a && 0 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && 0 == req_a___0) && s_memory1 == 51) && 2 <= req_a) && v == req_d) && req_d <= 52)) || (((a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a)) || (((52 <= v && s_memory2 == 52) && ((((1 == req_a___0 && s_memory1 == 51) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (6 == m_run_pc && 0 == req_a) && ((((0 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && a_t <= 0) || (((a_t <= 1 && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 1 <= a_t))) && s_memory0 == 50) && c_req_a <= 1) && req_tt_a == 1) || (((1 == req_a___0 && s_memory1 == 51) && a_t == 0) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (6 == m_run_pc && 0 == req_a) && ((((0 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && a_t <= 0) || (((a_t <= 1 && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 1 <= a_t))) && s_memory0 == 50) && c_req_a <= 1)) && 1 <= a) && v <= 52)) || ((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && (((0 == c_req_a && 0 <= a_t) && 6 == m_run_pc) && ((((((a <= 0 && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && a_t <= 0) && 0 == req_a) && 0 <= a)) || ((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((1 == req_a___0 && 52 <= v) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && ((a <= 1 && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && (((((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && s_memory1 == 51) && v <= 52) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 0 == c_req_a) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) [2019-11-16 00:44:46,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && a <= 1) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0) && (((((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 2 <= c_req_a) && 51 == c_rsp_d) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && 6 == m_run_pc && (((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 2 <= a) && a_t == 1) && c_req_a <= 2)) || (((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && a <= 0 && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && v == req_d) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) [2019-11-16 00:44:46,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a == 1) && 51 == x) && s_memory1 == 51) && 51 == \result) && v <= 52) && req_tt_a == 1) && a_t == 1) || (((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == x) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && v <= 52)) || ((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && (((((0 == c_req_a && ((a <= 0 && 0 <= a_t) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && i == 0) && 0 == req_a) && 0 <= a) [2019-11-16 00:44:46,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0)) || (((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && ((2 <= s_run_st && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) [2019-11-16 00:44:46,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((52 <= req_d && 0 <= a_t && (((((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0) [2019-11-16 00:44:46,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((52 <= req_d && 0 <= a_t && (((((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0) [2019-11-16 00:44:46,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((52 <= req_d && 0 <= a_t && (((((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0)) || (((((((((((((((((((((((6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2) [2019-11-16 00:44:46,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 51 == rsp_d) && 51 == c_rsp_d) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && s_memory1 == 51) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && a <= 0 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) [2019-11-16 00:44:46,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && (6 == m_run_pc && a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && ((0 == c_req_a && 6 == m_run_pc) && 0 == req_a) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && (((((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-11-16 00:44:46,050 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) || ((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && req_a___0 + 50 == rsp_d___0) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || ((((((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((2 <= s_run_st && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-11-16 00:44:46,180 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4285856b-6b42-4f2d-99da-bc86f46d4c1d/bin/uautomizer/witness.graphml [2019-11-16 00:44:46,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:46,182 INFO L168 Benchmark]: Toolchain (without parser) took 212585.80 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 946.2 MB in the beginning and 1.6 GB in the end (delta: -698.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,182 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:46,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.25 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,183 INFO L168 Benchmark]: Boogie Preprocessor took 56.47 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,184 INFO L168 Benchmark]: RCFGBuilder took 1336.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,184 INFO L168 Benchmark]: TraceAbstraction took 210301.56 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -712.6 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,184 INFO L168 Benchmark]: Witness Printer took 200.80 ms. Allocated memory is still 4.2 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 88.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:46,186 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.25 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.47 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1336.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 210301.56 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -712.6 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 200.80 ms. Allocated memory is still 4.2 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 88.4 MB). Peak memory consumption was 88.4 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 - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 5 specifications checked. All of them hold - InvariantResult [Line: 1167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a) - InvariantResult [Line: 1236]: Loop Invariant Derived loop invariant: ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1 - InvariantResult [Line: 1214]: Loop Invariant Derived loop invariant: ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && a_t == 0) || (a_t <= 0 && (((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && 0 <= a_t) && (((2 <= c_write_req_ev && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && req_a <= 2) && s_memory0 == 50) && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && i <= 1) && v <= 52)) || ((((52 <= req_d && (((v <= 51 && ((((2 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 2 == req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((50 <= v && v <= 50) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && ((1 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 == req_a) && c_req_a <= 1) && req_d <= 51) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || (((((((((52 <= v && 1 == req_a___0) && ((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && s_memory2 == 52) && a <= 1) && a_t == 1) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && a_t <= 0) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1)) || (((((a_t <= 1 && a <= 1) && 1 <= a_t) && i == req_a) && ((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a)) || ((((((52 <= req_d && ((((((req_a <= 2 && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && (a <= 1 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && a_t == 1)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((((52 <= v && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((((((52 <= v && req_tt_a == 2) && (((((((s_memory0 == 50 && ((((6 == m_run_pc && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && 2 <= c_req_a) && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1 - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && a_t == 0) || (a_t <= 0 && (((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && 0 <= a_t) && (((2 <= c_write_req_ev && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && req_a <= 2) && s_memory0 == 50) && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && i <= 1) && v <= 52)) || ((((52 <= req_d && (((v <= 51 && ((((2 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 2 == req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((50 <= v && v <= 50) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && ((1 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 == req_a) && c_req_a <= 1) && req_d <= 51) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || (((((((((52 <= v && 1 == req_a___0) && ((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && s_memory2 == 52) && a <= 1) && a_t == 1) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 1 <= a_t && (a_t <= 1 && a <= 1) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && c_req_d <= 51) && 51 <= c_req_d) && 1 <= a) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && (((((2 <= c_req_a && s_memory0 == 50) && 0 == c_req_type && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory1 == 51) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && v <= 52)) || (((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && a <= 1) && ((1 <= c_req_a && s_memory0 == 50) && ((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1)) || (((((((((52 <= v && s_memory2 == 52) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && ((0 == c_req_a && 6 == m_run_pc) && a <= 0 && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && v <= 52) && 0 == req_a___0) && 0 <= a)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && (((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && a == 0) && 0 <= a_t) && a_t <= 0)) || ((((((v <= 51 && (((((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: ((((((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && (((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 == c_write_rsp_ev) && 1 <= i) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_st == 0) && 3 <= m_run_pc) && s_run_pc == 2) && 0 == c_req_type) && i <= 1) && a_t == 1) || ((((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && ((((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_st == 0) && 3 <= m_run_pc) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a)) || (((((((((((((((((((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 1 == c_write_rsp_ev) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 1 <= a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && 0 <= a_t && (a <= 0 && (((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t <= 0) && s_memory0 == req_d) && v == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) && ((((((2 <= c_req_a && req_a <= 2) && (s_memory0 == 50 && 1 == c_write_rsp_ev) && (req_type == 0 && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_st == 0) && 3 <= m_run_pc) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && 0 == c_req_type) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((req_a <= 2 && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 1 == c_write_rsp_ev) && (((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && m_run_st == 0)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && 52 <= req_d) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && a <= 1) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0) && (((((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 2 <= c_req_a) && 51 == c_rsp_d) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && 6 == m_run_pc && (((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 2 <= a) && a_t == 1) && c_req_a <= 2)) || (((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && a <= 0 && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && v == req_d) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((50 <= v && v <= 50) && 1 <= a_t && (a_t <= 1 && a <= 1) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && c_req_d <= 51) && 51 <= c_req_d) && 1 <= a) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && (((((2 <= c_req_a && s_memory0 == 50) && 0 == c_req_type && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory1 == 51) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && v <= 52)) || (((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && a <= 1) && ((1 <= c_req_a && s_memory0 == 50) && ((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && a_t <= 0) && a <= 0 && (((((c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || (((((((((52 <= v && s_memory2 == 52) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && ((0 == c_req_a && 6 == m_run_pc) && a <= 0 && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && v <= 52) && 0 == req_a___0) && 0 <= a)) || ((((((v <= 51 && (((((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0)) || (((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && ((2 <= s_run_st && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a) || (((((((((((((((((((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1)) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || ((((((((((((((((((52 <= v && ((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && 1 <= a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) - InvariantResult [Line: 494]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && (((((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && 1 <= a) && ((0 == c_req_a && ((((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || (((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && a <= 0) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory0 == req_d && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && a <= 1) && i == req_a) && c_req_d <= 51) && v == req_d) && req_d <= 51) && ((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && req_d <= 50) || ((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((51 <= req_d && 2 <= req_a) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && req_a <= 2) && 52 <= req_d) && 2 <= c_req_a) && ((((((((3 == m_run_pc && 1 <= c_req_type) && 2 <= s_run_st) && c_req_type <= 1) && 2 <= s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && a <= 2) && 1 <= a_t) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && c_req_a <= 2)) || ((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && a_t <= 0) && 0 <= a_t && (((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 50 <= req_d) && 0 <= a)) || ((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 1263]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock)))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 747]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && (6 == m_run_pc && a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && ((0 == c_req_a && 6 == m_run_pc) && 0 == req_a) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && (((((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 1271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock)))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && a_t == 0) || (a_t <= 0 && (((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && 0 <= a_t) && (((2 <= c_write_req_ev && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && req_a <= 2) && s_memory0 == 50) && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && i <= 1) && v <= 52)) || ((((52 <= req_d && (((v <= 51 && ((((2 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 2 == req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((50 <= v && v <= 50) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && ((1 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 == req_a) && c_req_a <= 1) && req_d <= 51) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || (((((((((52 <= v && 1 == req_a___0) && ((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && s_memory2 == 52) && a <= 1) && a_t == 1) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 == req_a___0 && 52 <= v) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && ((a <= 1 && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && (((((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && s_memory1 == 51) && v <= 52) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 0 == c_req_a) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a == 1) && 51 == x) && s_memory1 == 51) && 51 == \result) && v <= 52) && req_tt_a == 1) && a_t == 1) || (((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == x) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && v <= 52)) || ((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && (((((0 == c_req_a && ((a <= 0 && 0 <= a_t) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && i == 0) && 0 == req_a) && 0 <= a) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((51 <= req_d && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && (((((2 <= req_a && a <= 2) && a_t <= 1) && 1 <= a_t) && 2 <= a) && req_a <= 2) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_type) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 52 <= req_d) && i == req_a) && c_req_d <= 51) && v == req_d) || ((((((((((((((((req_a <= 1 && (((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_type) && 1 <= req_a) && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 51 <= req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a <= 1) && i == req_a) && v == req_d) && req_d <= 51) && req_d <= 50)) || (((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((2 <= s_run_st && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc)) || (((((((req_d <= 50 && 0 == c_req_a) && 0 <= a_t) && 0 == c_req_type) && ((((((((((a <= 0 && 2 <= c_write_req_ev) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 2 <= s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= req_a) && a_t <= 0) && 50 <= req_d) && 0 <= a) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && (((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && 0 <= a) || ((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((51 <= req_d && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 52 <= req_d) && ((((((((((((2 <= s_run_st && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && 1 <= req_type) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_req_a) && 2 <= req_a) && a <= 2) && a_t <= 1) && 1 <= a_t) && 2 <= a) && req_a <= 2) && c_req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52)) || ((((((((((((0 <= a_t && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && 50 <= req_d) && (((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && a <= 1) && ((((2 <= s_run_st && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && 1 <= req_type) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && c_req_a <= 1) && 1 <= a) && i == req_a) && c_req_d <= 51) && v == req_d) && req_d <= 51) && req_d <= 50)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && a_t == 0) || (a_t <= 0 && (((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && 0 <= a_t) && (((2 <= c_write_req_ev && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && req_a <= 2) && s_memory0 == 50) && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && i <= 1) && v <= 52)) || ((((52 <= req_d && (((v <= 51 && ((((2 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 2 == req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((50 <= v && v <= 50) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && ((1 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 == req_a) && c_req_a <= 1) && req_d <= 51) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || (((((((((52 <= v && 1 == req_a___0) && ((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && s_memory2 == 52) && a <= 1) && a_t == 1) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0 == c_req_type && 6 == m_run_pc) && req_tt_a == 1) && 51 == rsp_d) && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 51 == c_rsp_d) && a == 2) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1) || ((((((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 3 <= a) && 2 <= a_t)) || (((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && v <= 52) && 1 <= a) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 3 <= a) && 2 <= a_t)) || (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((2 <= s_run_st && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((2 <= s_run_st && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: ((((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) || ((((((((((((51 <= req_d && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && (a_t <= 1 && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d)) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && a <= 0 && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((a <= 1 && 1 <= a_t) && i == req_a) && (((((((((a_t <= 1 && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) || ((((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && (((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 0 == req_a) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((((((52 <= req_d && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && ((((((req_a <= 2 && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= a) && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 2 <= a_t) && 2 <= req_a)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && v <= 52)) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && ((((((1 <= c_req_a && ((6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a_t == 1)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || ((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && a == 0) && 0 <= a_t) && a_t <= 0)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && 0 <= a_t) && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((((((((((a_t <= 1 && a <= 1) && 1 <= a_t) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && ((((((((3 == m_run_pc && a <= 0) && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((52 <= req_d && 0 <= a_t && (((((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0) - InvariantResult [Line: 1351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((a_t <= 1 && a <= 1) && 1 <= a_t) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && ((((((((3 == m_run_pc && a <= 0) && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((52 <= req_d && 0 <= a_t && (((((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((((((((((((((51 <= req_d && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && a_t <= 1 && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && v == req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || (((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) || ((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && req_a___0 + 50 == rsp_d___0) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || ((((((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((2 <= s_run_st && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 1279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock)))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && ((0 <= a_t && a_t <= 0) && (req_a <= 1 && 1 <= req_a) && (((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= a) && a <= 1) && i == req_a) && s_memory0 == req_d) && v == req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) && 50 <= req_d) && req_d <= 50)) || (((((((req_d <= 50 && (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && req_type <= 1) && 2 <= s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= req_a) && 0 == c_req_a) && a == 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 50 <= req_d)) || ((((((((((a <= 0 && c_empty_req == 1) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((((2 <= req_a && a <= 2) && a_t <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= a) && req_a <= 2) && 51 <= req_d) && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 52 <= req_d) && i == req_a) && c_req_d <= 51) && v == req_d)) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 1287]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a) && 2 <= a_t)))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && a_t == 0) || (a_t <= 0 && (((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && 0 <= a_t) && (((2 <= c_write_req_ev && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && req_a <= 2) && s_memory0 == 50) && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && i <= 1) && v <= 52)) || ((((52 <= req_d && (((v <= 51 && ((((2 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 2 == req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((50 <= v && v <= 50) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && ((1 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 == req_a) && c_req_a <= 1) && req_d <= 51) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || (((((((((52 <= v && 1 == req_a___0) && ((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && s_memory2 == 52) && a <= 1) && a_t == 1) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((a <= 0 && (((2 <= c_write_req_ev && 1 <= c_m_lock) && (((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 0 <= a) && 0 == req_a) && 50 <= req_d) && req_d <= 50) || ((((((52 <= req_d && ((((req_a <= 2 && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && (((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2) && req_type <= 1) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || ((((((((((51 <= req_d && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && i == req_a) && req_d <= 51) && (1 <= a_t && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 1 <= c_m_lock) && (((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2) && req_type <= 1) && 1 <= a) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((a <= 0 && (((((((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 == s_run_pc)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && ((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && a_t == 0) || (a_t <= 0 && (((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && 0 <= a_t) && (((2 <= c_write_req_ev && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && req_a <= 2) && s_memory0 == 50) && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && c_req_a <= 2) && i <= 1) && v <= 52)) || ((((52 <= req_d && (((v <= 51 && ((((2 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 2 == req_a) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && 52 <= c_req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((50 <= v && v <= 50) && 51 <= req_d) && s_memory0 == 50) && c_req_d <= 51) && ((1 <= c_req_a && (((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 == req_a) && c_req_a <= 1) && req_d <= 51) && 51 <= c_req_d) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || (((((((((52 <= v && 1 == req_a___0) && ((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && s_memory2 == 52) && a <= 1) && a_t == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == x) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && ((((((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && v <= 52) || ((((((((((52 <= v && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && (((((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && a <= 0 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && i == 0) && 0 == req_a) && a_t == 0) && 0 <= a)) || (((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a == 1) && 51 == x) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && a_t == 1) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 == req_a___0 && 52 <= v) && rsp_d___0 == 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && i <= 1) && a_t == 1) || ((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((c_req_d <= 50 && 0 <= a_t && a <= 0 && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((1 <= a && (((a_t <= 1 && 1 <= a_t) && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) || (((0 <= a_t && a <= 1) && a_t <= 0) && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2))) || ((0 <= a_t && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 0) && 0 <= a)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a_t) && 2 <= a) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && a_t <= 0) && (((((2 <= s_run_st && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && ((((c_req_a <= 0 && a <= 0) && 1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= c_req_a) && req_a <= 0) && 0 <= req_a) && 50 <= req_d) && 0 <= a) || ((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((((2 <= c_req_a && 2 <= req_a) && a_t <= 1) && req_a <= 2) && ((((((1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && c_req_a <= 2) && 51 <= req_d) && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 52 <= req_d) && a <= 2) && 1 <= a_t) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52)) || ((((((((((((((((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && ((((((1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && c_req_a <= 1) && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && a <= 1) && i == req_a) && c_req_d <= 51) && v == req_d) && req_d <= 51) && req_d <= 50)) || ((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((a_t <= 1 && a <= 1) && 1 <= a_t) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && ((((((((3 == m_run_pc && a <= 0) && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((((52 <= req_d && 0 <= a_t && (((((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && (((a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 6 == m_run_pc) && 0 == req_a) && req_a___0 <= 1) && v <= 52) && c_req_a <= 1) && 50 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && 50 == c_rsp_d) && req_tt_a == 0) && a_t == 0)) || (((((((((((((((((((((((6 == m_run_pc && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 2 <= c_req_a) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1) && c_req_a <= 2) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && a_t <= 0) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1)) || (((((a_t <= 1 && a <= 1) && 1 <= a_t) && i == req_a) && ((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((52 <= req_d && ((((((req_a <= 2 && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= a) && 2 <= a_t) && 2 <= req_a) && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && (a <= 1 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && 51 == c_rsp_d) && a_t == 1)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((((52 <= v && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((((((52 <= v && req_tt_a == 2) && (((((((s_memory0 == 50 && ((((6 == m_run_pc && (((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && 2 <= c_req_a) && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((((((((a_t <= 1 && a <= 1) && 1 <= a_t) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && ((((((((3 == m_run_pc && a <= 0) && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1317]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((2 <= a && 2 <= c_write_req_ev && (((c_empty_req == 1 && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a_t) && 6 == m_run_pc)) || (6 == m_run_pc && ((((0 <= a_t && (a <= 0 && (((2 <= s_run_st && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && 1 <= c_m_lock) && a_t <= 0) && 0 <= a) || ((((((((2 <= s_run_st && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && 1 <= c_m_lock) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || ((2 <= a && 2 <= a_t) && (((2 <= s_run_st && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && 1 <= c_m_lock)))) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && a_t <= 0) && (((((2 <= s_run_st && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && ((((c_req_a <= 0 && a <= 0) && 1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= c_req_a) && req_a <= 0) && 0 <= req_a) && 50 <= req_d) && 0 <= a) || ((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((((2 <= c_req_a && 2 <= req_a) && a_t <= 1) && req_a <= 2) && ((((((1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && c_req_a <= 2) && 51 <= req_d) && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 52 <= req_d) && a <= 2) && 1 <= a_t) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52)) || ((((((((((((((((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && ((((((1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && c_req_a <= 1) && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && a <= 1) && i == req_a) && c_req_d <= 51) && v == req_d) && req_d <= 51) && req_d <= 50)) || ((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) - InvariantResult [Line: 1295]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a)) || ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a) && 2 <= a_t)))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) || ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2)) || ((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && ((a <= 1 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 1 <= a) && 51 == rsp_d) && 51 == c_rsp_d) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1) || (((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && s_memory1 == 51) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && a <= 0 && (((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && a_t <= 0) && (((((2 <= s_run_st && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && ((((c_req_a <= 0 && a <= 0) && 1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= c_req_a) && req_a <= 0) && 0 <= req_a) && 50 <= req_d) && 0 <= a) || ((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((((2 <= c_req_a && 2 <= req_a) && a_t <= 1) && req_a <= 2) && ((((((1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && c_req_a <= 2) && 51 <= req_d) && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 52 <= req_d) && a <= 2) && 1 <= a_t) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52)) || ((((((((((((((((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && ((((((1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && c_req_a <= 1) && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && a <= 1) && i == req_a) && c_req_d <= 51) && v == req_d) && req_d <= 51) && req_d <= 50)) || ((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((c_req_d <= 50 && 0 <= a_t && a <= 0 && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a_t) || (((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || (((((((((((52 <= v && 1 <= c_req_a) && s_memory2 == 52) && req_type == 0) && (6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 == req_a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && c_req_a <= 1) && a_t == 1)) || ((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || (6 == m_run_pc && 0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock)) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && 51 == c_rsp_d) && 6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1) && i <= 1)) || ((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && ((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && 2 <= a_t) && c_req_a <= 2) && i <= 1)) || ((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && s_memory1 == 51) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || (((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && 2 <= i) && 2 <= req_a) && ((req_type == 0 && 0 == c_req_type) && (6 == m_run_pc && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((52 <= v && ((0 == c_req_a && 6 == m_run_pc) && 0 == req_a) && (((2 <= c_write_req_ev && ((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && req_a___0 <= 1) && v <= 52) && 1 <= a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && 6 == m_run_pc && 2 <= a && (((2 <= c_write_req_ev && ((c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 1)) || (((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && a <= 0 && ((((((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 0 <= a)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((c_req_d <= 50 && 0 <= a_t && a <= 0 && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && 6 == m_run_pc && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && ((c_empty_req == 1 && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 51 == c_rsp_d) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a_t == 1)) || (((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && a == 0) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && ((0 == c_req_a && 6 == m_run_pc) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && ((c_empty_req == 1 && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 == req_a) && req_a___0 <= 1) && v <= 52) && 1 <= a) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0)) || ((2 <= s_run_st && 2 <= s_run_pc) && (a <= 0 && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((((((a_t <= 1 && a <= 1) && 1 <= a_t) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && ((((((((3 == m_run_pc && a <= 0) && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((((((((((((a_t <= 1 && a <= 1) && 1 <= a_t) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) || (((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && ((((((((3 == m_run_pc && a <= 0) && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (6 == m_run_pc && (((((a_t <= 0 && a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) || ((2 <= a && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a_t)) || ((1 <= a_t && 1 <= a) && (a_t <= 1 && a <= 1) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock)))) || (((0 <= a_t && a_t <= 0) && (c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((((c_req_d <= 51 && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && req_d <= 50) && a_t <= 1) && a <= 1) && 1 <= a_t) && i == req_a) && 0 == req_a) && 1 <= a)) || (((((((((((((52 <= req_d && 0 == c_req_type && (0 == c_req_a && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && a == 0) && s_memory2 == req_d) && req_a <= 2) && req_tt_a == 0) && i == req_a) && a_t == 0) && v == req_d) && req_d <= 52) && 2 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 2 <= a_t) && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && 52 <= c_req_d) && c_req_d <= 52)) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (((((((2 <= c_req_a && (((((((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && v <= 52)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && (a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && 2 <= a_t)) || ((((((((52 <= v && 1 == req_a___0) && s_memory2 == 52) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((a <= 1 && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && c_req_a <= 1) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && 1 <= a) && a_t == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) || (((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && (2 <= c_req_a && (((((((req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && v <= 52)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((1 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock) && 2 <= a)) || ((((((52 <= v && s_memory2 == 52) && 2 == req_a___0) && (2 <= c_req_a && (((((((req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 6 == m_run_pc) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && v <= 52) && a == 2) && a_t == 1)) || (((((0 <= a_t && a <= 1) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock) || ((a_t <= 1 && 1 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock)) && 1 <= a)) || ((((((((((((((((((((1 == req_a___0 && 52 <= v) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && a <= 1) && 6 == m_run_pc) && 1 <= a) && 51 == c_rsp_d) && i <= 1) && a_t == 1)) || ((((52 <= req_d && s_memory2 == req_d) && ((req_a <= 2 && i == req_a) && (a == 0 && ((0 == c_req_type && 0 == c_req_a && 0 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && 0 == req_a___0) && s_memory1 == 51) && 2 <= req_a) && v == req_d) && req_d <= 52)) || (((a <= 0 && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a)) || (((52 <= v && s_memory2 == 52) && ((((1 == req_a___0 && s_memory1 == 51) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (6 == m_run_pc && 0 == req_a) && ((((0 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && a_t <= 0) || (((a_t <= 1 && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 1 <= a_t))) && s_memory0 == 50) && c_req_a <= 1) && req_tt_a == 1) || (((1 == req_a___0 && s_memory1 == 51) && a_t == 0) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (6 == m_run_pc && 0 == req_a) && ((((0 <= a_t && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && a_t <= 0) || (((a_t <= 1 && ((2 <= c_write_req_ev && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 1 <= a_t))) && s_memory0 == 50) && c_req_a <= 1)) && 1 <= a) && v <= 52)) || ((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && (((0 == c_req_a && 0 <= a_t) && 6 == m_run_pc) && ((((((a <= 0 && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && a_t <= 0) && 0 == req_a) && 0 <= a)) || ((((((((((((((((52 <= v && req_tt_a == 2) && (((((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 810]: Loop Invariant Derived loop invariant: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((((((((((52 <= v && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 0 == req_a) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) || (((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && 51 == rsp_d) && 51 == c_rsp_d) && (6 == m_run_pc && a <= 1 && ((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && a_t == 1)) || (((((((((((((((((52 <= v && req_tt_a == 2) && 52 == c_rsp_d) && s_memory1 == 51) && i <= 2) && v <= 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((2 <= c_write_req_ev && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && rsp_d___0 == 52) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 1033]: Loop Invariant Derived loop invariant: (((((((((((52 <= req_d && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && ((((req_a <= 2 && ((1 == c_write_rsp_ev && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= req_a) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || ((((((((((((1 == c_write_rsp_ev && 1 <= a) && ((a_t <= 1 && a <= 1) && 1 <= a_t) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 51 <= req_d) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 1 == c_write_rsp_ev) && 50 <= req_d) && req_d <= 50) && 0 == req_a) && 0 <= a)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 1 == c_write_rsp_ev && 0 <= a_t && (a <= 0 && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a) || ((((((((((((51 <= req_d && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && (((((2 <= req_a && a <= 2) && a_t <= 1) && 1 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && s_run_pc == 2) && 2 <= a) && req_a <= 2) && req_a <= 1) && 51 <= c_req_d) && 52 <= req_d) && i == req_a) && c_req_d <= 51) && v == req_d)) || (((((((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 2 <= s_run_st) && 1 <= req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((((3 == m_run_pc && c_empty_req == 1) && 1 <= req_type) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && s_run_pc == 2) && a_t <= 0) && s_memory0 == req_d) && 51 <= req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a <= 1) && i == req_a) && v == req_d) && req_d <= 51) && req_d <= 50)) || ((((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((2 <= s_run_st && ((3 == m_run_pc && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || ((((c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 0 == s_run_pc)) || ((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 0)) || (((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && 52 <= c_req_d) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && (2 <= c_req_a && ((((((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 2) && req_a <= 1) && c_req_d <= 52) && 2 <= a_t)) || (((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((i == req_a && c_req_d <= 51) && s_memory0 == req_d) && v == req_d) && 51 <= c_req_d) && (a_t <= 1 && 1 <= a_t) && (1 <= c_req_a && ((((((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || ((((((((((((52 <= req_d && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 == req_d) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((((a_t <= 1 && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 51 <= req_d) && 1 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && 1 <= c_m_lock)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && (a_t <= 0 && (((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 1) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && ((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) && 50 <= req_d) && req_d <= 50)) || ((((((((((a <= 0 && c_empty_req == 1) && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || ((((((((((((((51 <= req_d && s_memory0 == 50) && req_d <= 52) && s_memory1 == req_d) && req_d <= 51) && (((2 <= req_a && a_t <= 1) && 2 <= a) && req_a <= 2) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && ((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 52 <= req_d) && a <= 2) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d)) || (((((((req_d <= 50 && 0 == c_req_a) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 50 <= req_d) && (((((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a)) || ((2 <= s_run_st && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: (((((((((((52 <= req_d && s_memory2 == req_d) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && ((((req_a <= 2 && ((1 == c_write_rsp_ev && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= req_a) || ((((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && 6 == m_run_pc && (((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && a <= 1) && 1 == c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && a_t == 1)) || (((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && 52 == rsp_d) && 52 == \result) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && (1 == c_write_rsp_ev && (req_type == 0 && 0 == c_req_type) && ((6 == m_run_pc && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && c_req_a <= 2) && v <= 52)) || ((((((((((((1 == c_write_rsp_ev && 1 <= a) && ((a_t <= 1 && a <= 1) && 1 <= a_t) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 51 <= req_d) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 1 == c_write_rsp_ev) && 50 <= req_d) && req_d <= 50) && 0 == req_a) && 0 <= a)) || (((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && ((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 3 <= m_run_pc) && 6 == m_run_pc) && 0 == req_a) && 1 == c_write_rsp_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 1 == c_write_rsp_ev && 0 <= a_t && (a <= 0 && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: (((((((((((((52 <= v && req_tt_a == 2) && s_memory2 == 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && ((((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 6 == m_run_pc) && 2 <= a) && 2 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == x) && 52 == rsp_d) && 52 == \result) && v <= 52) || ((((((((((51 <= req_d && (((a_t <= 1 && a <= 1) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a_t) && 1 <= a) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d)) || ((0 == req_a && ((((((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && (((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) || ((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 0 == s_run_pc))) && req_type <= 1) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((((((((52 <= v && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && 6 == m_run_pc) && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && a == 0) && 50 == x) && req_tt_a == 0) && a_t == 0)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && a_t <= 0 && (a <= 0 && 0 <= a_t) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((52 <= req_d && s_memory2 == req_d) && ((((((((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && req_a <= 2) && s_memory0 == 50) && i == req_a) && s_memory1 == 51) && 2 <= req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52)) || (((((((((((52 <= v && 1 == req_a___0) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && v <= 52) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && ((((((1 <= c_req_a && ((6 == m_run_pc && a <= 1 && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && a_t == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((52 <= req_d && s_memory0 == 50) && 3 <= a) && s_memory1 == 51) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((c_req_d <= 50 && 0 <= a_t && a <= 0 && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((c_req_d <= 50 && 50 <= c_req_d) && (((a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && 0 == s_run_pc) && 1 <= c_m_lock) && (c_req_a <= 0 && 0 <= c_req_a) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type) && 0 <= a_t) && a_t <= 0) && 0 <= a) || (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2)) || ((((((((((((51 <= req_d && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && i == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d)) || ((2 <= s_run_st && 0 == s_run_pc) && (c_req_a <= 0 && 0 <= c_req_a) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type)) || ((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && i == req_a) && v == req_d) && 0 <= a) && req_d <= 50)) || ((a <= 1 && ((a_t <= 1 && i == req_a) && 0 == req_a) && (((((s_memory0 == req_d && v == req_d) && 0 <= a_t && (1 <= c_req_a && c_req_a <= 1) && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d) && 1 <= a)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) && 0 <= a)) || (((((((((((52 <= req_d && i == 2 && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((1 <= a_t && (2 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && 2 <= a) && 51 <= req_d) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 <= c_req_d) && c_req_d <= 52) - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: (((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((c_req_d <= 50 && 0 <= a_t && a <= 0 && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((c_req_d <= 50 && 0 <= a_t && a <= 0 && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= c_req_d) && a_t <= 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || ((((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((52 <= req_d && s_memory0 == 50) && 3 <= a) && s_memory1 == 51) && s_memory2 == req_d) && req_a <= 2) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || ((((((((((((51 <= req_d && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && a <= 2) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && ((((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a_t <= 1) && 2 <= a)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 1) && a_t <= 0) && i == req_a) && 0 <= a_t && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 1 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || ((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 274 locations, 5 error locations. Result: SAFE, OverallTime: 210.0s, OverallIterations: 31, TraceHistogramMax: 12, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 150.7s, HoareTripleCheckerStatistics: 20172 SDtfs, 37274 SDslu, 87927 SDs, 0 SdLazy, 7393 SolverSat, 920 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3636 GetRequests, 3184 SyntacticMatches, 14 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9473occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 78338 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1227 NumberOfFragments, 33151 HoareAnnotationTreeSize, 98 FomulaSimplifications, 1267961986 FormulaSimplificationTreeSizeReduction, 36.9s HoareSimplificationTime, 98 FomulaSimplificationsInter, 206716743 FormulaSimplificationTreeSizeReductionInter, 113.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 9526 NumberOfCodeBlocks, 9526 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 9488 ConstructedInterpolants, 0 QuantifiedInterpolants, 15443576 SizeOfPredicates, 94 NumberOfNonLiveVariables, 8483 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 6137/10826 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...