./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.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_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/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 7974185e330e91a4e9731c3e8d6ea997b9a774a6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:06:10,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:10,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:10,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:10,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:10,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:10,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:10,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:10,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:10,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:10,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:10,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:10,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:10,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:10,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:10,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:10,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:10,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:10,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:10,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:10,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:10,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:10,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:10,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:10,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:10,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:10,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:10,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:10,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:10,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:10,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:10,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:10,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:10,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:10,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:10,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:10,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:10,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:10,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:10,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:10,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:10,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:06:10,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:10,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:10,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:10,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:10,987 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:10,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:10,987 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:06:10,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:10,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:06:10,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:10,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:06:10,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:10,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:06:10,989 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:06:10,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:10,989 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:10,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:06:10,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:10,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:10,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:10,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:10,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:10,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:10,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:10,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:06:10,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:10,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:06:10,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:06:10,992 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_1e2efb8b-95a6-4f74-a2eb-975333418d81/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 -> 7974185e330e91a4e9731c3e8d6ea997b9a774a6 [2019-11-16 00:06:11,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:11,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:11,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:11,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:11,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:11,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2019-11-16 00:06:11,108 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/data/1c632929e/0618b5ff6ec64bc686d352d6851c6d8b/FLAGdc16bccfd [2019-11-16 00:06:11,601 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:11,602 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2019-11-16 00:06:11,618 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/data/1c632929e/0618b5ff6ec64bc686d352d6851c6d8b/FLAGdc16bccfd [2019-11-16 00:06:11,995 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/data/1c632929e/0618b5ff6ec64bc686d352d6851c6d8b [2019-11-16 00:06:11,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:11,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:12,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:12,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:12,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:12,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:11" (1/1) ... [2019-11-16 00:06:12,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6495b8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12, skipping insertion in model container [2019-11-16 00:06:12,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:11" (1/1) ... [2019-11-16 00:06:12,015 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:12,061 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:12,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:12,449 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:12,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:12,567 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:12,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12 WrapperNode [2019-11-16 00:06:12,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:12,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:12,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:12,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:12,575 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:06:12" (1/1) ... [2019-11-16 00:06:12,586 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:06:12" (1/1) ... [2019-11-16 00:06:12,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:12,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:12,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:12,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:12,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... [2019-11-16 00:06:12,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:12,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:12,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:12,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:12,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/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:06:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:12,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:13,881 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:13,881 INFO L284 CfgBuilder]: Removed 39 assume(true) statements. [2019-11-16 00:06:13,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:13 BoogieIcfgContainer [2019-11-16 00:06:13,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:13,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:06:13,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:06:13,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:06:13,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:11" (1/3) ... [2019-11-16 00:06:13,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee71580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:13, skipping insertion in model container [2019-11-16 00:06:13,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:12" (2/3) ... [2019-11-16 00:06:13,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee71580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:13, skipping insertion in model container [2019-11-16 00:06:13,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:13" (3/3) ... [2019-11-16 00:06:13,896 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2019-11-16 00:06:13,906 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:06:13,925 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:06:13,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:06:13,986 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:06:13,986 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:06:13,986 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:06:13,987 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:13,987 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:13,987 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:06:13,987 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:13,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:06:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2019-11-16 00:06:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:06:14,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:14,027 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:06:14,029 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2019-11-16 00:06:14,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:14,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815132348] [2019-11-16 00:06:14,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:14,192 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:06:14,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815132348] [2019-11-16 00:06:14,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:14,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:14,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184631230] [2019-11-16 00:06:14,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:14,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:14,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:14,214 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 3 states. [2019-11-16 00:06:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:14,765 INFO L93 Difference]: Finished difference Result 725 states and 1316 transitions. [2019-11-16 00:06:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:14,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-16 00:06:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:14,803 INFO L225 Difference]: With dead ends: 725 [2019-11-16 00:06:14,804 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:06:14,813 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:06:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:06:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 434. [2019-11-16 00:06:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-16 00:06:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 681 transitions. [2019-11-16 00:06:14,935 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 681 transitions. Word has length 28 [2019-11-16 00:06:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:14,935 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 681 transitions. [2019-11-16 00:06:14,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 681 transitions. [2019-11-16 00:06:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:06:14,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:14,942 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] [2019-11-16 00:06:14,943 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1366485519, now seen corresponding path program 1 times [2019-11-16 00:06:14,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:14,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500157046] [2019-11-16 00:06:14,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:15,002 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:06:15,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500157046] [2019-11-16 00:06:15,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:15,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:15,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023383289] [2019-11-16 00:06:15,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:15,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:15,006 INFO L87 Difference]: Start difference. First operand 434 states and 681 transitions. Second operand 3 states. [2019-11-16 00:06:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:15,174 INFO L93 Difference]: Finished difference Result 1135 states and 1805 transitions. [2019-11-16 00:06:15,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:15,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-16 00:06:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:15,180 INFO L225 Difference]: With dead ends: 1135 [2019-11-16 00:06:15,180 INFO L226 Difference]: Without dead ends: 715 [2019-11-16 00:06:15,182 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:06:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-16 00:06:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 699. [2019-11-16 00:06:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-11-16 00:06:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1128 transitions. [2019-11-16 00:06:15,220 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1128 transitions. Word has length 37 [2019-11-16 00:06:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:15,221 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1128 transitions. [2019-11-16 00:06:15,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1128 transitions. [2019-11-16 00:06:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:06:15,224 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:15,224 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:06:15,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash -226101542, now seen corresponding path program 1 times [2019-11-16 00:06:15,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:15,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117131645] [2019-11-16 00:06:15,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:15,281 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:06:15,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117131645] [2019-11-16 00:06:15,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:15,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:15,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496511226] [2019-11-16 00:06:15,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:15,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:15,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:15,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:15,284 INFO L87 Difference]: Start difference. First operand 699 states and 1128 transitions. Second operand 3 states. [2019-11-16 00:06:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:15,364 INFO L93 Difference]: Finished difference Result 1765 states and 2849 transitions. [2019-11-16 00:06:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:15,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-16 00:06:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:15,374 INFO L225 Difference]: With dead ends: 1765 [2019-11-16 00:06:15,374 INFO L226 Difference]: Without dead ends: 1091 [2019-11-16 00:06:15,376 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:06:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-11-16 00:06:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1079. [2019-11-16 00:06:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-16 00:06:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1738 transitions. [2019-11-16 00:06:15,438 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1738 transitions. Word has length 38 [2019-11-16 00:06:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:15,440 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1738 transitions. [2019-11-16 00:06:15,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1738 transitions. [2019-11-16 00:06:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:06:15,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:15,445 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:06:15,445 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash -775080850, now seen corresponding path program 1 times [2019-11-16 00:06:15,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:15,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961737607] [2019-11-16 00:06:15,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:15,551 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:06:15,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961737607] [2019-11-16 00:06:15,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:15,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:15,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265230980] [2019-11-16 00:06:15,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:15,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:15,553 INFO L87 Difference]: Start difference. First operand 1079 states and 1738 transitions. Second operand 3 states. [2019-11-16 00:06:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:15,653 INFO L93 Difference]: Finished difference Result 2885 states and 4646 transitions. [2019-11-16 00:06:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:15,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-16 00:06:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:15,666 INFO L225 Difference]: With dead ends: 2885 [2019-11-16 00:06:15,667 INFO L226 Difference]: Without dead ends: 1831 [2019-11-16 00:06:15,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:06:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-11-16 00:06:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1685. [2019-11-16 00:06:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-11-16 00:06:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2676 transitions. [2019-11-16 00:06:15,751 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2676 transitions. Word has length 46 [2019-11-16 00:06:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:15,752 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 2676 transitions. [2019-11-16 00:06:15,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2676 transitions. [2019-11-16 00:06:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:06:15,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:15,754 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:06:15,754 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-11-16 00:06:15,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:15,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147642322] [2019-11-16 00:06:15,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:15,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:15,812 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:06:15,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147642322] [2019-11-16 00:06:15,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:15,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:15,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894589026] [2019-11-16 00:06:15,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:15,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:15,816 INFO L87 Difference]: Start difference. First operand 1685 states and 2676 transitions. Second operand 3 states. [2019-11-16 00:06:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:16,086 INFO L93 Difference]: Finished difference Result 4701 states and 7444 transitions. [2019-11-16 00:06:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:16,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:06:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:16,107 INFO L225 Difference]: With dead ends: 4701 [2019-11-16 00:06:16,107 INFO L226 Difference]: Without dead ends: 3035 [2019-11-16 00:06:16,110 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:06:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-11-16 00:06:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2969. [2019-11-16 00:06:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2969 states. [2019-11-16 00:06:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4639 transitions. [2019-11-16 00:06:16,245 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4639 transitions. Word has length 52 [2019-11-16 00:06:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:16,246 INFO L462 AbstractCegarLoop]: Abstraction has 2969 states and 4639 transitions. [2019-11-16 00:06:16,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4639 transitions. [2019-11-16 00:06:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:06:16,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:16,248 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:06:16,248 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-11-16 00:06:16,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:16,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435735551] [2019-11-16 00:06:16,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:16,303 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:06:16,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435735551] [2019-11-16 00:06:16,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:16,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:16,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616910635] [2019-11-16 00:06:16,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:16,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:16,307 INFO L87 Difference]: Start difference. First operand 2969 states and 4639 transitions. Second operand 3 states. [2019-11-16 00:06:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:16,482 INFO L93 Difference]: Finished difference Result 6983 states and 10862 transitions. [2019-11-16 00:06:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:16,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:06:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:16,509 INFO L225 Difference]: With dead ends: 6983 [2019-11-16 00:06:16,510 INFO L226 Difference]: Without dead ends: 4037 [2019-11-16 00:06:16,517 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:06:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2019-11-16 00:06:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 3853. [2019-11-16 00:06:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-11-16 00:06:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5937 transitions. [2019-11-16 00:06:16,699 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5937 transitions. Word has length 52 [2019-11-16 00:06:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:16,700 INFO L462 AbstractCegarLoop]: Abstraction has 3853 states and 5937 transitions. [2019-11-16 00:06:16,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5937 transitions. [2019-11-16 00:06:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:06:16,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:16,703 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] [2019-11-16 00:06:16,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:16,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1739823060, now seen corresponding path program 1 times [2019-11-16 00:06:16,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:16,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196257738] [2019-11-16 00:06:16,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:16,763 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:06:16,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196257738] [2019-11-16 00:06:16,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:16,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:16,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575656069] [2019-11-16 00:06:16,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:16,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:16,764 INFO L87 Difference]: Start difference. First operand 3853 states and 5937 transitions. Second operand 3 states. [2019-11-16 00:06:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:17,370 INFO L93 Difference]: Finished difference Result 9269 states and 14370 transitions. [2019-11-16 00:06:17,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:17,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-16 00:06:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:17,406 INFO L225 Difference]: With dead ends: 9269 [2019-11-16 00:06:17,406 INFO L226 Difference]: Without dead ends: 5439 [2019-11-16 00:06:17,412 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:06:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2019-11-16 00:06:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5349. [2019-11-16 00:06:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5349 states. [2019-11-16 00:06:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 8153 transitions. [2019-11-16 00:06:17,709 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 8153 transitions. Word has length 57 [2019-11-16 00:06:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:17,709 INFO L462 AbstractCegarLoop]: Abstraction has 5349 states and 8153 transitions. [2019-11-16 00:06:17,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 8153 transitions. [2019-11-16 00:06:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:06:17,712 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:17,712 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] [2019-11-16 00:06:17,713 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash -635425216, now seen corresponding path program 1 times [2019-11-16 00:06:17,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:17,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343713110] [2019-11-16 00:06:17,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:17,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:17,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:17,765 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:06:17,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343713110] [2019-11-16 00:06:17,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:17,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:17,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828030021] [2019-11-16 00:06:17,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:17,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:17,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:17,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:17,807 INFO L87 Difference]: Start difference. First operand 5349 states and 8153 transitions. Second operand 3 states. [2019-11-16 00:06:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:18,068 INFO L93 Difference]: Finished difference Result 10675 states and 16276 transitions. [2019-11-16 00:06:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:18,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-16 00:06:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:18,101 INFO L225 Difference]: With dead ends: 10675 [2019-11-16 00:06:18,101 INFO L226 Difference]: Without dead ends: 5349 [2019-11-16 00:06:18,108 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:06:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2019-11-16 00:06:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5349. [2019-11-16 00:06:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5349 states. [2019-11-16 00:06:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 8017 transitions. [2019-11-16 00:06:18,336 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 8017 transitions. Word has length 59 [2019-11-16 00:06:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:18,337 INFO L462 AbstractCegarLoop]: Abstraction has 5349 states and 8017 transitions. [2019-11-16 00:06:18,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 8017 transitions. [2019-11-16 00:06:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:06:18,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:18,340 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:06:18,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 556254941, now seen corresponding path program 1 times [2019-11-16 00:06:18,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:18,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82504492] [2019-11-16 00:06:18,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:18,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:18,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:18,386 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:06:18,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82504492] [2019-11-16 00:06:18,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:18,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:18,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450920252] [2019-11-16 00:06:18,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:18,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:18,388 INFO L87 Difference]: Start difference. First operand 5349 states and 8017 transitions. Second operand 3 states. [2019-11-16 00:06:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:18,896 INFO L93 Difference]: Finished difference Result 12059 states and 18112 transitions. [2019-11-16 00:06:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:18,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-16 00:06:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:18,943 INFO L225 Difference]: With dead ends: 12059 [2019-11-16 00:06:18,944 INFO L226 Difference]: Without dead ends: 6733 [2019-11-16 00:06:18,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:06:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2019-11-16 00:06:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5991. [2019-11-16 00:06:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5991 states. [2019-11-16 00:06:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 8803 transitions. [2019-11-16 00:06:19,186 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 8803 transitions. Word has length 60 [2019-11-16 00:06:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:19,187 INFO L462 AbstractCegarLoop]: Abstraction has 5991 states and 8803 transitions. [2019-11-16 00:06:19,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 8803 transitions. [2019-11-16 00:06:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:06:19,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:19,191 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] [2019-11-16 00:06:19,191 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1524089549, now seen corresponding path program 1 times [2019-11-16 00:06:19,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:19,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834249581] [2019-11-16 00:06:19,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:19,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:19,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:19,261 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:06:19,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834249581] [2019-11-16 00:06:19,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:19,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:19,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858336907] [2019-11-16 00:06:19,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:19,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:19,265 INFO L87 Difference]: Start difference. First operand 5991 states and 8803 transitions. Second operand 5 states. [2019-11-16 00:06:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:20,191 INFO L93 Difference]: Finished difference Result 31245 states and 45936 transitions. [2019-11-16 00:06:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:06:20,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-16 00:06:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:20,248 INFO L225 Difference]: With dead ends: 31245 [2019-11-16 00:06:20,248 INFO L226 Difference]: Without dead ends: 25277 [2019-11-16 00:06:20,268 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:06:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25277 states. [2019-11-16 00:06:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25277 to 8339. [2019-11-16 00:06:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8339 states. [2019-11-16 00:06:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 12256 transitions. [2019-11-16 00:06:20,850 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 12256 transitions. Word has length 62 [2019-11-16 00:06:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:20,850 INFO L462 AbstractCegarLoop]: Abstraction has 8339 states and 12256 transitions. [2019-11-16 00:06:20,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 12256 transitions. [2019-11-16 00:06:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:06:20,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:20,853 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:06:20,854 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash 21161543, now seen corresponding path program 1 times [2019-11-16 00:06:20,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:20,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507193107] [2019-11-16 00:06:20,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:20,969 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:06:20,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507193107] [2019-11-16 00:06:20,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:20,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:20,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809331178] [2019-11-16 00:06:20,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:20,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:20,971 INFO L87 Difference]: Start difference. First operand 8339 states and 12256 transitions. Second operand 7 states. [2019-11-16 00:06:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:23,098 INFO L93 Difference]: Finished difference Result 41373 states and 60773 transitions. [2019-11-16 00:06:23,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:06:23,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-16 00:06:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:23,166 INFO L225 Difference]: With dead ends: 41373 [2019-11-16 00:06:23,166 INFO L226 Difference]: Without dead ends: 33057 [2019-11-16 00:06:23,184 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:06:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33057 states. [2019-11-16 00:06:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33057 to 5545. [2019-11-16 00:06:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5545 states. [2019-11-16 00:06:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 8041 transitions. [2019-11-16 00:06:23,710 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 8041 transitions. Word has length 63 [2019-11-16 00:06:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:23,711 INFO L462 AbstractCegarLoop]: Abstraction has 5545 states and 8041 transitions. [2019-11-16 00:06:23,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 8041 transitions. [2019-11-16 00:06:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:06:23,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:23,721 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:06:23,721 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 633008800, now seen corresponding path program 1 times [2019-11-16 00:06:23,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:23,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980156257] [2019-11-16 00:06:23,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:23,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:23,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:23,764 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:06:23,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980156257] [2019-11-16 00:06:23,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:23,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:23,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305200338] [2019-11-16 00:06:23,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:23,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:23,767 INFO L87 Difference]: Start difference. First operand 5545 states and 8041 transitions. Second operand 3 states. [2019-11-16 00:06:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:24,194 INFO L93 Difference]: Finished difference Result 11690 states and 16907 transitions. [2019-11-16 00:06:24,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:24,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-16 00:06:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:24,211 INFO L225 Difference]: With dead ends: 11690 [2019-11-16 00:06:24,212 INFO L226 Difference]: Without dead ends: 6166 [2019-11-16 00:06:24,219 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:06:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-11-16 00:06:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 6074. [2019-11-16 00:06:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6074 states. [2019-11-16 00:06:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 8769 transitions. [2019-11-16 00:06:24,558 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 8769 transitions. Word has length 77 [2019-11-16 00:06:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:24,559 INFO L462 AbstractCegarLoop]: Abstraction has 6074 states and 8769 transitions. [2019-11-16 00:06:24,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 8769 transitions. [2019-11-16 00:06:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:06:24,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:24,562 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:06:24,563 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash -120422989, now seen corresponding path program 1 times [2019-11-16 00:06:24,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:24,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908155278] [2019-11-16 00:06:24,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:24,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:24,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:24,606 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:06:24,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908155278] [2019-11-16 00:06:24,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:24,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:24,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300045036] [2019-11-16 00:06:24,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:24,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:24,609 INFO L87 Difference]: Start difference. First operand 6074 states and 8769 transitions. Second operand 3 states. [2019-11-16 00:06:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:25,019 INFO L93 Difference]: Finished difference Result 15622 states and 22438 transitions. [2019-11-16 00:06:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:25,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-16 00:06:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:25,037 INFO L225 Difference]: With dead ends: 15622 [2019-11-16 00:06:25,037 INFO L226 Difference]: Without dead ends: 9437 [2019-11-16 00:06:25,052 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:06:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2019-11-16 00:06:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 9409. [2019-11-16 00:06:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2019-11-16 00:06:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 13387 transitions. [2019-11-16 00:06:25,796 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 13387 transitions. Word has length 88 [2019-11-16 00:06:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:25,797 INFO L462 AbstractCegarLoop]: Abstraction has 9409 states and 13387 transitions. [2019-11-16 00:06:25,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 13387 transitions. [2019-11-16 00:06:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:25,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:25,802 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:06:25,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1916611, now seen corresponding path program 1 times [2019-11-16 00:06:25,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:25,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371069546] [2019-11-16 00:06:25,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:25,847 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:06:25,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371069546] [2019-11-16 00:06:25,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:25,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:25,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255818610] [2019-11-16 00:06:25,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:25,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:25,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:25,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:25,849 INFO L87 Difference]: Start difference. First operand 9409 states and 13387 transitions. Second operand 3 states. [2019-11-16 00:06:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:26,271 INFO L93 Difference]: Finished difference Result 17294 states and 24524 transitions. [2019-11-16 00:06:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:26,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-16 00:06:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:26,280 INFO L225 Difference]: With dead ends: 17294 [2019-11-16 00:06:26,280 INFO L226 Difference]: Without dead ends: 6922 [2019-11-16 00:06:26,293 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:06:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2019-11-16 00:06:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6509. [2019-11-16 00:06:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2019-11-16 00:06:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 8833 transitions. [2019-11-16 00:06:26,628 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 8833 transitions. Word has length 95 [2019-11-16 00:06:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:26,629 INFO L462 AbstractCegarLoop]: Abstraction has 6509 states and 8833 transitions. [2019-11-16 00:06:26,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 8833 transitions. [2019-11-16 00:06:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:06:26,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:26,631 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:06:26,632 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash -382912401, now seen corresponding path program 1 times [2019-11-16 00:06:26,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:26,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516106495] [2019-11-16 00:06:26,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:26,667 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:06:26,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516106495] [2019-11-16 00:06:26,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:26,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:26,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521880383] [2019-11-16 00:06:26,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:26,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:26,669 INFO L87 Difference]: Start difference. First operand 6509 states and 8833 transitions. Second operand 3 states. [2019-11-16 00:06:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:26,892 INFO L93 Difference]: Finished difference Result 10522 states and 14348 transitions. [2019-11-16 00:06:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:26,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:06:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:26,896 INFO L225 Difference]: With dead ends: 10522 [2019-11-16 00:06:26,897 INFO L226 Difference]: Without dead ends: 4127 [2019-11-16 00:06:26,903 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:06:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-11-16 00:06:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4109. [2019-11-16 00:06:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-11-16 00:06:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 5458 transitions. [2019-11-16 00:06:27,077 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 5458 transitions. Word has length 98 [2019-11-16 00:06:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:27,077 INFO L462 AbstractCegarLoop]: Abstraction has 4109 states and 5458 transitions. [2019-11-16 00:06:27,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 5458 transitions. [2019-11-16 00:06:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:06:27,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:27,078 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:06:27,079 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash -390807016, now seen corresponding path program 1 times [2019-11-16 00:06:27,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:27,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375174855] [2019-11-16 00:06:27,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:27,124 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:06:27,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375174855] [2019-11-16 00:06:27,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:27,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:27,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132844855] [2019-11-16 00:06:27,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:27,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:27,127 INFO L87 Difference]: Start difference. First operand 4109 states and 5458 transitions. Second operand 3 states. [2019-11-16 00:06:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:27,464 INFO L93 Difference]: Finished difference Result 7280 states and 9704 transitions. [2019-11-16 00:06:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:27,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:06:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:27,467 INFO L225 Difference]: With dead ends: 7280 [2019-11-16 00:06:27,467 INFO L226 Difference]: Without dead ends: 3246 [2019-11-16 00:06:27,470 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:06:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2019-11-16 00:06:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 2944. [2019-11-16 00:06:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-11-16 00:06:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3823 transitions. [2019-11-16 00:06:27,632 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3823 transitions. Word has length 98 [2019-11-16 00:06:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 3823 transitions. [2019-11-16 00:06:27,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3823 transitions. [2019-11-16 00:06:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:06:27,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:27,634 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:06:27,635 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash 771669376, now seen corresponding path program 1 times [2019-11-16 00:06:27,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:27,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718018234] [2019-11-16 00:06:27,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:27,685 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:06:27,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718018234] [2019-11-16 00:06:27,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:27,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:27,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859454766] [2019-11-16 00:06:27,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:27,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:27,687 INFO L87 Difference]: Start difference. First operand 2944 states and 3823 transitions. Second operand 3 states. [2019-11-16 00:06:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:27,861 INFO L93 Difference]: Finished difference Result 3266 states and 4207 transitions. [2019-11-16 00:06:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:27,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-16 00:06:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:27,865 INFO L225 Difference]: With dead ends: 3266 [2019-11-16 00:06:27,865 INFO L226 Difference]: Without dead ends: 3262 [2019-11-16 00:06:27,866 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:06:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-11-16 00:06:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3237. [2019-11-16 00:06:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3237 states. [2019-11-16 00:06:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4160 transitions. [2019-11-16 00:06:28,028 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4160 transitions. Word has length 99 [2019-11-16 00:06:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:28,028 INFO L462 AbstractCegarLoop]: Abstraction has 3237 states and 4160 transitions. [2019-11-16 00:06:28,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4160 transitions. [2019-11-16 00:06:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:06:28,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:28,031 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] [2019-11-16 00:06:28,032 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1243765039, now seen corresponding path program 1 times [2019-11-16 00:06:28,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:28,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185888475] [2019-11-16 00:06:28,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:28,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:28,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:28,142 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:06:28,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185888475] [2019-11-16 00:06:28,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:28,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:28,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038983220] [2019-11-16 00:06:28,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:28,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:28,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:28,144 INFO L87 Difference]: Start difference. First operand 3237 states and 4160 transitions. Second operand 5 states. [2019-11-16 00:06:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:28,821 INFO L93 Difference]: Finished difference Result 12052 states and 15568 transitions. [2019-11-16 00:06:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:06:28,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-11-16 00:06:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:28,830 INFO L225 Difference]: With dead ends: 12052 [2019-11-16 00:06:28,830 INFO L226 Difference]: Without dead ends: 9007 [2019-11-16 00:06:28,834 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:06:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9007 states. [2019-11-16 00:06:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9007 to 3239. [2019-11-16 00:06:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2019-11-16 00:06:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4154 transitions. [2019-11-16 00:06:29,065 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4154 transitions. Word has length 157 [2019-11-16 00:06:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:29,066 INFO L462 AbstractCegarLoop]: Abstraction has 3239 states and 4154 transitions. [2019-11-16 00:06:29,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4154 transitions. [2019-11-16 00:06:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-16 00:06:29,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:29,069 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] [2019-11-16 00:06:29,069 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash 114274644, now seen corresponding path program 1 times [2019-11-16 00:06:29,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:29,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071345643] [2019-11-16 00:06:29,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:06:29,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071345643] [2019-11-16 00:06:29,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710894440] [2019-11-16 00:06:29,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/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:06:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:06:29,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:29,602 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:06:29,602 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:29,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-16 00:06:29,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588750085] [2019-11-16 00:06:29,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:06:29,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:06:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:29,607 INFO L87 Difference]: Start difference. First operand 3239 states and 4154 transitions. Second operand 12 states. [2019-11-16 00:06:30,545 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-16 00:06:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:32,911 INFO L93 Difference]: Finished difference Result 17939 states and 23233 transitions. [2019-11-16 00:06:32,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-16 00:06:32,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-11-16 00:06:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:32,969 INFO L225 Difference]: With dead ends: 17939 [2019-11-16 00:06:32,969 INFO L226 Difference]: Without dead ends: 14914 [2019-11-16 00:06:32,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=511, Invalid=1841, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:06:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14914 states. [2019-11-16 00:06:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14914 to 4690. [2019-11-16 00:06:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4690 states. [2019-11-16 00:06:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 6093 transitions. [2019-11-16 00:06:33,573 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 6093 transitions. Word has length 159 [2019-11-16 00:06:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:33,573 INFO L462 AbstractCegarLoop]: Abstraction has 4690 states and 6093 transitions. [2019-11-16 00:06:33,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:06:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 6093 transitions. [2019-11-16 00:06:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-16 00:06:33,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:33,580 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:33,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:33,784 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1467549623, now seen corresponding path program 1 times [2019-11-16 00:06:33,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:33,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522213719] [2019-11-16 00:06:33,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-16 00:06:33,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522213719] [2019-11-16 00:06:33,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:33,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:33,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447585093] [2019-11-16 00:06:33,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:33,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:33,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:33,917 INFO L87 Difference]: Start difference. First operand 4690 states and 6093 transitions. Second operand 3 states. [2019-11-16 00:06:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:34,934 INFO L93 Difference]: Finished difference Result 10507 states and 13716 transitions. [2019-11-16 00:06:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-16 00:06:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:34,941 INFO L225 Difference]: With dead ends: 10507 [2019-11-16 00:06:34,941 INFO L226 Difference]: Without dead ends: 6031 [2019-11-16 00:06:34,945 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:06:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2019-11-16 00:06:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 5842. [2019-11-16 00:06:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5842 states. [2019-11-16 00:06:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 7418 transitions. [2019-11-16 00:06:35,461 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 7418 transitions. Word has length 257 [2019-11-16 00:06:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:35,461 INFO L462 AbstractCegarLoop]: Abstraction has 5842 states and 7418 transitions. [2019-11-16 00:06:35,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 7418 transitions. [2019-11-16 00:06:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-16 00:06:35,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:35,465 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 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, 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] [2019-11-16 00:06:35,466 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 35825393, now seen corresponding path program 1 times [2019-11-16 00:06:35,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:35,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888993744] [2019-11-16 00:06:35,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-16 00:06:35,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888993744] [2019-11-16 00:06:35,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:35,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:35,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797052167] [2019-11-16 00:06:35,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:35,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:35,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:35,562 INFO L87 Difference]: Start difference. First operand 5842 states and 7418 transitions. Second operand 3 states. [2019-11-16 00:06:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:35,846 INFO L93 Difference]: Finished difference Result 6759 states and 8453 transitions. [2019-11-16 00:06:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:35,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-16 00:06:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:35,850 INFO L225 Difference]: With dead ends: 6759 [2019-11-16 00:06:35,850 INFO L226 Difference]: Without dead ends: 1020 [2019-11-16 00:06:35,854 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:06:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-11-16 00:06:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 823. [2019-11-16 00:06:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-16 00:06:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 898 transitions. [2019-11-16 00:06:35,947 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 898 transitions. Word has length 258 [2019-11-16 00:06:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:35,947 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 898 transitions. [2019-11-16 00:06:35,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 898 transitions. [2019-11-16 00:06:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-16 00:06:35,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:35,950 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:35,950 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1838022629, now seen corresponding path program 1 times [2019-11-16 00:06:35,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:35,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128518477] [2019-11-16 00:06:35,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-16 00:06:36,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128518477] [2019-11-16 00:06:36,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:36,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:36,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517196143] [2019-11-16 00:06:36,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:36,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:36,109 INFO L87 Difference]: Start difference. First operand 823 states and 898 transitions. Second operand 7 states. [2019-11-16 00:06:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:36,554 INFO L93 Difference]: Finished difference Result 2081 states and 2293 transitions. [2019-11-16 00:06:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:06:36,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2019-11-16 00:06:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:36,558 INFO L225 Difference]: With dead ends: 2081 [2019-11-16 00:06:36,558 INFO L226 Difference]: Without dead ends: 1867 [2019-11-16 00:06:36,559 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:06:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2019-11-16 00:06:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 906. [2019-11-16 00:06:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-16 00:06:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 992 transitions. [2019-11-16 00:06:36,673 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 992 transitions. Word has length 259 [2019-11-16 00:06:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:36,674 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 992 transitions. [2019-11-16 00:06:36,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 992 transitions. [2019-11-16 00:06:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-16 00:06:36,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:36,677 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:36,678 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1163152431, now seen corresponding path program 1 times [2019-11-16 00:06:36,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:36,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403737841] [2019-11-16 00:06:36,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:36,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:36,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-16 00:06:36,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403737841] [2019-11-16 00:06:36,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:36,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:36,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434300028] [2019-11-16 00:06:36,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:36,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:36,803 INFO L87 Difference]: Start difference. First operand 906 states and 992 transitions. Second operand 5 states. [2019-11-16 00:06:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:36,982 INFO L93 Difference]: Finished difference Result 1320 states and 1453 transitions. [2019-11-16 00:06:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:36,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2019-11-16 00:06:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:36,984 INFO L225 Difference]: With dead ends: 1320 [2019-11-16 00:06:36,984 INFO L226 Difference]: Without dead ends: 1106 [2019-11-16 00:06:36,985 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:06:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-16 00:06:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 896. [2019-11-16 00:06:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-16 00:06:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 973 transitions. [2019-11-16 00:06:37,054 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 973 transitions. Word has length 260 [2019-11-16 00:06:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:37,055 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 973 transitions. [2019-11-16 00:06:37,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 973 transitions. [2019-11-16 00:06:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-11-16 00:06:37,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:37,058 INFO L380 BasicCegarLoop]: trace histogram [6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:37,058 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1173960251, now seen corresponding path program 1 times [2019-11-16 00:06:37,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:37,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538962444] [2019-11-16 00:06:37,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:37,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:37,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 15 proven. 160 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-16 00:06:37,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538962444] [2019-11-16 00:06:37,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505201095] [2019-11-16 00:06:37,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/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:06:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:37,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:06:37,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-16 00:06:38,723 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:38,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-11-16 00:06:38,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404415456] [2019-11-16 00:06:38,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-16 00:06:38,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:06:38,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:06:38,728 INFO L87 Difference]: Start difference. First operand 896 states and 973 transitions. Second operand 29 states. [2019-11-16 00:06:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:40,207 INFO L93 Difference]: Finished difference Result 1472 states and 1599 transitions. [2019-11-16 00:06:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:06:40,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 318 [2019-11-16 00:06:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:40,209 INFO L225 Difference]: With dead ends: 1472 [2019-11-16 00:06:40,209 INFO L226 Difference]: Without dead ends: 1470 [2019-11-16 00:06:40,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:06:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-11-16 00:06:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 994. [2019-11-16 00:06:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-16 00:06:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1075 transitions. [2019-11-16 00:06:40,358 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1075 transitions. Word has length 318 [2019-11-16 00:06:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:40,359 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1075 transitions. [2019-11-16 00:06:40,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-16 00:06:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1075 transitions. [2019-11-16 00:06:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-16 00:06:40,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:40,364 INFO L380 BasicCegarLoop]: trace histogram [7, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:40,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:40,577 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1814260282, now seen corresponding path program 1 times [2019-11-16 00:06:40,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:40,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634689922] [2019-11-16 00:06:40,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:40,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:40,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 122 proven. 79 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-16 00:06:40,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634689922] [2019-11-16 00:06:40,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253780076] [2019-11-16 00:06:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/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:06:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:41,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:06:41,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-16 00:06:41,357 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:41,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 15 [2019-11-16 00:06:41,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740582478] [2019-11-16 00:06:41,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:06:41,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:06:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:06:41,360 INFO L87 Difference]: Start difference. First operand 994 states and 1075 transitions. Second operand 15 states. [2019-11-16 00:06:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:42,565 INFO L93 Difference]: Finished difference Result 1725 states and 1889 transitions. [2019-11-16 00:06:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-16 00:06:42,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 364 [2019-11-16 00:06:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:42,568 INFO L225 Difference]: With dead ends: 1725 [2019-11-16 00:06:42,568 INFO L226 Difference]: Without dead ends: 1521 [2019-11-16 00:06:42,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=434, Invalid=2116, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:06:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-11-16 00:06:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 992. [2019-11-16 00:06:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-16 00:06:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1070 transitions. [2019-11-16 00:06:42,673 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1070 transitions. Word has length 364 [2019-11-16 00:06:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:42,674 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1070 transitions. [2019-11-16 00:06:42,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:06:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1070 transitions. [2019-11-16 00:06:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-16 00:06:42,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:42,677 INFO L380 BasicCegarLoop]: trace histogram [8, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:42,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:42,877 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash -73771068, now seen corresponding path program 1 times [2019-11-16 00:06:42,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:42,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082571773] [2019-11-16 00:06:42,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:42,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 26 proven. 395 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:06:43,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082571773] [2019-11-16 00:06:43,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646184947] [2019-11-16 00:06:43,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/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:06:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:43,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:06:43,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:06:44,668 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:44,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 40 [2019-11-16 00:06:44,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764001329] [2019-11-16 00:06:44,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-16 00:06:44,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-16 00:06:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:06:44,672 INFO L87 Difference]: Start difference. First operand 992 states and 1070 transitions. Second operand 40 states. [2019-11-16 00:06:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:47,675 INFO L93 Difference]: Finished difference Result 1689 states and 1833 transitions. [2019-11-16 00:06:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-16 00:06:47,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 424 [2019-11-16 00:06:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:47,677 INFO L225 Difference]: With dead ends: 1689 [2019-11-16 00:06:47,677 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:06:47,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 432 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1130, Invalid=7800, Unknown=0, NotChecked=0, Total=8930 [2019-11-16 00:06:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:06:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:06:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:06:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:06:47,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 424 [2019-11-16 00:06:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:47,683 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:47,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-16 00:06:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:06:47,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:06:47,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:47,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:06:48,033 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2019-11-16 00:06:48,736 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-11-16 00:06:49,351 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 298 [2019-11-16 00:06:50,416 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 378 DAG size of output: 289 [2019-11-16 00:06:50,638 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 163 [2019-11-16 00:06:51,479 WARN L191 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-11-16 00:06:51,656 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 187 [2019-11-16 00:06:51,999 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 206 [2019-11-16 00:06:52,246 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 222 [2019-11-16 00:06:54,001 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-11-16 00:06:55,448 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-11-16 00:06:55,805 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-11-16 00:06:56,036 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 225 [2019-11-16 00:06:56,319 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 276 [2019-11-16 00:06:56,675 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-11-16 00:06:56,938 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 229 [2019-11-16 00:06:58,212 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 497 DAG size of output: 414 [2019-11-16 00:06:58,373 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 204 [2019-11-16 00:06:58,608 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 204 [2019-11-16 00:06:58,733 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 156 [2019-11-16 00:07:00,080 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-11-16 00:07:01,579 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 737 DAG size of output: 481 [2019-11-16 00:07:01,727 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 147 [2019-11-16 00:07:02,164 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-11-16 00:07:02,516 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-11-16 00:07:02,848 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-11-16 00:07:03,058 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 206 [2019-11-16 00:07:03,218 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 191 [2019-11-16 00:07:07,416 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 1345 DAG size of output: 822 [2019-11-16 00:07:09,711 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 973 DAG size of output: 582 [2019-11-16 00:07:11,031 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 737 DAG size of output: 481 [2019-11-16 00:07:11,348 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 206 [2019-11-16 00:07:11,677 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 232 [2019-11-16 00:07:11,840 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 252 [2019-11-16 00:07:13,427 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-11-16 00:07:14,042 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 309 [2019-11-16 00:07:14,611 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-11-16 00:07:15,178 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-11-16 00:07:15,841 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 420 DAG size of output: 326 [2019-11-16 00:07:16,041 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 135 [2019-11-16 00:07:16,167 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 135 [2019-11-16 00:07:16,271 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 135 [2019-11-16 00:07:16,560 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 143 [2019-11-16 00:07:16,772 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 242 [2019-11-16 00:07:16,989 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 231 [2019-11-16 00:07:17,615 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-11-16 00:07:17,913 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 240 [2019-11-16 00:07:18,447 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-11-16 00:07:18,786 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-11-16 00:07:22,129 WARN L191 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 1216 DAG size of output: 731 [2019-11-16 00:07:22,651 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-11-16 00:07:24,603 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-11-16 00:07:26,132 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 281 DAG size of output: 81 [2019-11-16 00:07:27,484 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 277 DAG size of output: 99 [2019-11-16 00:07:28,073 WARN L191 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 95 [2019-11-16 00:07:29,628 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-11-16 00:07:30,255 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 91 [2019-11-16 00:07:30,990 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 100 [2019-11-16 00:07:32,033 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2019-11-16 00:07:35,693 WARN L191 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 465 DAG size of output: 158 [2019-11-16 00:07:36,057 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2019-11-16 00:07:39,593 WARN L191 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 465 DAG size of output: 158 [2019-11-16 00:07:40,029 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-11-16 00:07:41,717 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-11-16 00:07:42,013 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-11-16 00:07:42,770 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 82 [2019-11-16 00:07:43,883 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 265 DAG size of output: 82 [2019-11-16 00:07:44,337 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-11-16 00:07:46,200 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-11-16 00:07:46,942 WARN L191 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 99 [2019-11-16 00:07:47,221 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2019-11-16 00:07:50,496 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 396 DAG size of output: 120 [2019-11-16 00:07:50,683 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:07:51,458 WARN L191 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 94 [2019-11-16 00:07:52,153 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 84 [2019-11-16 00:07:52,341 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:07:53,125 WARN L191 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 94 [2019-11-16 00:07:53,302 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-16 00:07:53,730 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 81 [2019-11-16 00:07:57,486 WARN L191 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 465 DAG size of output: 158 [2019-11-16 00:07:57,848 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-16 00:07:58,891 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-11-16 00:08:02,661 WARN L191 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 468 DAG size of output: 158 [2019-11-16 00:08:03,205 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 82 [2019-11-16 00:08:03,546 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-16 00:08:04,268 WARN L191 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 87 [2019-11-16 00:08:06,140 WARN L191 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-11-16 00:08:06,602 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-11-16 00:08:08,469 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-11-16 00:08:08,928 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-11-16 00:08:09,984 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-11-16 00:08:10,245 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-11-16 00:08:10,763 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 25 [2019-11-16 00:08:10,951 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:08:11,798 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 94 [2019-11-16 00:08:12,788 WARN L191 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 92 [2019-11-16 00:08:19,476 WARN L191 SmtUtils]: Spent 6.68 s on a formula simplification. DAG size of input: 794 DAG size of output: 158 [2019-11-16 00:08:19,665 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:08:20,263 WARN L191 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 69 [2019-11-16 00:08:24,423 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 563 DAG size of output: 161 [2019-11-16 00:08:28,221 WARN L191 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 468 DAG size of output: 158 [2019-11-16 00:08:28,572 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-16 00:08:28,931 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2019-11-16 00:08:29,271 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-16 00:08:30,181 WARN L191 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 74 [2019-11-16 00:08:30,691 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 66 [2019-11-16 00:08:30,927 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-11-16 00:08:31,741 WARN L191 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 102 [2019-11-16 00:08:32,600 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 103 [2019-11-16 00:08:32,861 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-11-16 00:08:33,138 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:08:33,327 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:08:34,340 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-11-16 00:08:34,574 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2019-11-16 00:08:38,134 WARN L191 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 465 DAG size of output: 158 [2019-11-16 00:08:40,258 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 300 DAG size of output: 105 [2019-11-16 00:08:40,601 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-16 00:08:41,928 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-11-16 00:08:42,218 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-16 00:08:43,446 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-11-16 00:08:44,846 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 310 DAG size of output: 108 [2019-11-16 00:08:44,991 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-11-16 00:08:45,199 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-11-16 00:08:45,516 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-11-16 00:08:45,724 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-11-16 00:08:45,988 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-11-16 00:08:46,359 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2019-11-16 00:08:47,124 WARN L191 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 85 [2019-11-16 00:08:47,708 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 85 [2019-11-16 00:08:48,347 WARN L191 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 82 [2019-11-16 00:08:49,569 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-11-16 00:08:50,581 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 237 DAG size of output: 94 [2019-11-16 00:08:51,818 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-11-16 00:08:53,410 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-11-16 00:08:57,875 WARN L191 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 703 DAG size of output: 160 [2019-11-16 00:08:57,877 INFO L439 ceAbstractionStarter]: At program point L432(lines 425 451) 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))) (let ((.cse5 (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4))) (.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))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (= ULTIMATE.start_m_run_~a~0 0) .cse5) (<= 50 ~c_req_d~0) .cse6 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~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) .cse6 (<= ~c_req_d~0 51) .cse7 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,877 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1295) no Hoare annotation was computed. [2019-11-16 00:08:57,877 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 238) no Hoare annotation was computed. [2019-11-16 00:08:57,877 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 965) no Hoare annotation was computed. [2019-11-16 00:08:57,877 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,878 INFO L439 ceAbstractionStarter]: At program point L169(lines 139 170) the Hoare annotation is: (let ((.cse21 (= ~a_t~0 0)) (.cse23 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse2 (= ~s_run_pc~0 2)) (.cse6 (= ~c_empty_req~0 1)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse9 (= 0 ~s_run_pc~0)) (.cse13 (let ((.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse25 (and (= ~s_memory0~0 50) (and (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse19 .cse0 .cse20 .cse2 (and (= 3 ~m_run_pc~0) .cse6 .cse10 .cse3 .cse4))))) (.cse26 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse24 .cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse26) (and .cse24 .cse21 .cse25 .cse23 .cse26)))) (.cse14 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse18 (= 0 ~c_req_a~0)) (.cse5 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (<= ~m_run_pc~0 0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse17 (= 0 ~c_req_type~0)) (.cse22 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse4 .cse3 .cse11 .cse12) (and (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) .cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse14 .cse15) (and .cse16 .cse7 .cse8 .cse17 .cse9 .cse3 .cse18 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse19 .cse20 .cse21 .cse10 .cse22 .cse4 .cse12) (and .cse13 .cse14 .cse23 .cse15) (and .cse16 .cse18 (and .cse5 .cse6 .cse19 .cse7 .cse8 .cse0 .cse20 .cse1 .cse10 .cse4 .cse3 .cse12) .cse17 .cse21 .cse22 .cse11)))) [2019-11-16 00:08:57,878 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 123) no Hoare annotation was computed. [2019-11-16 00:08:57,878 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1081) no Hoare annotation was computed. [2019-11-16 00:08:57,878 INFO L439 ceAbstractionStarter]: At program point L566(lines 559 612) the Hoare annotation is: (let ((.cse18 (= ~a_t~0 0)) (.cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= 0 ~a_t~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse13 (= ~s_run_pc~0 2))) (let ((.cse2 (not .cse13)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse14 (let ((.cse19 (<= 1 ~c_req_a~0)) (.cse20 (and (and (= 6 ~m_run_pc~0) (and .cse11 (and .cse0 .cse12 (and .cse3 .cse4) .cse13))) (= ULTIMATE.start_s_run_~req_type~1 0) .cse5 .cse6 .cse7)) (.cse21 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse22 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse23 (<= ~c_req_a~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse19 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse21 .cse18 .cse22 .cse23 .cse24) (and .cse19 .cse20 (< 0 ULTIMATE.start_s_memory_read_~i) .cse21 .cse9 .cse22 .cse10 .cse23 .cse24)))) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse15 (= ULTIMATE.start_m_run_~a~0 1)) (.cse8 (= ~s_memory1~0 51)) (.cse17 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= 0 ~c_req_a~0) .cse5 .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse8 .cse9 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse10 (and (= ULTIMATE.start_m_run_~a~0 0) .cse11 (and .cse0 .cse12 .cse13 (and (= 3 ~m_run_pc~0) .cse3 .cse4))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse14 .cse15 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse16 (= 51 ~c_rsp_d~0) .cse17) (and (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) .cse0 .cse1) (and .cse14 .cse16 .cse15 .cse8 .cse18 .cse17)))) [2019-11-16 00:08:57,878 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-16 00:08:57,878 INFO L439 ceAbstractionStarter]: At program point L104(lines 96 838) 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:08:57,878 INFO L443 ceAbstractionStarter]: For program point L1029(lines 1029 1033) no Hoare annotation was computed. [2019-11-16 00:08:57,879 INFO L439 ceAbstractionStarter]: At program point L633-2(lines 633 661) the Hoare annotation is: (let ((.cse5 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (<= 0 ~a_t~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (= 6 ~m_run_pc~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse28 (and .cse5 .cse4)) (.cse29 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2))) (let ((.cse22 (<= 1 ~c_req_a~0)) (.cse26 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse17 (= ~s_memory0~0 50)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse16 (= 0 ~c_req_type~0)) (.cse30 (let ((.cse31 (and .cse2 .cse28 .cse29 .cse7))) (or (and .cse27 .cse1 .cse31) (and (and .cse1 .cse31 .cse8) .cse0)))) (.cse21 (<= ~c_req_a~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~s_run_st~0))) (let ((.cse13 (= ~a_t~0 0)) (.cse23 (and .cse3 .cse2 .cse1 .cse6 .cse0 .cse29 .cse7 .cse4 .cse8)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse9 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (and .cse22 .cse26 (and .cse17 (and .cse15 .cse16 .cse30)) .cse21 .cse24)) (.cse12 (= ~s_memory1~0 51)) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (= ~req_tt_a~0 1))) (or (and .cse0 (and .cse1 (and .cse2 (and .cse3 .cse4 .cse5) .cse6 .cse7) .cse8)) (and .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~a~0 1) .cse12 .cse13 .cse14) (and (and .cse4 (not .cse7) .cse5) .cse6 (<= 2 ~s_run_pc~0)) (and .cse9 .cse15 .cse16 .cse17 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse18 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse19 .cse20 .cse21 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse10 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse23 .cse24) (and .cse15 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 .cse12 .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse13 .cse14 .cse23 .cse24) (and .cse1 (and (and .cse2 .cse6 .cse28 .cse7) .cse29) .cse8) (and (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (and .cse27 .cse18 .cse19 (and (and (= 0 ~c_req_a~0) .cse30 .cse16) .cse17 .cse25))) (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse20)))))) [2019-11-16 00:08:57,879 INFO L439 ceAbstractionStarter]: At program point L766(lines 759 803) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,879 INFO L439 ceAbstractionStarter]: At program point L700(lines 693 719) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 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)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,879 INFO L443 ceAbstractionStarter]: For program point L634(lines 633 661) no Hoare annotation was computed. [2019-11-16 00:08:57,879 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 572) no Hoare annotation was computed. [2019-11-16 00:08:57,880 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 122) no Hoare annotation was computed. [2019-11-16 00:08:57,880 INFO L439 ceAbstractionStarter]: At program point L899(lines 873 900) the Hoare annotation is: (let ((.cse0 (<= 0 ~a_t~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse4 (<= ~c_req_type~0 1)) (.cse7 (= 3 ~m_run_pc~0)) (.cse8 (<= 1 ~c_req_type~0)) (.cse15 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse2 (<= 1 ~c_req_a~0)) (.cse18 (= 0 ~c_req_type~0)) (.cse19 (and (and .cse0 .cse3 (and .cse9 .cse10) .cse5 .cse6 .cse12) (= 6 ~m_run_pc~0))) (.cse1 (= ~s_memory0~0 50)) (.cse11 (<= ~c_req_a~0 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (= ~s_memory1~0 51)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 (and .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) .cse11 .cse12)) (<= ~c_req_d~0 51) (<= 51 ~c_req_d~0)) (and (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse3 .cse4 .cse5 (let ((.cse13 (<= ~c_req_a~0 0)) (.cse14 (<= 0 ~c_req_a~0))) (or (and .cse7 .cse13 .cse14 .cse8 (<= 2 ~s_run_pc~0) .cse9 .cse10) (and .cse7 .cse13 .cse14 .cse8 (= 0 ~s_run_pc~0) .cse9 .cse10)))) .cse15) .cse16) (and .cse15 .cse17 (and .cse18 (and (= 0 ~c_req_a~0) .cse19)) (= ~req_tt_a~0 0) .cse1 .cse20 .cse16 .cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse2 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse18 .cse19) .cse1 .cse11 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse17 .cse20 .cse21 (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,880 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 639) no Hoare annotation was computed. [2019-11-16 00:08:57,880 INFO L439 ceAbstractionStarter]: At program point L107(lines 96 838) the Hoare annotation is: (let ((.cse28 (<= ~c_req_a~0 0)) (.cse29 (<= 0 ~c_req_a~0)) (.cse31 (= ~c_empty_req~0 1)) (.cse23 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse8 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse16 (= 3 ~m_run_pc~0)) (.cse30 (<= 1 ~c_req_type~0)) (.cse27 (<= ~c_req_type~0 1)) (.cse1 (= ~s_memory0~0 50)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (= ~s_run_pc~0 2)) (.cse17 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse22 (let ((.cse32 (and .cse16 .cse30 .cse27 .cse1 .cse18 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse11 .cse14 .cse15 .cse17))) (or (and .cse32 .cse23) (and .cse32 .cse7 .cse8)))) (.cse12 (<= 0 ~a_t~0)) (.cse3 (<= ~c_req_d~0 51)) (.cse9 (<= 51 ~c_req_d~0)) (.cse10 (and .cse16 .cse31 .cse17)) (.cse13 (<= 2 ~s_run_st~0)) (.cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (and .cse28 .cse29 (and .cse16 .cse30 .cse17 .cse18))) (.cse21 (= 0 ~s_run_pc~0)) (.cse24 (<= ~c_req_d~0 50)) (.cse25 (<= 50 ~c_req_d~0)) (.cse26 (= ~a_t~0 0)) (.cse19 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse13 (and .cse16 .cse17 (not .cse15) .cse18) .cse19) (and .cse20 .cse13 .cse21) (and .cse22 .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse22 .cse12 .cse2 .cse3 .cse9 .cse23) (and .cse16 .cse11 .cse13 .cse19 .cse17 .cse18) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse23 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse24 .cse10 .cse25 .cse11 .cse13 .cse2 .cse14 .cse26 .cse6 .cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse24 .cse25 .cse11 .cse20 .cse27 .cse21 .cse14 .cse26) (and .cse24 .cse25 (and (and .cse16 .cse28 .cse29 .cse30 .cse11 .cse27 .cse14 .cse15 .cse17 .cse18) .cse26)) (and (and .cse16 .cse31 .cse17 .cse18) .cse19)))) [2019-11-16 00:08:57,880 INFO L439 ceAbstractionStarter]: At program point L173-2(lines 173 201) the Hoare annotation is: (let ((.cse16 (= ~a_t~0 0)) (.cse21 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 2 ~s_run_st~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse12 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse15 (= 0 ~c_req_type~0)) (.cse18 (= 0 ~s_run_pc~0)) (.cse1 (= 0 ~c_req_a~0)) (.cse6 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse4 (<= 2 ~s_run_pc~0)) (.cse19 (let ((.cse24 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (and (= ~s_memory0~0 50) (and (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (and .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 (and (= 3 ~m_run_pc~0) .cse7 .cse5 .cse13))))) (.cse27 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse24 .cse25 .cse16 .cse26 .cse21 .cse27) (and .cse24 .cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse26 .cse27)))) (.cse20 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse22 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse2 .cse3 .cse9 .cse18 .cse12 .cse13 .cse5 (<= 0 ULTIMATE.start_m_run_~a~0) .cse14) (and .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse15 .cse18 .cse5 .cse1 .cse7 .cse6 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse13 .cse14) (and .cse9 (and (not .cse23) .cse5 .cse13) .cse4) (and (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) .cse19 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse20 .cse22)))) [2019-11-16 00:08:57,880 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 772) no Hoare annotation was computed. [2019-11-16 00:08:57,880 INFO L443 ceAbstractionStarter]: For program point L702(lines 702 706) no Hoare annotation was computed. [2019-11-16 00:08:57,881 INFO L439 ceAbstractionStarter]: At program point L1297(lines 1290 1307) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (= ~s_memory0~0 50)) (.cse27 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse33 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse52 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse37 (= 0 ~c_req_type~0)) (.cse35 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse34 (= ~s_run_pc~0 2)) (.cse36 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse32 (= 6 ~m_run_pc~0))) (let ((.cse24 (and .cse46 .cse37 (and (and .cse35 (and .cse12 .cse4 (and .cse2 .cse7) .cse15 .cse34) .cse36) .cse32))) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse26 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~req_tt_a~0 1)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse38 (= 0 ~c_req_a~0)) (.cse45 (and .cse32 (and .cse35 (and .cse12 .cse33 .cse15 .cse34) .cse36))) (.cse22 (= ~req_tt_a~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse39 (<= 2 ~s_run_pc~0)) (.cse47 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ~c_req_d~0 51)) (.cse48 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse42 (<= 51 ~c_req_d~0)) (.cse43 (let ((.cse53 (and .cse17 (and .cse27 (and .cse12 .cse13 .cse15 .cse34 .cse54) .cse30 .cse36)))) (or (and .cse53 .cse44) (and .cse53 .cse28 .cse29)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (and (and .cse52 .cse2 .cse7) .cse12 .cse4 .cse15 .cse34)) (.cse50 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse11 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 50 ~c_rsp_d~0) .cse16 .cse23 .cse24 .cse25) (and .cse26 .cse21 (and .cse27 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse28 .cse29 .cse24 .cse30 .cse25) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse23 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse32 (and (and (and .cse12 .cse4 .cse33 .cse34) .cse15) .cse35 .cse36)) (and .cse3 .cse37 .cse5 .cse8 .cse38 .cse2 .cse12 .cse16 .cse6 .cse7) (and .cse4 .cse39 (and .cse7 (not .cse34) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse34))) .cse16) (and .cse35 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse3 .cse37 .cse8 .cse38 .cse2 .cse12 .cse4 .cse16 .cse34 .cse6 .cse7) (and .cse26 .cse21 (and .cse27 .cse20 (and .cse45 .cse46 .cse37) .cse17 .cse30 .cse25) .cse18 .cse23 .cse31) (and .cse47 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 (and (and .cse51 .cse36) .cse35 .cse17 .cse28 .cse29)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse37 (and .cse38 .cse45)) .cse22 .cse17 .cse40 .cse48 .cse18 .cse16 .cse50 .cse28 .cse29 .cse19) (and .cse39 (and .cse52 .cse2 .cse7 .cse8)) (and .cse47 .cse35 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 .cse43) (and .cse32 (and .cse35 (and .cse2 .cse12 .cse4 .cse34 .cse7 .cse8) .cse36)) (and (and .cse9 .cse10 (and .cse11 .cse51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse50 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse40 .cse16 .cse44) (and (and .cse52 .cse7 .cse8) .cse12 .cse4 .cse34))))) [2019-11-16 00:08:57,881 INFO L439 ceAbstractionStarter]: At program point L240(lines 233 259) the Hoare annotation is: (let ((.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse30 (<= 1 ~c_req_type~0)) (.cse32 (and (= 3 ~m_run_pc~0) .cse11 .cse12)) (.cse31 (and (<= ~m_run_pc~0 0) .cse12 .cse11))) (let ((.cse8 (= ~a_t~0 0)) (.cse26 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse16 (and .cse30 (or .cse32 .cse31))) (.cse13 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse6 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse10 (= ~s_run_pc~0 2)) (.cse15 (<= ~c_req_a~0 0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (and .cse15 (<= ULTIMATE.start_m_run_~a~0 0) .cse17 .cse18 (and .cse30 .cse14 (or .cse31 .cse32)) (<= 0 ULTIMATE.start_m_run_~a~0) .cse19)) (.cse5 (= 0 ~s_run_pc~0)) (.cse20 (let ((.cse27 (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (and .cse16 .cse13 .cse4 .cse6 .cse7 .cse10 .cse14) (<= ~c_req_a~0 1)) (= ~s_memory0~0 50))) (.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse27 .cse28 .cse8 .cse26 .cse29) (and .cse27 .cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29)))) (.cse21 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= ~c_req_d~0 51)) (.cse23 (<= 51 ~c_req_d~0)) (.cse24 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse25 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (and (not .cse10) .cse11 .cse12) .cse13 (<= 2 ~s_run_pc~0)) (and .cse0 .cse1 .cse2 .cse8 (and (and .cse13 .cse4 .cse6 .cse7 .cse10 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19)) (= ULTIMATE.start_m_run_~a~0 0)) .cse9) (and .cse20 .cse21 .cse22 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse23 .cse24 .cse25) (and .cse3 .cse13 .cse5) (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse25)))))) [2019-11-16 00:08:57,881 INFO L443 ceAbstractionStarter]: For program point L174(lines 173 201) no Hoare annotation was computed. [2019-11-16 00:08:57,882 INFO L439 ceAbstractionStarter]: At program point L967(lines 960 977) the Hoare annotation is: (let ((.cse2 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse5 (<= ~c_req_type~0 1)) (.cse8 (= 3 ~m_run_pc~0)) (.cse9 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ~c_req_a~0)) (.cse26 (and (and .cse2 (and (and .cse10 .cse11 .cse12) .cse3 .cse6 .cse7) .cse15) (= 6 ~m_run_pc~0))) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse14 (<= ~c_req_a~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (= 1 ULTIMATE.start_s_run_~req_a~1) .cse14 .cse15)) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse16 (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse17 (and .cse3 .cse5 (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0))) (or (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (<= 2 ~s_run_pc~0) .cse20 .cse11 .cse12) (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (= 0 ~s_run_pc~0) .cse20 .cse11 .cse12))) .cse6 .cse13) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse17 .cse21 (= ~req_tt_a~0 0) .cse0 .cse22 .cse16 .cse23 (and (= 0 ~c_req_a~0) .cse24 .cse25 .cse20 .cse26) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse21 .cse22 .cse23 (and .cse1 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse26 .cse24 .cse25) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,882 INFO L443 ceAbstractionStarter]: For program point L1298(lines 1250 1339) no Hoare annotation was computed. [2019-11-16 00:08:57,882 INFO L443 ceAbstractionStarter]: For program point L1232(lines 1232 1236) no Hoare annotation was computed. [2019-11-16 00:08:57,882 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 179) no Hoare annotation was computed. [2019-11-16 00:08:57,882 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 121) no Hoare annotation was computed. [2019-11-16 00:08:57,882 INFO L443 ceAbstractionStarter]: For program point L968(lines 960 977) no Hoare annotation was computed. [2019-11-16 00:08:57,883 INFO L439 ceAbstractionStarter]: At program point L440(lines 433 450) 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))) (let ((.cse5 (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4))) (.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))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (= ULTIMATE.start_m_run_~a~0 0) .cse5) (<= 50 ~c_req_d~0) .cse6 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~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) .cse6 (<= ~c_req_d~0 51) .cse7 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,883 INFO L443 ceAbstractionStarter]: For program point L374(lines 374 378) no Hoare annotation was computed. [2019-11-16 00:08:57,883 INFO L443 ceAbstractionStarter]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2019-11-16 00:08:57,883 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-11-16 00:08:57,883 INFO L443 ceAbstractionStarter]: For program point L1167(lines 1167 1171) no Hoare annotation was computed. [2019-11-16 00:08:57,883 INFO L439 ceAbstractionStarter]: At program point L110(lines 96 838) 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:08:57,883 INFO L443 ceAbstractionStarter]: For program point L1167-2(lines 1165 1344) no Hoare annotation was computed. [2019-11-16 00:08:57,884 INFO L439 ceAbstractionStarter]: At program point L1035(lines 1028 1081) the Hoare annotation is: (let ((.cse7 (= 3 ~m_run_pc~0)) (.cse25 (<= 0 ~a_t~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_req~0 1)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~a_t~0 0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse17 (= ~s_memory1~0 51)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (= 6 ~m_run_pc~0) (and .cse25 (and .cse5 .cse10 .cse9 .cse8) .cse26)) (= 0 ~c_req_type~0))) (.cse21 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse16 (= ~s_memory0~0 50)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (and .cse5 (and .cse7 .cse8) .cse10 .cse9)) (.cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 1 ~c_req_type~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (let ((.cse6 (and .cse7 .cse8 (not .cse9)))) (or (and .cse6 (<= 2 ~s_run_pc~0)) (and .cse6 (= 0 ~s_run_pc~0)))) (<= ~c_req_type~0 1) .cse10 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse11 .cse12) .cse13 .cse14 .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse2 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse14 .cse19 .cse20 .cse21) (and .cse2 .cse13 .cse14 (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse11 .cse12) .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse19 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse16 .cse23 .cse24 (<= ~c_req_a~0 1) .cse20 .cse21) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 (and .cse16 .cse23 .cse24 (and .cse22 .cse26)) .cse13 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (<= 51 ~c_req_d~0))))) [2019-11-16 00:08:57,884 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 973) no Hoare annotation was computed. [2019-11-16 00:08:57,884 INFO L443 ceAbstractionStarter]: For program point L441(lines 129 475) no Hoare annotation was computed. [2019-11-16 00:08:57,884 INFO L439 ceAbstractionStarter]: At program point L574(lines 567 611) the Hoare annotation is: (let ((.cse8 (= ~a_t~0 0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse10 (<= 0 ~a_t~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse9 (= 0 ~c_req_type~0)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (let ((.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (let ((.cse16 (<= 1 ~c_req_a~0)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (and (and (and .cse10 .cse0 (and .cse2 .cse3) .cse11 .cse1) (= 6 ~m_run_pc~0)) (= ULTIMATE.start_s_run_~req_type~1 0) .cse9 .cse12 .cse13)) (.cse20 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= ~c_req_a~0 1)) (.cse23 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse16 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse17 .cse18 .cse19 .cse8 .cse20 .cse21 .cse22 .cse23) (and .cse16 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse18 .cse19 .cse14 .cse20 .cse15 .cse21 .cse22 .cse23)))) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory1~0 51))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 51 ~c_rsp_d~0) .cse7) (and .cse6 .cse4 .cse8 .cse5 .cse7) (and (= 0 ~c_req_a~0) .cse9 (and (= ULTIMATE.start_m_run_~a~0 0) .cse10 (and .cse0 (and (= 3 ~m_run_pc~0) .cse2 .cse3) .cse11 .cse1)) .cse12 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse4 .cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse15 (= 0 ULTIMATE.start_m_run_~req_a___0~0))))) [2019-11-16 00:08:57,884 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-11-16 00:08:57,884 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2019-11-16 00:08:57,885 INFO L443 ceAbstractionStarter]: For program point L1037(lines 1037 1041) no Hoare annotation was computed. [2019-11-16 00:08:57,885 INFO L439 ceAbstractionStarter]: At program point L113(lines 96 838) 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:08:57,885 INFO L443 ceAbstractionStarter]: For program point L906(lines 906 959) no Hoare annotation was computed. [2019-11-16 00:08:57,885 INFO L439 ceAbstractionStarter]: At program point L774(lines 767 802) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,885 INFO L439 ceAbstractionStarter]: At program point L708(lines 701 718) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 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)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,885 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-16 00:08:57,885 INFO L446 ceAbstractionStarter]: At program point L1369(lines 1346 1371) the Hoare annotation is: true [2019-11-16 00:08:57,886 INFO L439 ceAbstractionStarter]: At program point L312(lines 282 313) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= 3 ~m_run_pc~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse6 (and .cse0 .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse5 .cse7 .cse8) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-11-16 00:08:57,886 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 911) no Hoare annotation was computed. [2019-11-16 00:08:57,886 INFO L443 ceAbstractionStarter]: For program point L709(lines 480 832) no Hoare annotation was computed. [2019-11-16 00:08:57,886 INFO L439 ceAbstractionStarter]: At program point L1238(lines 1231 1248) 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 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 0) .cse3 .cse4))) [2019-11-16 00:08:57,886 INFO L443 ceAbstractionStarter]: For program point L1172-1(lines 1165 1344) no Hoare annotation was computed. [2019-11-16 00:08:57,886 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2019-11-16 00:08:57,886 INFO L443 ceAbstractionStarter]: For program point L776(lines 776 780) no Hoare annotation was computed. [2019-11-16 00:08:57,886 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 714) no Hoare annotation was computed. [2019-11-16 00:08:57,887 INFO L439 ceAbstractionStarter]: At program point L380(lines 373 390) the Hoare annotation is: (let ((.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)) (.cse2 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:08:57,889 INFO L439 ceAbstractionStarter]: At program point L248(lines 241 258) the Hoare annotation is: (let ((.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse30 (<= 1 ~c_req_type~0)) (.cse32 (and (= 3 ~m_run_pc~0) .cse11 .cse12)) (.cse31 (and (<= ~m_run_pc~0 0) .cse12 .cse11))) (let ((.cse8 (= ~a_t~0 0)) (.cse26 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse16 (and .cse30 (or .cse32 .cse31))) (.cse13 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse6 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse10 (= ~s_run_pc~0 2)) (.cse15 (<= ~c_req_a~0 0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (and .cse15 (<= ULTIMATE.start_m_run_~a~0 0) .cse17 .cse18 (and .cse30 .cse14 (or .cse31 .cse32)) (<= 0 ULTIMATE.start_m_run_~a~0) .cse19)) (.cse5 (= 0 ~s_run_pc~0)) (.cse20 (let ((.cse27 (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (and .cse16 .cse13 .cse4 .cse6 .cse7 .cse10 .cse14) (<= ~c_req_a~0 1)) (= ~s_memory0~0 50))) (.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse27 .cse28 .cse8 .cse26 .cse29) (and .cse27 .cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29)))) (.cse21 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= ~c_req_d~0 51)) (.cse23 (<= 51 ~c_req_d~0)) (.cse24 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse25 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (and (not .cse10) .cse11 .cse12) .cse13 (<= 2 ~s_run_pc~0)) (and .cse0 .cse1 .cse2 .cse8 (and (and .cse13 .cse4 .cse6 .cse7 .cse10 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19)) (= ULTIMATE.start_m_run_~a~0 0)) .cse9) (and .cse20 .cse21 .cse22 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse23 .cse24 .cse25) (and .cse3 .cse13 .cse5) (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse25)))))) [2019-11-16 00:08:57,889 INFO L439 ceAbstractionStarter]: At program point L116(lines 96 838) the Hoare annotation is: (let ((.cse20 (<= 2 ~c_write_rsp_ev~0)) (.cse21 (= ~c_empty_rsp~0 1))) (let ((.cse26 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse0 (= 6 ~m_run_pc~0)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (and .cse20 .cse21))) (let ((.cse15 (<= 1 ~c_req_a~0)) (.cse14 (<= ~c_req_a~0 1)) (.cse13 (= ~req_tt_a~0 1)) (.cse23 (and .cse0 (and .cse1 (and .cse2 .cse6 .cse4 .cse5)))) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (= ~s_memory1~0 51)) (.cse22 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (= ~req_tt_a~0 0)) (.cse25 (= ~a_t~0 0)) (.cse17 (and .cse26 .cse2 .cse1 .cse3 .cse0 .cse6 .cse4 .cse20)) (.cse18 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse19 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 (and .cse1 (and (and .cse2 .cse3 .cse4 .cse5) .cse6))) (and .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse15 .cse16 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse17 .cse18 .cse19) (and .cse3 (<= 2 ~s_run_pc~0) .cse20 (not .cse4) (<= 3 ~m_run_pc~0) .cse21) (and .cse16 .cse10 .cse18 (and .cse15 .cse22 .cse7 .cse8 .cse9 .cse14 .cse23 .cse19) .cse13) (and (= 0 ~c_req_a~0) .cse23 .cse24 .cse8 .cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse25 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 .cse12) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse9 .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse16 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse24 (= 50 ~c_rsp_d~0) .cse25 .cse17 .cse18 .cse19) (and (and .cse1 (and .cse2 (and .cse26 .cse20 .cse21) .cse3 .cse4)) .cse0))))) [2019-11-16 00:08:57,889 INFO L443 ceAbstractionStarter]: For program point L381(lines 373 390) no Hoare annotation was computed. [2019-11-16 00:08:57,890 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,890 INFO L443 ceAbstractionStarter]: For program point L249(lines 129 475) no Hoare annotation was computed. [2019-11-16 00:08:57,890 INFO L443 ceAbstractionStarter]: For program point L1240(lines 1240 1244) no Hoare annotation was computed. [2019-11-16 00:08:57,890 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-11-16 00:08:57,890 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-11-16 00:08:57,891 INFO L439 ceAbstractionStarter]: At program point L1043(lines 1036 1080) the Hoare annotation is: (let ((.cse7 (= 3 ~m_run_pc~0)) (.cse25 (<= 0 ~a_t~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_req~0 1)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~a_t~0 0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse17 (= ~s_memory1~0 51)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (= 6 ~m_run_pc~0) (and .cse25 (and .cse5 .cse10 .cse9 .cse8) .cse26)) (= 0 ~c_req_type~0))) (.cse21 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse16 (= ~s_memory0~0 50)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (and .cse5 (and .cse7 .cse8) .cse10 .cse9)) (.cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 1 ~c_req_type~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (let ((.cse6 (and .cse7 .cse8 (not .cse9)))) (or (and .cse6 (<= 2 ~s_run_pc~0)) (and .cse6 (= 0 ~s_run_pc~0)))) (<= ~c_req_type~0 1) .cse10 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse11 .cse12) .cse13 .cse14 .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse2 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse14 .cse19 .cse20 .cse21) (and .cse2 .cse13 .cse14 (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse11 .cse12) .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse19 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse16 .cse23 .cse24 (<= ~c_req_a~0 1) .cse20 .cse21) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 (and .cse16 .cse23 .cse24 (and .cse22 .cse26)) .cse13 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (<= 51 ~c_req_d~0))))) [2019-11-16 00:08:57,891 INFO L439 ceAbstractionStarter]: At program point L582(lines 575 610) the Hoare annotation is: (let ((.cse15 (= ~a_t~0 0)) (.cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse4 (<= 0 ~a_t~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse5 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (let ((.cse13 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (= ~s_memory1~0 51)) (.cse12 (let ((.cse16 (<= 1 ~c_req_a~0)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (and (and (and .cse4 .cse0 (and .cse2 .cse3) .cse11 .cse1) (= 6 ~m_run_pc~0)) (= ULTIMATE.start_s_run_~req_type~1 0) .cse5 .cse6 .cse7)) (.cse20 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= ~c_req_a~0 1)) (.cse23 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse16 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse17 .cse18 .cse19 .cse15 .cse20 .cse21 .cse22 .cse23) (and .cse16 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse18 .cse19 .cse9 .cse20 .cse10 .cse21 .cse22 .cse23)))) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and .cse4 .cse5 .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (and (= ULTIMATE.start_m_run_~a~0 0) (and .cse0 (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse11 .cse1)) (= 0 ~c_req_a~0) (= 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)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (= 51 ~c_rsp_d~0) .cse14) (and .cse13 .cse8 .cse15 .cse12 .cse14)))) [2019-11-16 00:08:57,891 INFO L443 ceAbstractionStarter]: For program point L1045(lines 1045 1049) no Hoare annotation was computed. [2019-11-16 00:08:57,892 INFO L439 ceAbstractionStarter]: At program point L913(lines 906 959) the Hoare annotation is: (let ((.cse2 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse5 (<= ~c_req_type~0 1)) (.cse8 (= 3 ~m_run_pc~0)) (.cse9 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ~c_req_a~0)) (.cse26 (and (and .cse2 (and (and .cse10 .cse11 .cse12) .cse3 .cse6 .cse7) .cse15) (= 6 ~m_run_pc~0))) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse14 (<= ~c_req_a~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (= 1 ULTIMATE.start_s_run_~req_a~1) .cse14 .cse15)) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse16 (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse17 (and .cse3 .cse5 (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0))) (or (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (<= 2 ~s_run_pc~0) .cse20 .cse11 .cse12) (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (= 0 ~s_run_pc~0) .cse20 .cse11 .cse12))) .cse6 .cse13) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse17 .cse21 (= ~req_tt_a~0 0) .cse0 .cse22 .cse16 .cse23 (and (= 0 ~c_req_a~0) .cse24 .cse25 .cse20 .cse26) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse21 .cse22 .cse23 (and .cse1 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse26 .cse24 .cse25) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,892 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 372) no Hoare annotation was computed. [2019-11-16 00:08:57,892 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1182) no Hoare annotation was computed. [2019-11-16 00:08:57,892 INFO L443 ceAbstractionStarter]: For program point L980(lines 980 994) no Hoare annotation was computed. [2019-11-16 00:08:57,893 INFO L439 ceAbstractionStarter]: At program point L782(lines 775 801) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,893 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 588) no Hoare annotation was computed. [2019-11-16 00:08:57,893 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-16 00:08:57,893 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 919) no Hoare annotation was computed. [2019-11-16 00:08:57,893 INFO L439 ceAbstractionStarter]: At program point L519(lines 489 520) the Hoare annotation is: (let ((.cse10 (= ~a_t~0 0)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse18 (<= 0 ~a_t~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse17 (= ~s_run_pc~0 2))) (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse2 (not .cse17)) (.cse5 (let ((.cse19 (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) .cse11 .cse12 (and (= 6 ~m_run_pc~0) (and .cse18 (and (and .cse16 .cse3 .cse4) .cse15 .cse0 .cse17))))) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse19 .cse20 .cse10 .cse21 .cse22) (and (<= 1 ~c_req_a~0) .cse19 (< 0 ULTIMATE.start_s_memory_read_~i) .cse20 .cse13 .cse21 .cse14 (<= ~c_req_a~0 1) .cse22)))) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~s_memory1~0 51))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= 51 ~c_rsp_d~0) .cse9) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0))) (and .cse5 .cse8 .cse6 .cse7 .cse10 .cse9) (and .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse7 .cse13 .cse14 (<= 51 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (and (and .cse15 .cse0 (and (= 3 ~m_run_pc~0) .cse16 .cse3 .cse4) .cse17) .cse18) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))))) [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 788) no Hoare annotation was computed. [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1317) no Hoare annotation was computed. [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1114 1155) no Hoare annotation was computed. [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 62) no Hoare annotation was computed. [2019-11-16 00:08:57,894 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2019-11-16 00:08:57,895 INFO L439 ceAbstractionStarter]: At program point L126(lines 96 838) the Hoare annotation is: (let ((.cse3 (= 0 ~s_run_pc~0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse7 (<= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse11 (= ~a_t~0 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 .cse2 .cse7 .cse5 (not (= ~s_run_pc~0 2)) .cse6) (and .cse1 .cse8 .cse3 .cse6 .cse9 .cse0 .cse10 .cse11 .cse4 .cse5) (and .cse1 .cse8 .cse7 .cse6 .cse9 .cse0 .cse10 .cse2 .cse11 .cse4 .cse5))) [2019-11-16 00:08:57,895 INFO L439 ceAbstractionStarter]: At program point L1051(lines 1044 1079) the Hoare annotation is: (let ((.cse7 (= 3 ~m_run_pc~0)) (.cse25 (<= 0 ~a_t~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_req~0 1)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~a_t~0 0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse17 (= ~s_memory1~0 51)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (= 6 ~m_run_pc~0) (and .cse25 (and .cse5 .cse10 .cse9 .cse8) .cse26)) (= 0 ~c_req_type~0))) (.cse21 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse16 (= ~s_memory0~0 50)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (and .cse5 (and .cse7 .cse8) .cse10 .cse9)) (.cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 1 ~c_req_type~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (let ((.cse6 (and .cse7 .cse8 (not .cse9)))) (or (and .cse6 (<= 2 ~s_run_pc~0)) (and .cse6 (= 0 ~s_run_pc~0)))) (<= ~c_req_type~0 1) .cse10 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse11 .cse12) .cse13 .cse14 .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse2 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse14 .cse19 .cse20 .cse21) (and .cse2 .cse13 .cse14 (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse11 .cse12) .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse19 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse16 .cse23 .cse24 (<= ~c_req_a~0 1) .cse20 .cse21) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 (and .cse16 .cse23 .cse24 (and .cse22 .cse26)) .cse13 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (<= 51 ~c_req_d~0))))) [2019-11-16 00:08:57,896 INFO L439 ceAbstractionStarter]: At program point L523-2(lines 523 551) the Hoare annotation is: (let ((.cse2 (= ~a_t~0 0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse8 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (= ~c_empty_req~0 1)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~s_run_st~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse13 (= ~s_run_pc~0 2)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (let ((.cse1 (= ~s_memory1~0 51)) (.cse4 (let ((.cse19 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (and (and (and .cse9 (and .cse10 (and .cse14 .cse15 .cse16) .cse11 .cse12 .cse13)) (= 6 ~m_run_pc~0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) .cse5 .cse6)) (.cse22 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse23 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse19 .cse20 .cse21 .cse2 .cse22 .cse23 .cse24) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse19 .cse20 .cse21 .cse7 .cse22 .cse8 .cse23 (<= ~c_req_a~0 1) .cse24)))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse18 (not .cse13)) (.cse17 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse1 .cse7 .cse8 (<= 51 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (and .cse9 (and .cse10 .cse11 .cse12 .cse13 (and (= 3 ~m_run_pc~0) .cse14 .cse15 .cse16)))) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse17 .cse18 .cse15 .cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse4 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 (= 51 ~c_rsp_d~0) .cse3) (and (and .cse18 .cse15 .cse16 (<= 3 ~m_run_pc~0)) .cse11 .cse17)))) [2019-11-16 00:08:57,896 INFO L439 ceAbstractionStarter]: At program point L1184(lines 1177 1230) 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 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 0) .cse3 .cse4))) [2019-11-16 00:08:57,896 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 993) no Hoare annotation was computed. [2019-11-16 00:08:57,897 INFO L439 ceAbstractionStarter]: At program point L590(lines 583 609) the Hoare annotation is: (let ((.cse15 (= ~a_t~0 0)) (.cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse4 (<= 0 ~a_t~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse5 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (let ((.cse13 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (= ~s_memory1~0 51)) (.cse12 (let ((.cse16 (<= 1 ~c_req_a~0)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (and (and (and .cse4 .cse0 (and .cse2 .cse3) .cse11 .cse1) (= 6 ~m_run_pc~0)) (= ULTIMATE.start_s_run_~req_type~1 0) .cse5 .cse6 .cse7)) (.cse20 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= ~c_req_a~0 1)) (.cse23 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse16 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse17 .cse18 .cse19 .cse15 .cse20 .cse21 .cse22 .cse23) (and .cse16 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse18 .cse19 .cse9 .cse20 .cse10 .cse21 .cse22 .cse23)))) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and .cse4 .cse5 .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (and (= ULTIMATE.start_m_run_~a~0 0) (and .cse0 (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse11 .cse1)) (= 0 ~c_req_a~0) (= 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)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (= 51 ~c_rsp_d~0) .cse14) (and .cse13 .cse8 .cse15 .cse12 .cse14)))) [2019-11-16 00:08:57,897 INFO L443 ceAbstractionStarter]: For program point L524(lines 523 551) no Hoare annotation was computed. [2019-11-16 00:08:57,897 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-11-16 00:08:57,897 INFO L439 ceAbstractionStarter]: At program point L392-1(lines 392 398) the Hoare annotation is: (let ((.cse3 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (let ((.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse3 .cse1 .cse0 .cse2)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 (not .cse1) .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and (= ULTIMATE.start_m_run_~a~0 0) .cse4) .cse5 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (and (<= 0 ~a_t~0) .cse4) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse6 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,897 INFO L439 ceAbstractionStarter]: At program point L326(lines 319 372) the Hoare annotation is: (let ((.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)) (.cse2 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:08:57,898 INFO L443 ceAbstractionStarter]: For program point L1251(line 1251) no Hoare annotation was computed. [2019-11-16 00:08:57,898 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1123) no Hoare annotation was computed. [2019-11-16 00:08:57,898 INFO L443 ceAbstractionStarter]: For program point L1119-1(lines 1114 1155) no Hoare annotation was computed. [2019-11-16 00:08:57,898 INFO L443 ceAbstractionStarter]: For program point L1053(lines 1053 1057) no Hoare annotation was computed. [2019-11-16 00:08:57,898 INFO L439 ceAbstractionStarter]: At program point L921(lines 914 958) the Hoare annotation is: (let ((.cse2 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse5 (<= ~c_req_type~0 1)) (.cse8 (= 3 ~m_run_pc~0)) (.cse9 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ~c_req_a~0)) (.cse26 (and (and .cse2 (and (and .cse10 .cse11 .cse12) .cse3 .cse6 .cse7) .cse15) (= 6 ~m_run_pc~0))) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse14 (<= ~c_req_a~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (= 1 ULTIMATE.start_s_run_~req_a~1) .cse14 .cse15)) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse16 (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse17 (and .cse3 .cse5 (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0))) (or (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (<= 2 ~s_run_pc~0) .cse20 .cse11 .cse12) (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (= 0 ~s_run_pc~0) .cse20 .cse11 .cse12))) .cse6 .cse13) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse17 .cse21 (= ~req_tt_a~0 0) .cse0 .cse22 .cse16 .cse23 (and (= 0 ~c_req_a~0) .cse24 .cse25 .cse20 .cse26) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse21 .cse22 .cse23 (and .cse1 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse26 .cse24 .cse25) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,899 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-11-16 00:08:57,899 INFO L443 ceAbstractionStarter]: For program point L1186(lines 1186 1190) no Hoare annotation was computed. [2019-11-16 00:08:57,899 INFO L439 ceAbstractionStarter]: At program point L129-2(lines 129 475) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse20 (= ~s_run_pc~0 2))) (let ((.cse7 (= 0 ~c_req_type~0)) (.cse8 (= 0 ~c_req_a~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~a_t~0 0)) (.cse5 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse20)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse17 (and .cse11 .cse0 .cse20 (and (= 3 ~m_run_pc~0) .cse10 .cse1 .cse2 .cse4))) (.cse16 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= ~m_run_pc~0 0)) (.cse13 (= 0 ~s_run_pc~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5) (and .cse6 .cse7 .cse5 .cse4 .cse8 .cse9 .cse10 .cse11 .cse0 .cse12 .cse1 .cse2) (and .cse6 .cse7 .cse13 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse1 .cse2) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse14 .cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse15 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (and .cse17 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse18 .cse0 .cse5 .cse2 .cse3 .cse4 .cse19) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse14 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse15 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse17 (<= 0 ~a_t~0) .cse16)) (and (<= ~c_req_a~0 0) .cse18 (<= 0 ~c_req_a~0) .cse10 .cse6 .cse0 .cse13 .cse1 .cse2 .cse4 .cse19)))) [2019-11-16 00:08:57,899 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,900 INFO L443 ceAbstractionStarter]: For program point L856(lines 856 868) no Hoare annotation was computed. [2019-11-16 00:08:57,900 INFO L439 ceAbstractionStarter]: At program point L790(lines 783 800) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,900 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 728) no Hoare annotation was computed. [2019-11-16 00:08:57,900 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 596) no Hoare annotation was computed. [2019-11-16 00:08:57,900 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-11-16 00:08:57,901 INFO L439 ceAbstractionStarter]: At program point L1319(lines 1312 1329) the Hoare annotation is: (let ((.cse51 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse35 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse21 (= 0 ~c_req_type~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse29 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse47 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse48 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse36 (= ~s_memory0~0 50)) (.cse32 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse37 (<= ~c_req_a~0 1)) (.cse17 (= 6 ~m_run_pc~0)) (.cse18 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse23 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse24 (= ~s_run_pc~0 2)) (.cse20 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse51 (<= 1 ~c_req_type~0) .cse7 .cse8))) (let ((.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse22 (= 0 ~c_req_a~0)) (.cse34 (and .cse17 (and .cse18 (and .cse12 .cse23 .cse15 .cse24) .cse20))) (.cse19 (<= 2 ~s_run_pc~0)) (.cse42 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse26 (<= ~c_req_d~0 51)) (.cse43 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse44 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse27 (<= 51 ~c_req_d~0)) (.cse28 (let ((.cse53 (and .cse36 (and .cse32 (and .cse12 .cse13 .cse15 .cse24 .cse54) .cse37 .cse20)))) (or (and .cse53 .cse29) (and .cse53 .cse47 .cse48)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse46 (and (and .cse51 .cse2 .cse7) .cse12 .cse4 .cse15 .cse24)) (.cse45 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse30 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse52 (and (and .cse17 (and .cse18 (and .cse12 .cse15 .cse24 (and .cse4 (and .cse2 .cse7))) .cse20)) .cse35 .cse21)) (.cse39 (= ~s_memory1~0 51)) (.cse50 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse33 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse31 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse49 (= ~req_tt_a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse40 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse38 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and .cse17 (and .cse18 (and .cse12 (and .cse2 .cse4 .cse19 .cse7 .cse8)) .cse20)) (and .cse3 .cse21 .cse5 .cse8 .cse22 .cse2 .cse12 .cse16 .cse6 .cse7) (and (and .cse18 (and (and (and .cse4 .cse23) .cse12 .cse24) .cse15) .cse20) .cse17) (and .cse4 .cse19 (and .cse7 (not .cse24) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse24))) .cse16) (and .cse18 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse3 .cse21 .cse8 .cse22 .cse2 .cse12 .cse4 .cse16 .cse24 .cse6 .cse7) (and .cse30 .cse31 (and .cse32 .cse33 (and .cse34 .cse35 .cse21) .cse36 .cse37 .cse38) .cse39 .cse40 .cse41) (and .cse42 .cse25 .cse26 .cse43 .cse44 .cse45 .cse27 (and (and .cse46 .cse20) .cse18 .cse36 .cse47 .cse48)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse21 (and .cse22 .cse34)) .cse49 .cse36 .cse25 .cse43 .cse39 .cse16 .cse45 .cse47 .cse48 .cse50) (and .cse19 (and .cse51 .cse2 .cse7 .cse8)) (and .cse42 .cse18 .cse25 .cse26 .cse43 .cse44 .cse45 .cse27 .cse28) (and (and .cse9 .cse10 (and .cse11 .cse46) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse45 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse25 .cse16 .cse29) (and (and .cse51 .cse7 .cse8) .cse12 .cse4 .cse24) (and .cse30 .cse31 (and .cse32 (< 0 ULTIMATE.start_s_memory_read_~i) .cse52 .cse36 .cse47 .cse48 .cse37 .cse38) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse39 .cse40 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse52 .cse36 .cse39 .cse50 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse33 .cse11 .cse31 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse49 (= 50 ~c_rsp_d~0) .cse16 .cse40 .cse38))))) [2019-11-16 00:08:57,901 INFO L443 ceAbstractionStarter]: For program point L130(lines 129 475) no Hoare annotation was computed. [2019-11-16 00:08:57,902 INFO L439 ceAbstractionStarter]: At program point L64(lines 53 65) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse4 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (and (<= 0 ~a_t~0) (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 6 ~m_run_pc~0)) (= 0 ~c_req_type~0))) (.cse5 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse2 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse4 (<= ~c_req_a~0 1) .cse5) .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1)))) [2019-11-16 00:08:57,902 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 927) no Hoare annotation was computed. [2019-11-16 00:08:57,902 INFO L443 ceAbstractionStarter]: For program point L791(lines 480 832) no Hoare annotation was computed. [2019-11-16 00:08:57,902 INFO L443 ceAbstractionStarter]: For program point L1320(lines 1250 1339) no Hoare annotation was computed. [2019-11-16 00:08:57,902 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 135) no Hoare annotation was computed. [2019-11-16 00:08:57,902 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:08:57,902 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 796) no Hoare annotation was computed. [2019-11-16 00:08:57,903 INFO L439 ceAbstractionStarter]: At program point L462(lines 455 472) 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))) (let ((.cse5 (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4))) (.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))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (= ULTIMATE.start_m_run_~a~0 0) .cse5) (<= 50 ~c_req_d~0) .cse6 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~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) .cse6 (<= ~c_req_d~0 51) .cse7 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,903 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1325) no Hoare annotation was computed. [2019-11-16 00:08:57,903 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-11-16 00:08:57,903 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 867) no Hoare annotation was computed. [2019-11-16 00:08:57,903 INFO L443 ceAbstractionStarter]: For program point L463(lines 455 472) no Hoare annotation was computed. [2019-11-16 00:08:57,903 INFO L439 ceAbstractionStarter]: At program point L860(lines 855 1106) the Hoare annotation is: false [2019-11-16 00:08:57,904 INFO L439 ceAbstractionStarter]: At program point L662(lines 632 663) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse4 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,904 INFO L443 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-16 00:08:57,905 INFO L439 ceAbstractionStarter]: At program point L1125(lines 1114 1155) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (= ~c_empty_rsp~0 1))) (let ((.cse51 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse30 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse27 (= ~s_memory0~0 50)) (.cse39 (<= 1 ~c_req_a~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse43 (<= ~c_req_a~0 1)) (.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse55 (and .cse52 (<= 1 ~c_req_type~0) .cse16 .cse17)) (.cse42 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse13 (<= 2 ~s_run_st~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse15 (= ~m_run_st~0 0)) (.cse24 (= 6 ~m_run_pc~0)) (.cse22 (<= 0 ~a_t~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse20 (and .cse16 (<= 3 ~m_run_pc~0) .cse17)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse21 (= ~s_run_pc~0 2)) (.cse23 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse14 (<= ~c_m_lock~0 0)) (.cse37 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse47 (= ~req_tt_a~0 1)) (.cse19 (= 0 ~c_req_a~0)) (.cse41 (and .cse24 (and .cse22 (and .cse3 .cse20 .cse7 .cse21) .cse23))) (.cse26 (and .cse3 .cse13 .cse7 .cse21 (and .cse52 .cse11 .cse15 .cse16))) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse45 (= ~s_memory1~0 51)) (.cse50 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse40 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse38 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse48 (and .cse42 (and (and .cse22 (and .cse3 .cse13 (and .cse11 .cse15 .cse16) .cse7 .cse21) .cse23) .cse24) .cse18)) (.cse49 (= ~req_tt_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse46 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse44 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse5 (and .cse9 .cse10 .cse55)) (.cse6 (= 0 ~s_run_pc~0)) (.cse25 (<= 2 ~s_run_pc~0)) (.cse31 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse32 (<= ~c_req_d~0 51)) (.cse33 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse34 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse35 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= 51 ~c_req_d~0)) (.cse53 (let ((.cse54 (and .cse27 (and .cse39 (and .cse3 .cse4 .cse7 .cse21 .cse55) .cse43 .cse23)))) (or (and .cse54 .cse51) (and .cse54 .cse29 .cse30))))) (or (and (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse17) (and .cse12 .cse18 .cse6 .cse17 .cse19 .cse11 .cse3 .cse8 .cse14 .cse16) (and (and (and (and .cse3 .cse13 .cse20 .cse21) .cse7) .cse22 .cse23) .cse24) (and .cse12 .cse18 .cse25 .cse17 .cse19 .cse11 .cse3 .cse13 .cse8 .cse14 .cse15 .cse16) (and (and .cse22 (and .cse26 .cse23) .cse27 .cse28 .cse29 .cse30) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse37 .cse38 (and .cse39 .cse40 (and .cse41 .cse42 .cse18) .cse27 .cse43 .cse44) .cse45 .cse46 .cse47) (and .cse37 .cse38 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse45 .cse46 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse47 (and .cse39 .cse48 (< 0 ULTIMATE.start_s_memory_read_~i) .cse27 .cse29 .cse30 .cse43 .cse44) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse2 (and .cse18 (and .cse19 .cse41)) .cse49 .cse27 .cse28 .cse33 .cse45 .cse8 .cse35 .cse29 .cse30 .cse50) (and (and .cse0 .cse1 (and .cse26 .cse2 .cse8) .cse28 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse51) (and .cse24 (and .cse22 (and .cse11 .cse3 .cse13 .cse21 .cse16 .cse17) .cse23)) (and (and .cse52 .cse16 .cse17) .cse3 .cse13 .cse21) (and .cse13 .cse25 (and .cse16 (not .cse21) .cse17)) (and (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse21))) .cse8) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse27 .cse45 .cse50 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse40 .cse2 .cse38 .cse48 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse49 (= 50 ~c_rsp_d~0) .cse8 .cse46 .cse44) (and .cse22 .cse28 .cse32 .cse36 .cse53 .cse51) (and .cse13 .cse5 .cse6) (and .cse25 (and .cse52 .cse11 .cse16 .cse17)) (and .cse31 .cse22 .cse28 .cse32 .cse33 .cse34 .cse35 .cse36 .cse53))))) [2019-11-16 00:08:57,905 INFO L439 ceAbstractionStarter]: At program point L1059(lines 1052 1078) the Hoare annotation is: (let ((.cse7 (= 3 ~m_run_pc~0)) (.cse25 (<= 0 ~a_t~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_req~0 1)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~a_t~0 0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse17 (= ~s_memory1~0 51)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (= 6 ~m_run_pc~0) (and .cse25 (and .cse5 .cse10 .cse9 .cse8) .cse26)) (= 0 ~c_req_type~0))) (.cse21 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse16 (= ~s_memory0~0 50)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (and .cse5 (and .cse7 .cse8) .cse10 .cse9)) (.cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 1 ~c_req_type~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (let ((.cse6 (and .cse7 .cse8 (not .cse9)))) (or (and .cse6 (<= 2 ~s_run_pc~0)) (and .cse6 (= 0 ~s_run_pc~0)))) (<= ~c_req_type~0 1) .cse10 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse11 .cse12) .cse13 .cse14 .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse2 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse14 .cse19 .cse20 .cse21) (and .cse2 .cse13 .cse14 (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse11 .cse12) .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse19 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse16 .cse23 .cse24 (<= ~c_req_a~0 1) .cse20 .cse21) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 (and .cse16 .cse23 .cse24 (and .cse22 .cse26)) .cse13 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (<= 51 ~c_req_d~0))))) [2019-11-16 00:08:57,905 INFO L443 ceAbstractionStarter]: For program point L1258(lines 1258 1311) no Hoare annotation was computed. [2019-11-16 00:08:57,906 INFO L439 ceAbstractionStarter]: At program point L1192(lines 1185 1229) 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 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 0) .cse3 .cse4))) [2019-11-16 00:08:57,906 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 74) no Hoare annotation was computed. [2019-11-16 00:08:57,906 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 866) no Hoare annotation was computed. [2019-11-16 00:08:57,906 INFO L439 ceAbstractionStarter]: At program point L730(lines 723 740) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse4 (and (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 6 ~m_run_pc~0))) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse4 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,907 INFO L439 ceAbstractionStarter]: At program point L598(lines 591 608) the Hoare annotation is: (let ((.cse7 (= ~a_t~0 0)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse10 (= 0 ~c_req_type~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse9 (<= 0 ~a_t~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (let ((.cse5 (let ((.cse16 (<= 1 ~c_req_a~0)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (and (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 .cse11 .cse12 (and (= 6 ~m_run_pc~0) (and .cse9 .cse0 (and .cse2 .cse3) .cse15 .cse1)))) (.cse20 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= ~c_req_a~0 1)) (.cse23 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse16 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse17 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 .cse23) (and .cse16 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse23)))) (.cse6 (= ~s_memory1~0 51)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse6 .cse13 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (and (= ULTIMATE.start_m_run_~a~0 0) (and .cse0 (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse15 .cse1)) (= 0 ~c_req_a~0) (= 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)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (= 51 ~c_rsp_d~0) .cse8)))) [2019-11-16 00:08:57,907 INFO L439 ceAbstractionStarter]: At program point L334(lines 327 371) the Hoare annotation is: (let ((.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)) (.cse2 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:08:57,907 INFO L443 ceAbstractionStarter]: For program point L1259(lines 1259 1263) no Hoare annotation was computed. [2019-11-16 00:08:57,908 INFO L439 ceAbstractionStarter]: At program point L202(lines 172 203) the Hoare annotation is: (let ((.cse20 (= ~a_t~0 0)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse4 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (<= ~m_run_pc~0 0)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= 0 ~c_req_type~0)) (.cse3 (= 0 ~s_run_pc~0)) (.cse15 (= 0 ~c_req_a~0)) (.cse16 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse9 (let ((.cse24 (and (and (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse17 .cse2 .cse18 .cse19 (and (= 3 ~m_run_pc~0) .cse6 .cse5) .cse23 .cse4) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ~s_memory0~0 50)))) (or (and .cse24 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1)) (and .cse24 .cse20 .cse22)))) (.cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse14 (<= 2 ~s_run_pc~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse7) (and .cse8 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse9 .cse10 .cse11) (and .cse12 .cse1 .cse0 .cse13 .cse14 .cse6 .cse15 .cse16 .cse17 .cse2 .cse18 .cse19 .cse20 .cse4 .cse21 .cse5 .cse7) (and .cse12 .cse0 .cse1 .cse13 .cse3 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse4 .cse21 .cse5 .cse7) (and .cse8 .cse9 .cse10 .cse22 .cse11) (and .cse2 (and (not .cse23) .cse6 .cse5) .cse14)))) [2019-11-16 00:08:57,908 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2019-11-16 00:08:57,908 INFO L439 ceAbstractionStarter]: At program point L929(lines 922 957) the Hoare annotation is: (let ((.cse2 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse5 (<= ~c_req_type~0 1)) (.cse8 (= 3 ~m_run_pc~0)) (.cse9 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ~c_req_a~0)) (.cse26 (and (and .cse2 (and (and .cse10 .cse11 .cse12) .cse3 .cse6 .cse7) .cse15) (= 6 ~m_run_pc~0))) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse14 (<= ~c_req_a~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (= 1 ULTIMATE.start_s_run_~req_a~1) .cse14 .cse15)) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse16 (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse17 (and .cse3 .cse5 (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0))) (or (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (<= 2 ~s_run_pc~0) .cse20 .cse11 .cse12) (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (= 0 ~s_run_pc~0) .cse20 .cse11 .cse12))) .cse6 .cse13) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse17 .cse21 (= ~req_tt_a~0 0) .cse0 .cse22 .cse16 .cse23 (and (= 0 ~c_req_a~0) .cse24 .cse25 .cse20 .cse26) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse21 .cse22 .cse23 (and .cse1 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse26 .cse24 .cse25) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,909 INFO L439 ceAbstractionStarter]: At program point L863(lines 855 1106) the Hoare annotation is: (let ((.cse10 (= 3 ~m_run_pc~0)) (.cse13 (<= 0 ~a_t~0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ~s_run_pc~0 2)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse2 (= 0 ~c_req_type~0)) (.cse3 (and (and .cse13 .cse14 (and .cse11 .cse12) .cse16 .cse17 .cse19) (= 6 ~m_run_pc~0))) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~s_memory0~0 50)) (.cse8 (<= 1 ~c_req_a~0)) (.cse9 (<= ~c_req_a~0 1)) (.cse0 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (and .cse10 (<= 1 ~c_req_type~0) .cse11 .cse12)) (.cse15 (<= ~c_req_type~0 1)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (and .cse2 (and (= 0 ~c_req_a~0) .cse3)) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse2 .cse3) .cse4 .cse9 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse1 .cse5 .cse7 (= ~req_tt_a~0 1)) (and (and .cse10 (= ~c_empty_req~0 1) .cse11 .cse12) (<= 2 ~s_run_pc~0)) (and .cse13 (and .cse4 (and .cse8 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse9 .cse19)) (<= ~c_req_d~0 51) (<= 51 ~c_req_d~0)) (and (<= ~c_req_d~0 50) (and .cse0 (and .cse14 (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse18) .cse15 .cse16 .cse17) .cse6) (<= 50 ~c_req_d~0))))) [2019-11-16 00:08:57,909 INFO L443 ceAbstractionStarter]: For program point L731(lines 723 740) no Hoare annotation was computed. [2019-11-16 00:08:57,909 INFO L443 ceAbstractionStarter]: For program point L599(lines 480 832) no Hoare annotation was computed. [2019-11-16 00:08:57,909 INFO L443 ceAbstractionStarter]: For program point L401(lines 401 454) no Hoare annotation was computed. [2019-11-16 00:08:57,909 INFO L443 ceAbstractionStarter]: For program point L1194(lines 1194 1198) no Hoare annotation was computed. [2019-11-16 00:08:57,909 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 74) no Hoare annotation was computed. [2019-11-16 00:08:57,910 INFO L443 ceAbstractionStarter]: For program point L996-1(lines 871 1101) no Hoare annotation was computed. [2019-11-16 00:08:57,910 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 736) no Hoare annotation was computed. [2019-11-16 00:08:57,910 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-16 00:08:57,910 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 406) no Hoare annotation was computed. [2019-11-16 00:08:57,910 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-11-16 00:08:57,910 INFO L439 ceAbstractionStarter]: At program point L270(lines 263 280) 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 (<= ULTIMATE.start_m_run_~req_d~0 50) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (<= ~c_req_type~0 1) .cse2 (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (= ~a_t~0 0) (<= 50 ULTIMATE.start_m_run_~req_d~0)) (and .cse1 (and .cse3 .cse4) .cse5) (and .cse1 (<= 2 ~s_run_pc~0) .cse6))))) [2019-11-16 00:08:57,911 INFO L443 ceAbstractionStarter]: For program point L1129(lines 1129 1136) no Hoare annotation was computed. [2019-11-16 00:08:57,911 INFO L443 ceAbstractionStarter]: For program point L997(lines 996 1020) no Hoare annotation was computed. [2019-11-16 00:08:57,911 INFO L443 ceAbstractionStarter]: For program point L931(lines 931 935) no Hoare annotation was computed. [2019-11-16 00:08:57,911 INFO L443 ceAbstractionStarter]: For program point L271(lines 263 280) no Hoare annotation was computed. [2019-11-16 00:08:57,911 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1002) no Hoare annotation was computed. [2019-11-16 00:08:57,911 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-16 00:08:57,912 INFO L439 ceAbstractionStarter]: At program point L140-2(lines 140 168) the Hoare annotation is: (let ((.cse14 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse21 (<= 2 ~s_run_st~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse17 (<= ~c_m_lock~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse18 (<= 2 ~c_write_rsp_ev~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse23 (= ~s_run_pc~0 2))) (let ((.cse0 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse1 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse2 (let ((.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse25 (and (and (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse12 .cse21 (and (= 3 ~m_run_pc~0) .cse10 .cse15 .cse17 .cse8 .cse18) .cse13 .cse23)) (= ~s_memory0~0 50))) (.cse26 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse24 .cse14 .cse25 .cse20 .cse26) (and .cse24 .cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse26)))) (.cse7 (= 0 ~s_run_pc~0)) (.cse3 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse5 (<= ~m_run_pc~0 0)) (.cse6 (= 0 ~c_req_type~0)) (.cse9 (= 0 ~c_req_a~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse22 (<= 2 ~s_run_pc~0))) (or (and (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse4 .cse7 .cse8 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse10 .cse21 .cse15 .cse17 .cse18 (<= 0 ULTIMATE.start_m_run_~a~0) .cse19) (and .cse3 .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse22 .cse18 (not .cse23) .cse8)))) [2019-11-16 00:08:57,912 INFO L443 ceAbstractionStarter]: For program point L669(lines 669 722) no Hoare annotation was computed. [2019-11-16 00:08:57,912 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,912 INFO L443 ceAbstractionStarter]: For program point L141(lines 140 168) no Hoare annotation was computed. [2019-11-16 00:08:57,912 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 674) no Hoare annotation was computed. [2019-11-16 00:08:57,913 INFO L439 ceAbstractionStarter]: At program point L1265(lines 1258 1311) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (= ~s_memory0~0 50)) (.cse27 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse36 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse52 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse32 (= 0 ~c_req_type~0)) (.cse37 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse35 (= ~s_run_pc~0 2)) (.cse38 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse39 (= 6 ~m_run_pc~0))) (let ((.cse24 (and .cse46 .cse32 (and (and .cse37 (and .cse12 .cse4 (and .cse2 .cse7) .cse15 .cse35) .cse38) .cse39))) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse26 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~req_tt_a~0 1)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse33 (= 0 ~c_req_a~0)) (.cse45 (and .cse39 (and .cse37 (and .cse12 .cse36 .cse15 .cse35) .cse38))) (.cse22 (= ~req_tt_a~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse34 (<= 2 ~s_run_pc~0)) (.cse47 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ~c_req_d~0 51)) (.cse48 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse42 (<= 51 ~c_req_d~0)) (.cse43 (let ((.cse53 (and .cse17 (and .cse27 (and .cse12 .cse13 .cse15 .cse35 .cse54) .cse30 .cse38)))) (or (and .cse53 .cse44) (and .cse53 .cse28 .cse29)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (and (and .cse52 .cse2 .cse7) .cse12 .cse4 .cse15 .cse35)) (.cse50 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse11 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 50 ~c_rsp_d~0) .cse16 .cse23 .cse24 .cse25) (and .cse26 .cse21 (and .cse27 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse28 .cse29 .cse24 .cse30 .cse25) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse23 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse3 .cse32 .cse5 .cse8 .cse33 .cse2 .cse12 .cse16 .cse6 .cse7) (and .cse4 .cse34 (and .cse7 (not .cse35) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse35))) .cse16) (and (and (and (and .cse12 .cse4 .cse36 .cse35) .cse15) .cse37 .cse38) .cse39) (and .cse37 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse3 .cse32 .cse8 .cse33 .cse2 .cse12 .cse4 .cse16 .cse35 .cse6 .cse7) (and .cse26 .cse21 (and .cse27 .cse20 (and .cse45 .cse46 .cse32) .cse17 .cse30 .cse25) .cse18 .cse23 .cse31) (and .cse47 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 (and (and .cse51 .cse38) .cse37 .cse17 .cse28 .cse29)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse32 (and .cse33 .cse45)) .cse22 .cse17 .cse40 .cse48 .cse18 .cse16 .cse50 .cse28 .cse29 .cse19) (and .cse34 (and .cse52 .cse2 .cse7 .cse8)) (and .cse47 .cse37 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 .cse43) (and .cse39 (and .cse37 (and .cse2 .cse12 .cse4 .cse35 .cse7 .cse8) .cse38)) (and (and .cse9 .cse10 (and .cse11 .cse51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse50 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse40 .cse16 .cse44) (and (and .cse52 .cse7 .cse8) .cse12 .cse4 .cse35))))) [2019-11-16 00:08:57,913 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-11-16 00:08:57,914 INFO L439 ceAbstractionStarter]: At program point L1067(lines 1060 1077) the Hoare annotation is: (let ((.cse7 (= 3 ~m_run_pc~0)) (.cse25 (<= 0 ~a_t~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_req~0 1)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~a_t~0 0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse17 (= ~s_memory1~0 51)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (= 6 ~m_run_pc~0) (and .cse25 (and .cse5 .cse10 .cse9 .cse8) .cse26)) (= 0 ~c_req_type~0))) (.cse21 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse16 (= ~s_memory0~0 50)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (and .cse5 (and .cse7 .cse8) .cse10 .cse9)) (.cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 1 ~c_req_type~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (let ((.cse6 (and .cse7 .cse8 (not .cse9)))) (or (and .cse6 (<= 2 ~s_run_pc~0)) (and .cse6 (= 0 ~s_run_pc~0)))) (<= ~c_req_type~0 1) .cse10 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse11 .cse12) .cse13 .cse14 .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse2 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse14 .cse19 .cse20 .cse21) (and .cse2 .cse13 .cse14 (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse11 .cse12) .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse19 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse16 .cse23 .cse24 (<= ~c_req_a~0 1) .cse20 .cse21) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 (and .cse16 .cse23 .cse24 (and .cse22 .cse26)) .cse13 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (<= 51 ~c_req_d~0))))) [2019-11-16 00:08:57,914 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,914 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,914 INFO L443 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,914 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,915 INFO L443 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,915 INFO L443 ceAbstractionStarter]: For program point L209(lines 209 262) no Hoare annotation was computed. [2019-11-16 00:08:57,915 INFO L439 ceAbstractionStarter]: At program point L1200(lines 1193 1228) 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 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 0) .cse3 .cse4))) [2019-11-16 00:08:57,915 INFO L443 ceAbstractionStarter]: For program point L1068(lines 871 1101) no Hoare annotation was computed. [2019-11-16 00:08:57,915 INFO L439 ceAbstractionStarter]: At program point L11-3(lines 1 1371) the Hoare annotation is: (let ((.cse1 (= ~s_memory0~0 50)) (.cse4 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (and (<= 0 ~a_t~0) (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 6 ~m_run_pc~0)) (= 0 ~c_req_type~0))) (.cse5 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (= ~s_memory1~0 51)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse5) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse1 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse4 (<= ~c_req_a~0 1) .cse5) .cse0 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse2 .cse3 (= ~req_tt_a~0 1)))) [2019-11-16 00:08:57,916 INFO L439 ceAbstractionStarter]: At program point L11-4(lines 67 77) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse5 (= 3 ~m_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse3 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse8 (= ~s_run_pc~0 2)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse1 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= ~a_t~0 0)) (.cse0 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (and .cse2 .cse10 (and .cse5 .cse6 .cse3 .cse7 .cse9) .cse8 .cse11))) (or (and .cse0 (and .cse1 (and (<= 1 ~c_req_type~0) .cse2 .cse3 (<= ~c_req_type~0 1) (let ((.cse4 (and .cse5 .cse6 .cse7 (not .cse8) .cse9))) (or (and .cse4 (<= 2 ~s_run_pc~0)) (and .cse4 (= 0 ~s_run_pc~0)))) .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (and (and .cse1 .cse12 (and .cse13 .cse20) .cse14 .cse16 .cse17 .cse18 .cse19) .cse15 .cse0) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse17 (<= 51 ~c_req_d~0) (and (and .cse20 (<= 0 ~a_t~0) (<= 0 ULTIMATE.start_m_run_~a~0)) (= ~s_memory0~0 50) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1)))))) [2019-11-16 00:08:57,916 INFO L439 ceAbstractionStarter]: At program point L408(lines 401 454) 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))) (let ((.cse5 (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4))) (.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))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (= ULTIMATE.start_m_run_~a~0 0) .cse5) (<= 50 ~c_req_d~0) .cse6 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~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) .cse6 (<= ~c_req_d~0 51) .cse7 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,916 INFO L439 ceAbstractionStarter]: At program point L342(lines 335 370) the Hoare annotation is: (let ((.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)) (.cse2 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:08:57,916 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1337) no Hoare annotation was computed. [2019-11-16 00:08:57,917 INFO L443 ceAbstractionStarter]: For program point L1333-1(lines 1165 1344) no Hoare annotation was computed. [2019-11-16 00:08:57,917 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1271) no Hoare annotation was computed. [2019-11-16 00:08:57,917 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 214) no Hoare annotation was computed. [2019-11-16 00:08:57,917 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1073) no Hoare annotation was computed. [2019-11-16 00:08:57,917 INFO L439 ceAbstractionStarter]: At program point L937(lines 930 956) the Hoare annotation is: (let ((.cse2 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse5 (<= ~c_req_type~0 1)) (.cse8 (= 3 ~m_run_pc~0)) (.cse9 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ~c_req_a~0)) (.cse26 (and (and .cse2 (and (and .cse10 .cse11 .cse12) .cse3 .cse6 .cse7) .cse15) (= 6 ~m_run_pc~0))) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse14 (<= ~c_req_a~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (= 1 ULTIMATE.start_s_run_~req_a~1) .cse14 .cse15)) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse16 (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse17 (and .cse3 .cse5 (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0))) (or (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (<= 2 ~s_run_pc~0) .cse20 .cse11 .cse12) (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (= 0 ~s_run_pc~0) .cse20 .cse11 .cse12))) .cse6 .cse13) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse17 .cse21 (= ~req_tt_a~0 0) .cse0 .cse22 .cse16 .cse23 (and (= 0 ~c_req_a~0) .cse24 .cse25 .cse20 .cse26) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse21 .cse22 .cse23 (and .cse1 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse26 .cse24 .cse25) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,918 INFO L439 ceAbstractionStarter]: At program point L871-1(lines 855 1106) the Hoare annotation is: (let ((.cse12 (= 3 ~m_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse18 (= ~s_run_pc~0 2)) (.cse23 (= ~c_empty_req~0 1)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 0 ~a_t~0)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse22 (= 0 ~c_req_type~0))) (let ((.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (and (and (and (and .cse10 .cse11 .cse18 (and .cse23 .cse17)) .cse24 .cse26) (= 6 ~m_run_pc~0)) (= ULTIMATE.start_s_run_~req_type~1 0) .cse22)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse2 (= ~s_memory1~0 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (<= ~c_req_a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse0 (= ~s_memory0~0 50)) (.cse20 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (and .cse10 (and .cse12 .cse23 .cse17) .cse11)) (.cse5 (= ~a_t~0 0)) (.cse27 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse28 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse16 (<= 2 ~s_run_pc~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse3 .cse4 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7) (and (and .cse8 .cse9 (and .cse10 (<= ~c_req_type~0 1) .cse11 (let ((.cse15 (<= 1 ~c_req_type~0))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse18) .cse19) (and .cse12 .cse13 .cse14 .cse15 (= 0 ~s_run_pc~0) .cse17 .cse19)))) .cse3) .cse5) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse0 .cse1 .cse20 .cse21 (<= ~c_req_a~0 1) .cse7) .cse2 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse10 .cse22 (and .cse13 .cse14 .cse23 (<= ~m_run_pc~0 0) (<= ~c_m_lock~0 0) .cse17 .cse19) .cse5) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse24 (and .cse0 .cse20 .cse21 (and .cse25 .cse26)) .cse27 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse28 (<= 51 ~c_req_d~0)) (and (and .cse8 .cse9 (and .cse3 .cse25 .cse5) .cse27 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse28 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (= 0 ULTIMATE.start_s_run_~req_a~1)) (and (and .cse12 .cse23 .cse17 .cse19) .cse16)))) [2019-11-16 00:08:57,918 INFO L443 ceAbstractionStarter]: For program point L1202(lines 1202 1206) no Hoare annotation was computed. [2019-11-16 00:08:57,918 INFO L443 ceAbstractionStarter]: For program point L806(lines 806 810) no Hoare annotation was computed. [2019-11-16 00:08:57,919 INFO L439 ceAbstractionStarter]: At program point L476(lines 128 477) 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 (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 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_a~1 1) (<= 51 ~c_req_d~0) (and (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4)) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,919 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-16 00:08:57,919 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-11-16 00:08:57,919 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 943) no Hoare annotation was computed. [2019-11-16 00:08:57,919 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:08:57,919 INFO L443 ceAbstractionStarter]: For program point L874-1(lines 871 1101) no Hoare annotation was computed. [2019-11-16 00:08:57,919 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 748) no Hoare annotation was computed. [2019-11-16 00:08:57,920 INFO L439 ceAbstractionStarter]: At program point L742-1(lines 742 748) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse4 (and (= 6 ~m_run_pc~0) (and (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) (= ~s_run_pc~0 2)) (<= 0 ~a_t~0) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse4 (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse4 .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7))) [2019-11-16 00:08:57,920 INFO L439 ceAbstractionStarter]: At program point L676(lines 669 722) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 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)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,920 INFO L443 ceAbstractionStarter]: For program point L875(lines 874 898) no Hoare annotation was computed. [2019-11-16 00:08:57,921 INFO L439 ceAbstractionStarter]: At program point L1140(lines 1114 1155) the Hoare annotation is: (let ((.cse47 (= 3 ~m_run_pc~0)) (.cse27 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (let ((.cse52 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse12 (= ~s_memory0~0 50)) (.cse11 (<= 1 ~c_req_a~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse16 (<= ~c_req_a~0 1)) (.cse48 (<= ~c_req_a~0 0)) (.cse49 (<= 0 ~c_req_a~0)) (.cse54 (and .cse47 (<= 1 ~c_req_type~0) .cse27 .cse23)) (.cse36 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (= 0 ~c_req_type~0)) (.cse28 (<= 2 ~s_run_st~0)) (.cse25 (= ~c_empty_req~0 1)) (.cse33 (= 6 ~m_run_pc~0)) (.cse31 (<= 0 ~a_t~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse29 (and .cse27 (<= 3 ~m_run_pc~0) .cse23)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse30 (= ~s_run_pc~0 2)) (.cse32 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse9 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse20 (= ~req_tt_a~0 1)) (.cse24 (= 0 ~c_req_a~0)) (.cse35 (and .cse33 (and .cse31 (and .cse3 .cse29 .cse7 .cse30) .cse32))) (.cse21 (<= ~m_run_pc~0 0)) (.cse26 (<= ~c_m_lock~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse46 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse34 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse45 (= ~req_tt_a~0 0)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse15 (and .cse36 .cse22 (and (and .cse31 (and .cse3 .cse28 (and .cse25 .cse27) .cse7 .cse30) .cse32) .cse33))) (.cse17 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse5 (and .cse48 .cse49 .cse54)) (.cse6 (= 0 ~s_run_pc~0)) (.cse50 (<= 2 ~s_run_pc~0)) (.cse37 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ~c_req_d~0 51)) (.cse40 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse43 (<= 51 ~c_req_d~0)) (.cse51 (let ((.cse53 (and .cse12 (and .cse11 (and .cse3 .cse4 .cse7 .cse30 .cse54) .cse16 .cse32)))) (or (and .cse53 .cse52) (and .cse53 .cse13 .cse14)))) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (and (and .cse47 .cse25 .cse27) .cse3 .cse28 .cse7 .cse30)) (.cse42 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse38 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse8 (= ~a_t~0 0))) (or (and (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and .cse9 .cse10 (and .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse19 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse20 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse21 .cse22 .cse6 .cse23 .cse24 .cse25 .cse3 .cse8 .cse26 .cse27) (and (and (and (and .cse3 .cse28 .cse29 .cse30) .cse7) .cse31 .cse32) .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse28 .cse8 .cse30 .cse26 .cse27) (and .cse9 .cse10 (and .cse11 .cse34 (and .cse35 .cse36 .cse22) .cse12 .cse16 .cse17) .cse18 .cse19 .cse20) (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (and (and .cse44 .cse32) .cse31 .cse12 .cse13 .cse14)) (and .cse2 (and .cse22 (and .cse24 .cse35)) .cse45 .cse12 .cse38 .cse40 .cse18 .cse8 .cse42 .cse13 .cse14 .cse46) (and .cse33 (and .cse31 (and .cse25 .cse3 .cse28 .cse30 .cse27 .cse23) .cse32)) (and (and .cse47 .cse27 .cse23) .cse3 .cse28 .cse30) (and .cse48 .cse49 .cse25 .cse21 .cse28 .cse6 .cse26 .cse27 .cse23) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse18 .cse46 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse34 .cse2 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse45 (= 50 ~c_rsp_d~0) .cse8 .cse19 .cse15 .cse17) (and .cse28 .cse50 (and .cse27 (not .cse30) .cse23)) (and (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse30))) .cse8) (and .cse31 .cse38 .cse39 .cse43 .cse51 .cse52) (and .cse28 .cse5 .cse6) (and .cse50 (and .cse47 .cse25 .cse27 .cse23)) (and .cse37 .cse31 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse51) (and (and .cse0 .cse1 (and .cse2 .cse44) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse42 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse38 .cse8 .cse52))))) [2019-11-16 00:08:57,921 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 880) no Hoare annotation was computed. [2019-11-16 00:08:57,921 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 682) no Hoare annotation was computed. [2019-11-16 00:08:57,922 INFO L439 ceAbstractionStarter]: At program point L480-2(lines 480 832) the Hoare annotation is: (let ((.cse3 (= ~a_t~0 0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse12 (<= 0 ~a_t~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~s_run_st~0)) (.cse11 (= ~s_run_pc~0 2)) (.cse13 (= ~s_memory0~0 50))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (let ((.cse18 (and (and (and .cse12 (and .cse10 (and .cse6 .cse7 .cse8 .cse9) .cse5 .cse11)) (= 6 ~m_run_pc~0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) .cse13 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0))) (.cse19 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse18 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 .cse19 .cse20) (and (<= 1 ~c_req_a~0) .cse18 (< 0 ULTIMATE.start_s_memory_read_~i) .cse14 .cse15 .cse19 (<= ~c_req_a~0 1) .cse20)))) (.cse2 (= ~s_memory1~0 51)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~s_run_pc~0)) (.cse17 (not .cse11))) (or (and .cse0 (= ULTIMATE.start_m_run_~a~0 1) .cse1 .cse2 .cse3 .cse4) (and (= ULTIMATE.start_m_run_~a~0 0) (and (and .cse5 (and (= 3 ~m_run_pc~0) .cse6 .cse7 .cse8 .cse9)) .cse10 .cse11) .cse12 .cse13 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse14 .cse15 (<= 51 ~c_req_d~0)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse2 .cse4 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse16 .cse7 .cse8 .cse17 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse5 .cse16 .cse7 .cse8 .cse17 (<= 3 ~m_run_pc~0) .cse9)))) [2019-11-16 00:08:57,922 INFO L439 ceAbstractionStarter]: At program point L1273(lines 1266 1310) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (= ~s_memory0~0 50)) (.cse27 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse36 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse52 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse32 (= 0 ~c_req_type~0)) (.cse37 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse35 (= ~s_run_pc~0 2)) (.cse38 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse39 (= 6 ~m_run_pc~0))) (let ((.cse24 (and .cse46 .cse32 (and (and .cse37 (and .cse12 .cse4 (and .cse2 .cse7) .cse15 .cse35) .cse38) .cse39))) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse26 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~req_tt_a~0 1)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse33 (= 0 ~c_req_a~0)) (.cse45 (and .cse39 (and .cse37 (and .cse12 .cse36 .cse15 .cse35) .cse38))) (.cse22 (= ~req_tt_a~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse34 (<= 2 ~s_run_pc~0)) (.cse47 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ~c_req_d~0 51)) (.cse48 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse42 (<= 51 ~c_req_d~0)) (.cse43 (let ((.cse53 (and .cse17 (and .cse27 (and .cse12 .cse13 .cse15 .cse35 .cse54) .cse30 .cse38)))) (or (and .cse53 .cse44) (and .cse53 .cse28 .cse29)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (and (and .cse52 .cse2 .cse7) .cse12 .cse4 .cse15 .cse35)) (.cse50 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse11 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 50 ~c_rsp_d~0) .cse16 .cse23 .cse24 .cse25) (and .cse26 .cse21 (and .cse27 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse28 .cse29 .cse24 .cse30 .cse25) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse23 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse3 .cse32 .cse5 .cse8 .cse33 .cse2 .cse12 .cse16 .cse6 .cse7) (and .cse4 .cse34 (and .cse7 (not .cse35) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse35))) .cse16) (and (and (and (and .cse12 .cse4 .cse36 .cse35) .cse15) .cse37 .cse38) .cse39) (and .cse37 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse3 .cse32 .cse8 .cse33 .cse2 .cse12 .cse4 .cse16 .cse35 .cse6 .cse7) (and .cse26 .cse21 (and .cse27 .cse20 (and .cse45 .cse46 .cse32) .cse17 .cse30 .cse25) .cse18 .cse23 .cse31) (and .cse47 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 (and (and .cse51 .cse38) .cse37 .cse17 .cse28 .cse29)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse32 (and .cse33 .cse45)) .cse22 .cse17 .cse40 .cse48 .cse18 .cse16 .cse50 .cse28 .cse29 .cse19) (and .cse34 (and .cse52 .cse2 .cse7 .cse8)) (and .cse47 .cse37 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 .cse43) (and .cse39 (and .cse37 (and .cse2 .cse12 .cse4 .cse35 .cse7 .cse8) .cse38)) (and (and .cse9 .cse10 (and .cse11 .cse51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse50 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse40 .cse16 .cse44) (and (and .cse52 .cse7 .cse8) .cse12 .cse4 .cse35))))) [2019-11-16 00:08:57,923 INFO L439 ceAbstractionStarter]: At program point L216(lines 209 262) the Hoare annotation is: (let ((.cse20 (= ~a_t~0 0)) (.cse27 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_req_type~0)) (.cse10 (<= ~c_req_type~0 1)) (.cse26 (<= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse25 (<= 2 ~s_run_st~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse21 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse23 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse11 (= 0 ~s_run_pc~0)) (.cse0 (let ((.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (and (= ~s_memory0~0 50) (and (= 3 ~m_run_pc~0) .cse7 (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse10 .cse26 .cse12 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) .cse25 .cse18 .cse19 .cse21 .cse23))) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse29 (<= ULTIMATE.start_s_run_~req_a~1 1) .cse30) (and .cse28 .cse20 .cse29 .cse27 .cse30)))) (.cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse2 (<= ~c_req_d~0 51)) (.cse3 (<= 51 ~c_req_d~0)) (.cse4 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse5 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse13 (<= ~c_req_d~0 50)) (.cse16 (<= 50 ~c_req_d~0)) (.cse22 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse24 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse26 (not (= ~s_run_pc~0 2)) .cse12 .cse23) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse25 .cse21 .cse23 (<= 0 ULTIMATE.start_m_run_~a~0) .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5) (and .cse6 .cse13 .cse16 .cse20 .cse22 (and .cse7 .cse8 .cse9 .cse10 .cse26 .cse12 .cse14 .cse15 .cse17 .cse25 .cse18 .cse19 .cse21 .cse23 .cse24))))) [2019-11-16 00:08:57,923 INFO L443 ceAbstractionStarter]: For program point L481(lines 480 832) no Hoare annotation was computed. [2019-11-16 00:08:57,923 INFO L446 ceAbstractionStarter]: At program point L1340(lines 1162 1345) the Hoare annotation is: true [2019-11-16 00:08:57,924 INFO L439 ceAbstractionStarter]: At program point L283-2(lines 283 311) the Hoare annotation is: (let ((.cse35 (<= 1 ~c_req_type~0)) (.cse27 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~s_run_pc~0 2)) (.cse26 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~c_req_a~0 0)) (.cse13 (<= 0 ~c_req_a~0)) (.cse34 (and .cse27 (not .cse16) .cse26)) (.cse20 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse19 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse28 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 0 ~a_t~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= ~c_req_type~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse14 (and .cse35 .cse26 .cse27)) (.cse25 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse18 (= ~s_memory0~0 50)) (.cse31 (= 3 ~m_run_pc~0)) (.cse32 (= ~c_empty_req~0 1))) (let ((.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse22 (and .cse31 .cse32 .cse27)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (let ((.cse36 (and (and (<= 1 ~c_req_a~0) .cse23 (<= ~c_req_a~0 1) (and .cse10 .cse11 .cse15 .cse16 .cse14) .cse25) .cse18))) (or (and .cse36 .cse19 .cse20 .cse21) (and .cse36 .cse19 .cse28)))) (.cse2 (<= ~c_req_d~0 51)) (.cse6 (<= 51 ~c_req_d~0)) (.cse17 (= ~a_t~0 0)) (.cse7 (<= ~c_req_d~0 50)) (.cse29 (= 0 ~s_run_pc~0)) (.cse30 (and .cse12 .cse13 (and .cse34 .cse35))) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse24 (<= 2 ~s_run_st~0)) (.cse33 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (and .cse7 .cse8 (and .cse9 (and .cse10 .cse11 (and .cse12 .cse13 .cse14) .cse15 .cse16))) .cse17) (and .cse1 .cse18 .cse3 .cse19 .cse2 .cse4 .cse20 .cse5 .cse21 .cse6 (and .cse22 .cse10 .cse23 .cse24 .cse15 .cse16) .cse25) (and .cse10 .cse24 (and .cse26 .cse27) .cse16) (and .cse7 (and .cse22 .cse9 .cse10 .cse24 .cse15 .cse16) .cse8 .cse19 .cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse28 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse2 .cse6 .cse28) (and .cse24 .cse29 .cse30) (and .cse17 (and .cse7 (and .cse10 .cse11 .cse29 .cse15 .cse30) .cse8 .cse9)) (and (and .cse31 .cse32 .cse27 .cse26) .cse33) (and .cse24 .cse33 .cse34))))) [2019-11-16 00:08:57,924 INFO L439 ceAbstractionStarter]: At program point L1208(lines 1201 1227) 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 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 0) .cse3 .cse4))) [2019-11-16 00:08:57,924 INFO L439 ceAbstractionStarter]: At program point L812(lines 805 822) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,924 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 618) no Hoare annotation was computed. [2019-11-16 00:08:57,925 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2019-11-16 00:08:57,925 INFO L439 ceAbstractionStarter]: At program point L416(lines 409 453) 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))) (let ((.cse5 (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4))) (.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))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (= ULTIMATE.start_m_run_~a~0 0) .cse5) (<= 50 ~c_req_d~0) .cse6 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~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) .cse6 (<= ~c_req_d~0 51) .cse7 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,925 INFO L439 ceAbstractionStarter]: At program point L350(lines 343 369) the Hoare annotation is: (let ((.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)) (.cse2 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:08:57,925 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:08:57,925 INFO L443 ceAbstractionStarter]: For program point L284(lines 283 311) no Hoare annotation was computed. [2019-11-16 00:08:57,926 INFO L443 ceAbstractionStarter]: For program point L1275(lines 1275 1279) no Hoare annotation was computed. [2019-11-16 00:08:57,926 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 222) no Hoare annotation was computed. [2019-11-16 00:08:57,926 INFO L439 ceAbstractionStarter]: At program point L945(lines 938 955) the Hoare annotation is: (let ((.cse2 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse5 (<= ~c_req_type~0 1)) (.cse8 (= 3 ~m_run_pc~0)) (.cse9 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (= ~s_memory1~0 51)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ~c_req_a~0)) (.cse26 (and (and .cse2 (and (and .cse10 .cse11 .cse12) .cse3 .cse6 .cse7) .cse15) (= 6 ~m_run_pc~0))) (.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse14 (<= ~c_req_a~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (= 1 ULTIMATE.start_s_run_~req_a~1) .cse14 .cse15)) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse16 (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse17 (and .cse3 .cse5 (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0))) (or (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (<= 2 ~s_run_pc~0) .cse20 .cse11 .cse12) (and .cse8 .cse18 .cse19 .cse10 .cse9 .cse4 (= 0 ~s_run_pc~0) .cse20 .cse11 .cse12))) .cse6 .cse13) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50))) (and .cse17 .cse21 (= ~req_tt_a~0 0) .cse0 .cse22 .cse16 .cse23 (and (= 0 ~c_req_a~0) .cse24 .cse25 .cse20 .cse26) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse21 .cse22 .cse23 (and .cse1 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (and .cse26 .cse24 .cse25) .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1))))) [2019-11-16 00:08:57,926 INFO L443 ceAbstractionStarter]: For program point L813(lines 805 822) no Hoare annotation was computed. [2019-11-16 00:08:57,926 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1214) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L1144(lines 1144 1151) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L946(lines 871 1101) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 818) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-11-16 00:08:57,927 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 951) no Hoare annotation was computed. [2019-11-16 00:08:57,928 INFO L439 ceAbstractionStarter]: At program point L684(lines 677 721) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 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)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,928 INFO L439 ceAbstractionStarter]: At program point L552(lines 522 553) the Hoare annotation is: (let ((.cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse15 (= ~a_t~0 0)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse8 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2))) (let ((.cse12 (<= 2 ~s_run_pc~0)) (.cse13 (not .cse7)) (.cse9 (= ~s_memory1~0 51)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse16 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse17 (let ((.cse18 (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) .cse0 .cse1 (and (and .cse8 (and .cse2 .cse5 (and .cse3 .cse4) .cse6 .cse7)) (= 6 ~m_run_pc~0)))) (.cse19 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (<= 1 ~c_req_a~0) .cse18 (< 0 ULTIMATE.start_s_memory_read_~i) .cse19 .cse20 .cse10 .cse21 .cse11 .cse22 (<= ~c_req_a~0 1) .cse23) (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse18 .cse19 .cse20 .cse15 .cse21 .cse22 .cse23))))) (or (and .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (and (and .cse2 (and (= 3 ~m_run_pc~0) .cse3 .cse4) .cse5 .cse6 .cse7) (= ULTIMATE.start_m_run_~a~0 0) .cse8) .cse9 .cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 (<= 51 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse12 .cse13 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse14 .cse9 .cse15 .cse16 .cse17) (and .cse5 .cse12 (and .cse13 .cse3 .cse4 (<= 3 ~m_run_pc~0))) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse14 (= 51 ~c_rsp_d~0) .cse16 .cse17)))) [2019-11-16 00:08:57,928 INFO L443 ceAbstractionStarter]: For program point L751(lines 751 804) no Hoare annotation was computed. [2019-11-16 00:08:57,928 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 756) no Hoare annotation was computed. [2019-11-16 00:08:57,929 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 690) no Hoare annotation was computed. [2019-11-16 00:08:57,929 INFO L439 ceAbstractionStarter]: At program point L620(lines 613 630) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0))) (or (and (<= 0 ~a_t~0) (and .cse0 (and .cse1 .cse2) (<= 1 ~c_m_lock~0) .cse3) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse2 (not .cse3) .cse1) .cse0 (<= 2 ~s_run_pc~0)))) [2019-11-16 00:08:57,929 INFO L439 ceAbstractionStarter]: At program point L1281(lines 1274 1309) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (= ~s_memory0~0 50)) (.cse27 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse36 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse52 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse32 (= 0 ~c_req_type~0)) (.cse37 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse35 (= ~s_run_pc~0 2)) (.cse38 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse39 (= 6 ~m_run_pc~0))) (let ((.cse24 (and .cse46 .cse32 (and (and .cse37 (and .cse12 .cse4 (and .cse2 .cse7) .cse15 .cse35) .cse38) .cse39))) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse26 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~req_tt_a~0 1)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse33 (= 0 ~c_req_a~0)) (.cse45 (and .cse39 (and .cse37 (and .cse12 .cse36 .cse15 .cse35) .cse38))) (.cse22 (= ~req_tt_a~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse34 (<= 2 ~s_run_pc~0)) (.cse47 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ~c_req_d~0 51)) (.cse48 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse42 (<= 51 ~c_req_d~0)) (.cse43 (let ((.cse53 (and .cse17 (and .cse27 (and .cse12 .cse13 .cse15 .cse35 .cse54) .cse30 .cse38)))) (or (and .cse53 .cse44) (and .cse53 .cse28 .cse29)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (and (and .cse52 .cse2 .cse7) .cse12 .cse4 .cse15 .cse35)) (.cse50 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse11 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 50 ~c_rsp_d~0) .cse16 .cse23 .cse24 .cse25) (and .cse26 .cse21 (and .cse27 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse28 .cse29 .cse24 .cse30 .cse25) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse23 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse3 .cse32 .cse5 .cse8 .cse33 .cse2 .cse12 .cse16 .cse6 .cse7) (and .cse4 .cse34 (and .cse7 (not .cse35) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse35))) .cse16) (and (and (and (and .cse12 .cse4 .cse36 .cse35) .cse15) .cse37 .cse38) .cse39) (and .cse37 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse3 .cse32 .cse8 .cse33 .cse2 .cse12 .cse4 .cse16 .cse35 .cse6 .cse7) (and .cse26 .cse21 (and .cse27 .cse20 (and .cse45 .cse46 .cse32) .cse17 .cse30 .cse25) .cse18 .cse23 .cse31) (and .cse47 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 (and (and .cse51 .cse38) .cse37 .cse17 .cse28 .cse29)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse32 (and .cse33 .cse45)) .cse22 .cse17 .cse40 .cse48 .cse18 .cse16 .cse50 .cse28 .cse29 .cse19) (and .cse34 (and .cse52 .cse2 .cse7 .cse8)) (and .cse47 .cse37 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 .cse43) (and .cse39 (and .cse37 (and .cse2 .cse12 .cse4 .cse35 .cse7 .cse8) .cse38)) (and (and .cse9 .cse10 (and .cse11 .cse51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse50 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse40 .cse16 .cse44) (and (and .cse52 .cse7 .cse8) .cse12 .cse4 .cse35))))) [2019-11-16 00:08:57,930 INFO L439 ceAbstractionStarter]: At program point L224(lines 217 261) the Hoare annotation is: (let ((.cse14 (= ~a_t~0 0)) (.cse28 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse20 (= ~s_run_pc~0 2)) (.cse1 (<= 1 ~c_req_type~0)) (.cse15 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse17 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse5 (= 0 ~s_run_pc~0)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse16 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse21 (<= 2 ~s_run_pc~0)) (.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse22 (let ((.cse29 (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse19 .cse4 .cse12 .cse13 .cse20 (and (= 3 ~m_run_pc~0) .cse1 .cse15 .cse6 .cse17)) (<= ~c_req_a~0 1)) (= ~s_memory0~0 50))) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse14 .cse29 .cse28 .cse30) (and (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse29 (<= ULTIMATE.start_s_run_~req_a~1 1) .cse30)))) (.cse23 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ~c_req_d~0 51)) (.cse25 (<= 51 ~c_req_d~0)) (.cse26 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse27 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse19 .cse15 .cse17 (<= 0 ULTIMATE.start_m_run_~a~0) .cse18) (and (and (not .cse20) .cse6 .cse17) .cse19 .cse21) (and .cse0 .cse7 .cse10 .cse14 .cse16 (and .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse15 .cse17 .cse18)) (and .cse22 .cse23 .cse24 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse25 .cse26 .cse27) (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse27)))) [2019-11-16 00:08:57,930 INFO L443 ceAbstractionStarter]: For program point L1083(lines 1083 1087) no Hoare annotation was computed. [2019-11-16 00:08:57,930 INFO L443 ceAbstractionStarter]: For program point L621(lines 613 630) no Hoare annotation was computed. [2019-11-16 00:08:57,930 INFO L439 ceAbstractionStarter]: At program point L1216(lines 1209 1226) 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 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 0) .cse3 .cse4))) [2019-11-16 00:08:57,931 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 626) no Hoare annotation was computed. [2019-11-16 00:08:57,931 INFO L439 ceAbstractionStarter]: At program point L424(lines 417 452) 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))) (let ((.cse5 (and (<= 2 ~c_write_req_ev~0) .cse0 .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4))) (.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))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (and (= ULTIMATE.start_m_run_~a~0 0) .cse5) (<= 50 ~c_req_d~0) .cse6 (= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~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) .cse6 (<= ~c_req_d~0 51) .cse7 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-11-16 00:08:57,931 INFO L439 ceAbstractionStarter]: At program point L490-2(lines 490 518) the Hoare annotation is: (let ((.cse17 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (= ~a_t~0 0)) (.cse13 (<= 0 ~a_t~0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse15 (= ~s_run_pc~0 2)) (.cse16 (= ~c_empty_req~0 1)) (.cse10 (<= ~c_m_lock~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (let ((.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (let ((.cse19 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse23 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (and .cse13 (and .cse14 .cse4 .cse15 (and .cse16 .cse10 .cse8 .cse6))) (= 6 ~m_run_pc~0)) (= 0 ~c_req_type~0) .cse11 .cse12)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse19 .cse20 .cse17 .cse21 .cse18 .cse22 (<= ~c_req_a~0 1) .cse23 .cse24) (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse19 .cse20 .cse9 .cse21 .cse22 .cse23 .cse24)))) (.cse5 (<= 2 ~s_run_pc~0)) (.cse7 (not .cse15)) (.cse0 (= ~s_memory1~0 51))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse0 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) .cse3) (and .cse4 .cse5 .cse6 .cse7 (<= 3 ~m_run_pc~0) .cse8) (and .cse2 .cse0 .cse9 .cse3 .cse1) (and .cse4 .cse5 (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse10 .cse6 .cse7 .cse8) (<= 0 ULTIMATE.start_m_run_~a~0))) (and .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) .cse0 (and (= ULTIMATE.start_m_run_~a~0 0) .cse13 (and .cse14 .cse4 .cse15 (and (= 3 ~m_run_pc~0) .cse16 .cse10 .cse8 .cse6))) .cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse18 (<= 51 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0))))) [2019-11-16 00:08:57,932 INFO L439 ceAbstractionStarter]: At program point L358(lines 351 368) the Hoare annotation is: (let ((.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)) (.cse2 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 2)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-16 00:08:57,932 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1287) no Hoare annotation was computed. [2019-11-16 00:08:57,932 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 230) no Hoare annotation was computed. [2019-11-16 00:08:57,932 INFO L443 ceAbstractionStarter]: For program point L1217(lines 1165 1344) no Hoare annotation was computed. [2019-11-16 00:08:57,932 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:08:57,932 INFO L443 ceAbstractionStarter]: For program point L491(lines 490 518) no Hoare annotation was computed. [2019-11-16 00:08:57,932 INFO L443 ceAbstractionStarter]: For program point L359(lines 129 475) no Hoare annotation was computed. [2019-11-16 00:08:57,933 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1222) no Hoare annotation was computed. [2019-11-16 00:08:57,933 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 496) no Hoare annotation was computed. [2019-11-16 00:08:57,933 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-16 00:08:57,933 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 364) no Hoare annotation was computed. [2019-11-16 00:08:57,933 INFO L439 ceAbstractionStarter]: At program point L1021(lines 995 1022) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 0 ~a_t~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse13 (= ~s_run_pc~0 2)) (.cse21 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse25 (= 3 ~m_run_pc~0)) (.cse26 (= ~c_empty_req~0 1)) (.cse27 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (= ~c_empty_rsp~0 1))) (let ((.cse10 (and .cse25 .cse26 .cse27 .cse28)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (= ~s_memory0~0 50)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse6 (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (and .cse26 .cse11 .cse20 .cse12 .cse13 .cse27 .cse28 .cse21) (= 6 ~m_run_pc~0)))) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ~a_t~0 0)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (= 0 ULTIMATE.start_s_run_~req_a~1))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse2 .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 (and .cse10 .cse2 .cse11 .cse12 .cse4 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse16 (<= 51 ~c_req_d~0) (and .cse20 (and .cse10 .cse11 .cse12 .cse13 .cse21) .cse0 .cse22 .cse23)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res|) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse0 .cse22 .cse23 .cse6 (<= ~c_req_a~0 1) .cse7) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse2 .cse14 .cse4 (and .cse8 .cse9 (and (<= 1 ~c_req_type~0) (let ((.cse24 (and .cse25 .cse26 (not .cse13) .cse27))) (or (and (= 0 ~s_run_pc~0) .cse24) (and .cse24 (<= 2 ~s_run_pc~0)))) .cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse12 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse15 .cse16 .cse18 .cse19) .cse17)))) [2019-11-16 00:08:57,934 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 612) no Hoare annotation was computed. [2019-11-16 00:08:57,934 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 125) no Hoare annotation was computed. [2019-11-16 00:08:57,934 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 830) no Hoare annotation was computed. [2019-11-16 00:08:57,934 INFO L439 ceAbstractionStarter]: At program point L824-1(lines 824 830) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~a_t~0 0)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~s_run_st~0)) (.cse9 (= ~s_run_pc~0 2))) (let ((.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse0 (= ~s_memory1~0 51)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (let ((.cse11 (and (= ULTIMATE.start_s_run_~req_type~1 0) (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) .cse7 .cse8 .cse10) .cse6 .cse9) (<= 0 ULTIMATE.start_m_run_~a~0))) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0))) (.cse12 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse4 .cse11 .cse5 .cse12) (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse12))))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse0 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) .cse3) (and .cse4 .cse2 .cse0 .cse5 .cse3 .cse1) (and .cse6 (<= 2 ~s_run_pc~0) .cse7 .cse8 (not .cse9) (<= 3 ~m_run_pc~0) .cse10)))) [2019-11-16 00:08:57,935 INFO L439 ceAbstractionStarter]: At program point L758(lines 751 804) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (and (= 6 ~m_run_pc~0) (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)))) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,935 INFO L439 ceAbstractionStarter]: At program point L692(lines 685 720) the Hoare annotation is: (let ((.cse0 (and (and (<= 0 ~a_t~0) (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)) (<= 0 ULTIMATE.start_m_run_~a~0)) (= 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)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .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) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse5 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse6 .cse7) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7))) [2019-11-16 00:08:57,935 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-16 00:08:57,936 INFO L439 ceAbstractionStarter]: At program point L1089(lines 1082 1099) the Hoare annotation is: (let ((.cse13 (<= 0 ~a_t~0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0))) (let ((.cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse2 (and (let ((.cse18 (and (= 3 ~m_run_pc~0) .cse15))) (or (and .cse18 (<= 2 ~s_run_pc~0)) (and .cse18 (= 0 ~s_run_pc~0)))) .cse16 .cse17)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse1 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (and (and (= 6 ~m_run_pc~0) (and .cse15 .cse16 .cse13 .cse17 (= ~s_run_pc~0 2) .cse14)) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0))) (.cse7 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (= ~a_t~0 0)) (.cse12 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse10 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse2 .cse3 .cse4) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 (and (<= 1 ~c_req_a~0) (< 0 ULTIMATE.start_s_memory_read_~i) .cse6 .cse7 .cse8 .cse9 (<= ~c_req_a~0 1) .cse10) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and .cse13 .cse7 .cse0 (and .cse2 .cse14) .cse8 .cse9) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse1 (<= 51 ~c_req_d~0)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse7 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse3 .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse4 .cse12 .cse10)))) [2019-11-16 00:08:57,936 INFO L439 ceAbstractionStarter]: At program point L1156(lines 1108 1161) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (= ~s_memory0~0 50)) (.cse27 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse36 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse52 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse32 (= 0 ~c_req_type~0)) (.cse37 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse35 (= ~s_run_pc~0 2)) (.cse38 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse39 (= 6 ~m_run_pc~0))) (let ((.cse24 (and .cse46 .cse32 (and (and .cse37 (and .cse12 .cse4 (and .cse2 .cse7) .cse15 .cse35) .cse38) .cse39))) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse26 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~req_tt_a~0 1)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse33 (= 0 ~c_req_a~0)) (.cse45 (and .cse39 (and .cse37 (and .cse12 .cse36 .cse15 .cse35) .cse38))) (.cse22 (= ~req_tt_a~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse34 (<= 2 ~s_run_pc~0)) (.cse47 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ~c_req_d~0 51)) (.cse48 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse42 (<= 51 ~c_req_d~0)) (.cse43 (let ((.cse53 (and .cse17 (and .cse27 (and .cse12 .cse13 .cse15 .cse35 .cse54) .cse30 .cse38)))) (or (and .cse53 .cse44) (and .cse53 .cse28 .cse29)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (and (and .cse52 .cse2 .cse7) .cse12 .cse4 .cse15 .cse35)) (.cse50 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse11 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 50 ~c_rsp_d~0) .cse16 .cse23 .cse24 .cse25) (and .cse26 .cse21 (and .cse27 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse28 .cse29 .cse24 .cse30 .cse25) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse23 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse3 .cse32 .cse5 .cse8 .cse33 .cse2 .cse12 .cse16 .cse6 .cse7) (and .cse4 .cse34 (and .cse7 (not .cse35) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse35))) .cse16) (and (and (and (and .cse12 .cse4 .cse36 .cse35) .cse15) .cse37 .cse38) .cse39) (and .cse37 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse3 .cse32 .cse8 .cse33 .cse2 .cse12 .cse4 .cse16 .cse35 .cse6 .cse7) (and .cse26 .cse21 (and .cse27 .cse20 (and .cse45 .cse46 .cse32) .cse17 .cse30 .cse25) .cse18 .cse23 .cse31) (and .cse47 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 (and (and .cse51 .cse38) .cse37 .cse17 .cse28 .cse29)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse32 (and .cse33 .cse45)) .cse22 .cse17 .cse40 .cse48 .cse18 .cse16 .cse50 .cse28 .cse29 .cse19) (and .cse34 (and .cse52 .cse2 .cse7 .cse8)) (and .cse47 .cse37 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 .cse43) (and .cse39 (and .cse37 (and .cse2 .cse12 .cse4 .cse35 .cse7 .cse8) .cse38)) (and (and .cse9 .cse10 (and .cse11 .cse51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse50 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse40 .cse16 .cse44) (and (and .cse52 .cse7 .cse8) .cse12 .cse4 .cse35))))) [2019-11-16 00:08:57,937 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1082 1099) no Hoare annotation was computed. [2019-11-16 00:08:57,937 INFO L443 ceAbstractionStarter]: For program point L760(lines 760 764) no Hoare annotation was computed. [2019-11-16 00:08:57,937 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 698) no Hoare annotation was computed. [2019-11-16 00:08:57,937 INFO L439 ceAbstractionStarter]: At program point L1289(lines 1282 1308) the Hoare annotation is: (let ((.cse52 (= 3 ~m_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse44 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (= ~s_memory0~0 50)) (.cse27 (<= 1 ~c_req_a~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse33 (and .cse7 (<= 3 ~m_run_pc~0) .cse8)) (.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse54 (and .cse52 (<= 1 ~c_req_type~0) .cse7 .cse8)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse37 (= 0 ~c_req_type~0)) (.cse35 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse34 (= ~s_run_pc~0 2)) (.cse36 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse32 (= 6 ~m_run_pc~0))) (let ((.cse24 (and .cse46 .cse37 (and (and .cse35 (and .cse12 .cse4 (and .cse2 .cse7) .cse15 .cse34) .cse36) .cse32))) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse26 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse20 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse23 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~req_tt_a~0 1)) (.cse14 (and .cse0 .cse1 .cse54)) (.cse5 (= 0 ~s_run_pc~0)) (.cse38 (= 0 ~c_req_a~0)) (.cse45 (and .cse32 (and .cse35 (and .cse12 .cse33 .cse15 .cse34) .cse36))) (.cse22 (= ~req_tt_a~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse39 (<= 2 ~s_run_pc~0)) (.cse47 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse41 (<= ~c_req_d~0 51)) (.cse48 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse42 (<= 51 ~c_req_d~0)) (.cse43 (let ((.cse53 (and .cse17 (and .cse27 (and .cse12 .cse13 .cse15 .cse34 .cse54) .cse30 .cse36)))) (or (and .cse53 .cse44) (and .cse53 .cse28 .cse29)))) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse51 (and (and .cse52 .cse2 .cse7) .cse12 .cse4 .cse15 .cse34)) (.cse50 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse40 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse5 .cse15)) .cse16) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse11 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 50 ~c_rsp_d~0) .cse16 .cse23 .cse24 .cse25) (and .cse26 .cse21 (and .cse27 (< 0 ULTIMATE.start_s_memory_read_~i) .cse17 .cse28 .cse29 .cse24 .cse30 .cse25) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse23 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse32 (and (and (and .cse12 .cse4 .cse33 .cse34) .cse15) .cse35 .cse36)) (and .cse3 .cse37 .cse5 .cse8 .cse38 .cse2 .cse12 .cse16 .cse6 .cse7) (and .cse4 .cse39 (and .cse7 (not .cse34) .cse8)) (and (and .cse9 .cse10 (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse34))) .cse16) (and .cse35 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse3 .cse37 .cse8 .cse38 .cse2 .cse12 .cse4 .cse16 .cse34 .cse6 .cse7) (and .cse26 .cse21 (and .cse27 .cse20 (and .cse45 .cse46 .cse37) .cse17 .cse30 .cse25) .cse18 .cse23 .cse31) (and .cse47 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 (and (and .cse51 .cse36) .cse35 .cse17 .cse28 .cse29)) (and .cse4 .cse14 .cse5) (and .cse11 (and .cse37 (and .cse38 .cse45)) .cse22 .cse17 .cse40 .cse48 .cse18 .cse16 .cse50 .cse28 .cse29 .cse19) (and .cse39 (and .cse52 .cse2 .cse7 .cse8)) (and .cse47 .cse35 .cse40 .cse41 .cse48 .cse49 .cse50 .cse42 .cse43) (and .cse32 (and .cse35 (and .cse2 .cse12 .cse4 .cse34 .cse7 .cse8) .cse36)) (and (and .cse9 .cse10 (and .cse11 .cse51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse50 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse40 .cse16 .cse44) (and (and .cse52 .cse7 .cse8) .cse12 .cse4 .cse34))))) [2019-11-16 00:08:57,938 INFO L439 ceAbstractionStarter]: At program point L232(lines 225 260) the Hoare annotation is: (let ((.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse30 (<= 1 ~c_req_type~0)) (.cse32 (and (= 3 ~m_run_pc~0) .cse11 .cse12)) (.cse31 (and (<= ~m_run_pc~0 0) .cse12 .cse11))) (let ((.cse8 (= ~a_t~0 0)) (.cse26 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse16 (and .cse30 (or .cse32 .cse31))) (.cse13 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse6 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse10 (= ~s_run_pc~0 2)) (.cse15 (<= ~c_req_a~0 0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (and .cse15 (<= ULTIMATE.start_m_run_~a~0 0) .cse17 .cse18 (and .cse30 .cse14 (or .cse31 .cse32)) (<= 0 ULTIMATE.start_m_run_~a~0) .cse19)) (.cse5 (= 0 ~s_run_pc~0)) (.cse20 (let ((.cse27 (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 0 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~req_a~0) (and .cse16 .cse13 .cse4 .cse6 .cse7 .cse10 .cse14) (<= ~c_req_a~0 1)) (= ~s_memory0~0 50))) (.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse27 .cse28 .cse8 .cse26 .cse29) (and .cse27 .cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse29)))) (.cse21 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= ~c_req_d~0 51)) (.cse23 (<= 51 ~c_req_d~0)) (.cse24 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse25 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (and (not .cse10) .cse11 .cse12) .cse13 (<= 2 ~s_run_pc~0)) (and .cse0 .cse1 .cse2 .cse8 (and (and .cse13 .cse4 .cse6 .cse7 .cse10 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19)) (= ULTIMATE.start_m_run_~a~0 0)) .cse9) (and .cse20 .cse21 .cse22 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse23 .cse24 .cse25) (and .cse3 .cse13 .cse5) (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse25)))))) [2019-11-16 00:08:57,938 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 124) no Hoare annotation was computed. [2019-11-16 00:08:57,938 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1095) no Hoare annotation was computed. [2019-11-16 00:08:57,938 INFO L439 ceAbstractionStarter]: At program point L101(lines 96 838) 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:08:58,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:08:58 BoogieIcfgContainer [2019-11-16 00:08:58,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:08:58,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:08:58,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:08:58,109 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:08:58,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:13" (3/4) ... [2019-11-16 00:08:58,112 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:08:58,133 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:08:58,134 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:08:58,162 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && a_t == 0) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((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) && 6 == m_run_pc)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (6 == m_run_pc && (0 <= a_t && ((((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) && 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)) || ((((((((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)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((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)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) [2019-11-16 00:08:58,163 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) [2019-11-16 00:08:58,163 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && a_t == 0) || (((((((((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)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((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) && 6 == m_run_pc)) || (((((((((((m_run_pc <= 0 && 0 == c_req_type) && 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) && a_t == 0) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((((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) && 0 <= a) && s_memory0 == 50) && i == req_a) && 1 <= req_a) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && (req_type == 0 && ((0 <= a_t && (((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) && 0 <= a) && 6 == m_run_pc) && 0 == c_req_type) && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && 51 == rsp_d)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || ((((((((c_req_d <= 50 && 50 <= c_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) && a == 0) && a_t == 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (6 == m_run_pc && (0 <= a_t && ((((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) && 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)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && (req_type == 0 && ((0 <= a_t && (((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) && 0 <= a) && 6 == m_run_pc) && 0 == c_req_type) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((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)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) [2019-11-16 00:08:58,163 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) [2019-11-16 00:08:58,164 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) [2019-11-16 00:08:58,164 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) [2019-11-16 00:08:58,164 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || (6 == m_run_pc && (0 <= a_t && 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) && 0 <= a)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((0 <= 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) && 6 == m_run_pc)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && ((6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((50 == \result && ((6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,165 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (6 == m_run_pc && (((((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)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) [2019-11-16 00:08:58,165 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (6 == m_run_pc && (((((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)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) [2019-11-16 00:08:58,166 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 == \result && s_memory0 == 50) && (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 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) && a_t == 0)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((2 <= c_write_req_ev && 0 == c_req_type) && (((((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) && a_t == 0)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && ((2 <= c_write_req_ev && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && (2 <= c_write_req_ev && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && a_t == 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_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:08:58,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 6 == m_run_pc) && i <= 1) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) && s_run_pc == 2) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((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 <= a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && (((((1 <= c_req_type && ((0 == s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || ((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a) [2019-11-16 00:08:58,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((v <= 51 && a == 1) && ((((((0 < i + 1 && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a <= 1) && a_t == 0) && 1 <= a) && i <= 1) || (((((((1 <= c_req_a && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 0 < i) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v) || (((((((((((a == 0 && ((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) && 0 <= a_t) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d)) || (((((((((v <= 51 && rsp_d___0 == 51) && ((((((0 < i + 1 && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a <= 1) && a_t == 0) && 1 <= a) && i <= 1) || (((((((1 <= c_req_a && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 0 < i) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((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)) || ((((((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:08:58,168 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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) || (((((((((((((((((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) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 51 <= v) && i <= 1)) || (((((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)) || ((((v <= 51 && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && 6 == m_run_pc && 0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && i <= 1) && req_tt_a == 1)) || (((((((((((0 == c_req_a && 6 == m_run_pc && 0 <= a_t && ((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) && 0 == c_req_type) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1)) || ((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 < i + 1) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 51 <= v) && i <= 1)) || ((0 <= a_t && ((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) [2019-11-16 00:08:58,168 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && (((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1) || (((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1))) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) || (((((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)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1) || (((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1)))) || ((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)) || (((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && c_req_d <= 51) && s_memory1 == 51) && (a == 0 && 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) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) [2019-11-16 00:08:58,168 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) || ((((((((((((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && i <= 1) || ((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && a == 1) && rsp_d___0 == 51) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((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)) || (((((((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && i <= 1) || ((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && (((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) && 0 <= a_t) && a == 0) && i == req_a) && c_req_d <= 51) && v == req_d) [2019-11-16 00:08:58,169 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) [2019-11-16 00:08:58,169 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((v <= 51 && s_memory1 == 51) && a_t == 0) && 51 <= v) && ((((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) || ((((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && a == 0) && i == req_a) && c_req_d <= 51) && v == req_d) && 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) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((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)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && ((((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || (((((!(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:08:58,169 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) [2019-11-16 00:08:58,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && c_req_d <= 51) && (((((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) && a == 0) && 0 <= a_t) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) || ((((((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)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || (((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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) && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1)))) || ((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)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && (((((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || (((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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) && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1))) [2019-11-16 00:08:58,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) [2019-11-16 00:08:58,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= s_run_pc) || ((3 == m_run_pc && c_empty_req == 1) && 0 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a == 0) && a_t == 0) && 50 <= req_d) && req_d <= 50) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && ((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((((0 <= a_t && s_memory0 == 50) && i == req_a) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= s_run_pc) || ((3 == m_run_pc && c_empty_req == 1) && 0 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 0 <= a) && 1 <= req_a) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((((((((50 == \result && ((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,170 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) [2019-11-16 00:08:58,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) [2019-11-16 00:08:58,171 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) || ((((((1 == req_a___0 && v <= 51) && (((1 <= c_req_a && 0 < i + 1) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && (((a == 0 && 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) || (((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) && 0 <= a) && 6 == m_run_pc))) && c_req_a <= 1) && i <= 1) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((1 == req_a___0 && 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) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((0 <= 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) && 0 <= a)) || ((((i == req_a && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && ((a == 0 && 1 <= req_a) && req_a <= 1) && (((0 == c_req_a && (((a == 0 && 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) || (((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) && 0 <= a) && 6 == m_run_pc))) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && (((1 <= c_req_a && 0 < i + 1) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && (((a == 0 && 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) || (((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) && 0 <= a) && 6 == m_run_pc))) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) [2019-11-16 00:08:58,172 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == req_a___0 && 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) && c_req_a <= 1) && 51 == rsp_d) && 6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,172 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) || (((((((((((0 == c_req_a && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && (a == 0 && 0 <= a_t) && ((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) && 0 == req_a___0)) || ((((((((((((((((((1 <= c_req_a && 0 < i + 1) && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && c_req_a <= 1) && i <= 1) || ((((((((1 <= c_req_a && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && a == 1) && rsp_d___0 == 51) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || (((((!(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)) || (((((((((((((1 <= c_req_a && 0 < i + 1) && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && c_req_a <= 1) && i <= 1) || ((((((((1 <= c_req_a && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v) [2019-11-16 00:08:58,172 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && (req_type == 0 && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == c_req_type) && i <= 1) || (((((((1 == req_a___0 && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == c_req_type) && c_req_a <= 1) && i <= 1) && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) [2019-11-16 00:08:58,173 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) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 <= v)) || (((((((((((0 == c_req_a && 0 == c_req_type) && (a == 0 && 0 <= a_t) && ((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) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 0 == req_a___0) [2019-11-16 00:08:58,173 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 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0 && ((2 <= s_run_st && (((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))) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && i == req_a) && v == req_d)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 <= v) [2019-11-16 00:08:58,173 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 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0 && ((2 <= s_run_st && (((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))) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && i == req_a) && v == req_d)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 <= v) [2019-11-16 00:08:58,174 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) || ((((v <= 51 && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((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_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((0 <= a_t && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0 && ((2 <= s_run_st && (((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))) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && i == req_a) && v == req_d)) || (((((((((rsp_d___0 == 51 && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((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_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((0 <= a_t && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) [2019-11-16 00:08:58,174 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((0 <= a_t && (((((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) && 6 == m_run_pc) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 <= a_t && (((((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) && 6 == m_run_pc) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,176 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && 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) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) || (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= 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) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,176 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,176 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,176 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) [2019-11-16 00:08:58,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && (((((0 < i + 1 && a == 0) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a_t == 0) && i <= 1) || ((((((1 <= c_req_a && 0 < i) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1))) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) || (((((a == 0 && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((((0 < i + 1 && a == 0) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a_t == 0) && i <= 1) || ((((((1 <= c_req_a && 0 < i) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1)))) || ((((((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:08:58,289 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1e2efb8b-95a6-4f74-a2eb-975333418d81/bin/uautomizer/witness.graphml [2019-11-16 00:08:58,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:08:58,291 INFO L168 Benchmark]: Toolchain (without parser) took 166291.84 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 951.4 MB in the beginning and 1.8 GB in the end (delta: -860.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:08:58,291 INFO L168 Benchmark]: CDTParser took 0.20 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:08:58,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:58,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.35 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:58,292 INFO L168 Benchmark]: Boogie Preprocessor took 88.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:58,293 INFO L168 Benchmark]: RCFGBuilder took 1142.50 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: 82.4 MB). Peak memory consumption was 82.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:58,293 INFO L168 Benchmark]: TraceAbstraction took 164224.53 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -791.3 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-11-16 00:08:58,293 INFO L168 Benchmark]: Witness Printer took 181.56 ms. Allocated memory is still 4.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:58,295 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.20 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 567.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.35 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1142.50 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: 82.4 MB). Peak memory consumption was 82.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 164224.53 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -791.3 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 181.56 ms. Allocated memory is still 4.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 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: 669]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: ((((((51 <= req_d && s_memory0 == 50 && ((((1 <= c_req_a && 0 <= a_t) && (((((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) && 0 <= a) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d) || (a_t == 0 && ((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && (((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)) || ((((((((a == 0 && v <= 51) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 0 == req_a) && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && ((((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: (((((0 <= a_t && s_memory0 == 50 && ((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) && 0 <= a) && c_req_d <= 51) && 51 <= c_req_d) || ((((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) && a_t == 0)) || ((((((((a == 0 && v <= 51) && 0 == c_req_type && 0 == c_req_a && (((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && 0 == req_a___0)) || (((((1 == req_a___0 && ((((1 <= c_req_a && 0 < i + 1) && 0 == c_req_type && (((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && v <= 51) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 1082]: Loop Invariant Derived loop invariant: ((((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= s_run_pc) || ((3 == m_run_pc && c_empty_req == 1) && 0 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a == 0) && a_t == 0) && 50 <= req_d) && req_d <= 50) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && ((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((((0 <= a_t && s_memory0 == 50) && i == req_a) && (((((3 == m_run_pc && c_empty_req == 1) && 2 <= s_run_pc) || ((3 == m_run_pc && c_empty_req == 1) && 0 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 0 <= a) && 1 <= req_a) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((((((((50 == \result && ((6 == m_run_pc && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 559]: 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) || (((((((((((0 == c_req_a && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && (a == 0 && 0 <= a_t) && ((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) && 0 == req_a___0)) || ((((((((((((((((((1 <= c_req_a && 0 < i + 1) && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && c_req_a <= 1) && i <= 1) || ((((((((1 <= c_req_a && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && a == 1) && rsp_d___0 == 51) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || (((((!(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)) || (((((((((((((1 <= c_req_a && 0 < i + 1) && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && c_req_a <= 1) && i <= 1) || ((((((((1 <= c_req_a && ((((6 == m_run_pc && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v) - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) - InvariantResult [Line: 567]: 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) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 <= v)) || (((((((((((0 == c_req_a && 0 == c_req_type) && (a == 0 && 0 <= a_t) && ((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) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 0 == req_a___0) - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((((((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && c_req_d <= 51) && (((((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) && a == 0) && 0 <= a_t) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) || ((((((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)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || (((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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) && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1)))) || ((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)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && (((((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || (((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && (0 <= a_t && (((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) && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1))) - InvariantResult [Line: 489]: 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) || ((((((((((((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && i <= 1) || ((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && a == 1) && rsp_d___0 == 51) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((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)) || (((((((((((0 < i + 1 && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && i <= 1) || ((((((((1 <= c_req_a && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && 0 <= a_t && ((((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) && 0 < i) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_req_a <= 1) && i <= 1)) && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && (((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) && 0 <= a_t) && a == 0) && i == req_a) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 1258]: 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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && 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) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) || (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= 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) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) - InvariantResult [Line: 1266]: 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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((((((51 <= req_d && s_memory0 == 50 && ((((1 <= c_req_a && 0 <= a_t) && (((((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) && 0 <= a) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d) || (a_t == 0 && ((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && (((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)) || ((((((((a == 0 && v <= 51) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 0 == req_a) && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && ((((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == req_a___0 && 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) && c_req_a <= 1) && 51 == rsp_d) && 6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 139]: 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) || ((((((((((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)) || (((((((c_req_d <= 51 && s_memory1 == req_d) && s_memory1 == 51) && (((((i == req_a && s_memory0 == 50 && (((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 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 <= req_a) && req_a <= 1) && 1 <= a) || ((((i == req_a && a_t == 0) && s_memory0 == 50 && (((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 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) && 0 == req_a) && 1 <= a))) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || (((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 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) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((i == req_a && s_memory0 == 50 && (((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 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 <= req_a) && req_a <= 1) && 1 <= a) || ((((i == req_a && a_t == 0) && s_memory0 == 50 && (((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 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) && 0 == req_a) && 1 <= a)) && 51 <= req_d) && 0 == req_a) && req_d <= 51)) || ((((((req_d <= 50 && 0 == c_req_a) && ((((((((((a <= 0 && 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_type) && a_t == 0) && 50 <= req_d) && 0 <= a) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && v <= 51) && 0 == c_req_type && 0 == c_req_a && (((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && 0 == req_a___0) || (((((1 == req_a___0 && ((((1 <= c_req_a && 0 < i + 1) && 0 == c_req_type && (((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && v <= 51) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((0 <= a_t && s_memory0 == 50 && ((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) && 0 <= a) && c_req_d <= 51) && 51 <= c_req_d)) || ((c_req_d <= 50 && (a == 0 && (((2 <= c_write_req_ev && (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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0) && 50 <= c_req_d) - InvariantResult [Line: 685]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 930]: Loop Invariant Derived loop invariant: ((((((51 <= req_d && s_memory0 == 50 && ((((1 <= c_req_a && 0 <= a_t) && (((((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) && 0 <= a) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d) || (a_t == 0 && ((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && (((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)) || ((((((((a == 0 && v <= 51) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 0 == req_a) && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && ((((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: ((((((((v <= 51 && a == 1) && ((((((0 < i + 1 && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a <= 1) && a_t == 0) && 1 <= a) && i <= 1) || (((((((1 <= c_req_a && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 0 < i) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v) || (((((((((((a == 0 && ((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) && 0 <= a_t) && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d)) || (((((((((v <= 51 && rsp_d___0 == 51) && ((((((0 < i + 1 && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a <= 1) && a_t == 0) && 1 <= a) && i <= 1) || (((((((1 <= c_req_a && (((((0 <= a_t && ((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 0 < i) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((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)) || ((((((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: 392]: 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) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((3 == 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((51 <= req_d && s_memory0 == 50) && s_memory1 == req_d) && i == req_a) && c_req_d <= 51) && req_d <= 51) && 0 <= a_t && (((((3 == 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) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 0 <= a) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 == \result && s_memory0 == 50) && (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 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) && a_t == 0)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((2 <= c_write_req_ev && 0 == c_req_type) && (((((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) && a_t == 0)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && ((2 <= c_write_req_ev && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (a == 0 && (2 <= c_write_req_ev && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && a_t == 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((((((((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) && (((((((3 == m_run_pc && 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 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((3 == m_run_pc && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 575]: 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 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0 && ((2 <= s_run_st && (((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))) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && i == req_a) && v == req_d)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 <= v) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((((((((((a <= 1 && 1 <= req_a) && s_memory0 == 50 && (((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && 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_a <= 1) && 1 <= a) || ((((a <= 1 && a_t == 0) && s_memory0 == 50 && (((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && 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) && 0 == req_a) && 1 <= a)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 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) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((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)) || (((((((((((a <= 1 && 1 <= req_a) && s_memory0 == 50 && (((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && 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_a <= 1) && 1 <= a) || ((((a <= 1 && a_t == 0) && s_memory0 == 50 && (((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && 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) && 0 == req_a) && 1 <= a)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && a_t == 0) && 50 <= req_d) && (((((((((((((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) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 1346]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((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) && (((((((3 == m_run_pc && 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 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((3 == m_run_pc && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 583]: 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 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0 && ((2 <= s_run_st && (((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))) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && i == req_a) && v == req_d)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && ((((((((0 <= a_t && 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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 <= v) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((((((((((((3 == m_run_pc && s_memory0 == req_d) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && req_d <= 50) || (((((((((((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) && ((((((3 == m_run_pc && 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) && req_a <= 1) && 51 <= c_req_d) && 0 <= a) - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: ((((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && (((((0 < i + 1 && a == 0) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a_t == 0) && i <= 1) || ((((((1 <= c_req_a && 0 < i) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1))) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) || (((((a == 0 && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((((0 < i + 1 && a == 0) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && a_t == 0) && i <= 1) || ((((((1 <= c_req_a && 0 < i) && (((req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1)))) || ((((((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: 1274]: 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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && (((((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) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 50 <= req_d) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 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 && 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) && a == 0) && 50 <= req_d)) || (((((((((((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && a_t == 0) && 0 == req_a) && 1 <= a) || ((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && 1 <= req_a) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || ((((((((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)) || (((((((((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && a_t == 0) && 0 == req_a) && 1 <= a) || ((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && 1 <= req_a) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 1282]: 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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (6 == m_run_pc && (((((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)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((((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) || ((((((((i == req_a && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && (((((((((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) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_type) && 1 <= a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) || ((((((((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) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_type) && 1 <= a) && s_memory0 == 50) && a_t == 0) && 0 == req_a))) && 51 <= req_d) && req_d <= 51)) || ((((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((req_d <= 50 && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 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) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((i == req_a && (((((((((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) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_type) && 1 <= a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) || ((((((((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) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_type) && 1 <= a) && s_memory0 == 50) && a_t == 0) && 0 == req_a))) && 51 <= req_d) && 0 == req_a) && req_d <= 51)) || ((2 <= s_run_st && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) - InvariantResult [Line: 759]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 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) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_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)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && a_t == 0) && 50 <= req_d) && (((((((((((((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) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((a_t == 0 && ((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && 0 == req_a) && 1 <= a) || (((1 <= req_a && ((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || ((((((((((a_t == 0 && ((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && 0 == req_a) && 1 <= a) || (((1 <= req_a && ((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 960]: Loop Invariant Derived loop invariant: ((((((51 <= req_d && s_memory0 == 50 && ((((1 <= c_req_a && 0 <= a_t) && (((((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) && 0 <= a) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d) || (a_t == 0 && ((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && (((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)) || ((((((((a == 0 && v <= 51) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 0 == req_a) && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && ((((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: ((((((51 <= req_d && s_memory0 == 50 && ((((1 <= c_req_a && 0 <= a_t) && (((((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) && 0 <= a) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d) || (a_t == 0 && ((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && (((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)) || ((((((((a == 0 && v <= 51) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 0 == req_a) && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && ((((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((0 <= a_t && (((((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) && 6 == m_run_pc) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((((((((0 <= a_t && (((((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) && 6 == m_run_pc) && rsp_d___0 == 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && (((((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) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 50 <= req_d) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 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 && 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) && a == 0) && 50 <= req_d)) || (((((((((((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && a_t == 0) && 0 == req_a) && 1 <= a) || ((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && 1 <= req_a) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || ((((((((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)) || (((((((((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && a_t == 0) && 0 == req_a) && 1 <= a) || ((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && 1 <= req_a) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 401]: 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) || (((((((((c_req_d <= 50 && 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((((((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) && 51 <= req_d) && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && i == req_a) && c_req_d <= 51) && v == req_d) && 0 <= a) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((0 <= 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) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((((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) && (((((((3 == m_run_pc && 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 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((3 == m_run_pc && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 591]: 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) || ((((v <= 51 && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((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_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((0 <= a_t && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0 && ((2 <= s_run_st && (((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))) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_a) && i == req_a) && v == req_d)) || (((((((((rsp_d___0 == 51 && ((((((((((1 <= c_req_a && 0 < i + 1) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((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_t == 0) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 6 == m_run_pc && (((0 <= a_t && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((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) || (((((((((((((((((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) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 51 <= v) && i <= 1)) || (((((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)) || ((((v <= 51 && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && 6 == m_run_pc && 0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && i <= 1) && req_tt_a == 1)) || (((((((((((0 == c_req_a && 6 == m_run_pc && 0 <= a_t && ((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) && 0 == c_req_type) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1)) || ((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 < i + 1) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 51 <= v) && i <= 1)) || ((0 <= a_t && ((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) - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && a_t == 0) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((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) && 6 == m_run_pc)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (6 == m_run_pc && (0 <= a_t && ((((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) && 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)) || ((((((((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)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((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)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: (((((((((((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) && (((((((3 == m_run_pc && 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 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((3 == m_run_pc && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && (req_type == 0 && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == c_req_type) && i <= 1) || (((((((1 == req_a___0 && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == c_req_type) && c_req_a <= 1) && i <= 1) && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) - InvariantResult [Line: 1312]: 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) || ((((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) && a_t == 0)) || (6 == m_run_pc && (0 <= a_t && 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) && 0 <= a)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((0 <= 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) && 6 == m_run_pc)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && ((6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((50 == \result && ((6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 1290]: 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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (6 == m_run_pc && (((((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)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 723]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((0 <= a_t && (((((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) && 6 == m_run_pc) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 <= a_t && (((((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) && 6 == m_run_pc) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 96]: 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: 67]: Loop Invariant Derived loop invariant: ((0 == req_a && ((((((((c_req_d <= 50 && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && ((((((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_m_lock) && req_type <= 1) && 50 <= c_req_d) && a == 0) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) || (((((((((c_req_d <= 50 && 50 <= c_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) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 == req_a)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && ((((((((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) && 0 <= a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((0 < i + 1 && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (req_type == 0 && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == c_req_type) && 0 == req_a___0) && i <= 1) || ((((((1 == req_a___0 && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == c_req_type) && c_req_a <= 1) && i <= 1) && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 409]: 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) || (((((((((c_req_d <= 50 && 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((((((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) && 51 <= req_d) && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && i == req_a) && c_req_d <= 51) && v == req_d) && 0 <= a) - InvariantResult [Line: 1177]: 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 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((((((v <= 51 && s_memory1 == 51) && a_t == 0) && 51 <= v) && ((((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) || ((((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && a == 0) && i == req_a) && c_req_d <= 51) && v == req_d) && 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) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((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)) || (((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && ((((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && i <= 1) || ((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && (((((0 <= a_t && (((2 <= c_write_req_ev && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && i <= 1))) && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v)) || (((((!(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: 417]: 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) || (((((((((c_req_d <= 50 && 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((((((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) && 51 <= req_d) && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && i == req_a) && c_req_d <= 51) && v == req_d) && 0 <= a) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((rsp_d___0 == 51 && 51 == x) && s_memory1 == 51) && 51 == \result) && req_tt_a == 1) && (((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1) || (((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1))) && 51 == rsp_d) && v <= 51) && 51 == c_rsp_d) && 51 <= v) || (((((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)) || ((((v <= 51 && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((((((((((1 <= c_req_a && 0 < i) && a <= 1) && 1 <= req_a___0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && 1 <= a) && c_req_a <= 1) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1) || (((((((0 < i + 1 && a <= 1) && 1 <= req_a___0) && a_t == 0) && req_a___0 <= 1) && 1 <= a) && (((req_type == 0 && (0 <= a_t && ((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) && 6 == m_run_pc) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && i <= 1)))) || ((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)) || (((((((((((s_memory0 == 50 && s_memory1 == req_d) && req_type___0 == 0) && i == req_a) && c_req_d <= 51) && s_memory1 == 51) && (a == 0 && 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) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) - InvariantResult [Line: 1185]: 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 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((((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) && (((((((3 == m_run_pc && 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 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((3 == m_run_pc && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((((((((((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) && (((((((3 == m_run_pc && 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 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((3 == m_run_pc && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (((((((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && (((((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) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 50 <= req_d) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 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 && 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) && a == 0) && 50 <= req_d)) || (((((((((((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && a_t == 0) && 0 == req_a) && 1 <= a) || ((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && 1 <= req_a) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || ((((((((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)) || (((((((((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && a_t == 0) && 0 == req_a) && 1 <= a) || ((((((((((1 <= c_req_a && req_a <= 1) && 0 <= a_t) && 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) && s_memory0 == 50) && a <= 1) && 1 <= req_a) && req_a <= 1) && 1 <= a)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 263]: 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) || (((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && (((((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) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 50 <= req_d)) || ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 1108]: 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) || ((((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) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && i <= 1)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 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) && 6 == m_run_pc)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= 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) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((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)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1)))) || (6 == m_run_pc && (0 <= a_t && ((((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) && 0 <= a)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0 && (((((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 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_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) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: (((((((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) || ((((((1 == req_a___0 && v <= 51) && (((1 <= c_req_a && 0 < i + 1) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && (((a == 0 && 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) || (((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) && 0 <= a) && 6 == m_run_pc))) && c_req_a <= 1) && i <= 1) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((1 == req_a___0 && 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) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((0 <= 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) && 0 <= a)) || ((((i == req_a && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && ((a == 0 && 1 <= req_a) && req_a <= 1) && (((0 == c_req_a && (((a == 0 && 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) || (((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) && 0 <= a) && 6 == m_run_pc))) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && (((1 <= c_req_a && 0 < i + 1) && s_memory0 == 50 && (req_type == 0 && 0 == c_req_type) && (((a == 0 && 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) || (((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) && 0 <= a) && 6 == m_run_pc))) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 805]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 6 == m_run_pc) && i <= 1) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) && s_run_pc == 2) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((51 <= req_d && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((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 <= a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1)) || ((((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && 0 == c_req_type) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 6 == m_run_pc) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && (((((1 <= c_req_type && ((0 == s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || ((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a) - InvariantResult [Line: 128]: 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) || ((((((((((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) && ((((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) && 0 <= a_t) && 1 <= a) - InvariantResult [Line: 425]: 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) || (((((((((c_req_d <= 50 && 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((((((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) && 51 <= req_d) && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && i == req_a) && c_req_d <= 51) && v == req_d) && 0 <= a) - InvariantResult [Line: 1193]: 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 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 96]: 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: 455]: 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) || (((((((((c_req_d <= 50 && 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((((((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) && 51 <= req_d) && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && i == req_a) && c_req_d <= 51) && v == req_d) && 0 <= a) - InvariantResult [Line: 433]: 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) || (((((((((c_req_d <= 50 && 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) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((((((((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) && 51 <= req_d) && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && i == req_a) && c_req_d <= 51) && v == req_d) && 0 <= a) - InvariantResult [Line: 1201]: 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 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 96]: 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: 96]: 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) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && 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) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 129]: 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) || (((((((((((m_run_pc <= 0 && 0 == c_req_type) && 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) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 1 <= a) && (((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 <= 1) && 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)) || ((((((((((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) && ((((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) && 0 <= a_t) && 1 <= 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) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((c_req_d <= 51 && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51) && (((((i == req_a && a_t == 0) && ((((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 1) && (((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) && s_memory0 == 50) && 0 == req_a) && 1 <= a) || ((((i == req_a && ((((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 1) && (((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) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a))) || ((((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 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) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((51 <= req_d && 0 == req_a) && req_d <= 51) && (((((i == req_a && a_t == 0) && ((((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 1) && (((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) && s_memory0 == 50) && 0 == req_a) && 1 <= a) || ((((i == req_a && ((((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && a <= 1) && (((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) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a)))) || (((((((((((((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_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 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) && a_t == 0) && 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: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((((51 <= req_d && s_memory0 == 50) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) || ((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)) || ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 == req_a) || ((((((((((((3 == m_run_pc && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 1 <= req_a) && req_a <= 1)) && 51 <= req_d) && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 == req_a) || ((((((((((((3 == m_run_pc && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 1 <= req_a) && req_a <= 1)) && 0 <= a_t) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a)) || (((((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)) || (((((((((((((s_memory0 == req_d && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || (((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && (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) && 0 == s_run_pc) && 1 <= c_m_lock) && a_t == 0)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((((((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)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((req_d <= 50 && 0 == c_req_a) && (((((((((((m_run_pc <= 0 && req_a <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && a == 0) && 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 == c_req_type) && a_t == 0) && 50 <= req_d) || ((((((((((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)) || (((((((((a <= 1 && i == req_a) && a_t == 0) && s_memory0 == 50 && ((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && (((((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) && 0 == req_a) && 1 <= a) || (((((a <= 1 && i == req_a) && 1 <= req_a) && req_a <= 1) && s_memory0 == 50 && ((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && (((((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)) && 51 <= req_d) && 0 == req_a) && req_d <= 51)) || ((((((((((((((((req_d <= 50 && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 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) && a_t == 0) && 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)) || (((((((c_req_d <= 51 && s_memory1 == req_d) && s_memory1 == 51) && ((((((a <= 1 && i == req_a) && a_t == 0) && s_memory0 == 50 && ((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && (((((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) && 0 == req_a) && 1 <= a) || (((((a <= 1 && i == req_a) && 1 <= req_a) && req_a <= 1) && s_memory0 == 50 && ((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && (((((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))) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51) - InvariantResult [Line: 1162]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((1 <= c_req_a && 0 <= a_t) && 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) && 0 <= a) && s_memory0 == 50) && i == req_a) && 1 <= req_a) && req_a <= 1) || (((((((1 <= c_req_a && 0 <= a_t) && 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) && 0 <= a) && s_memory0 == 50) && i == req_a) && 0 == req_a)) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) || (((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) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || (((((((((((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) && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2)) || (((((((((c_req_d <= 50 && ((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= c_req_d) && i == req_a) && a_t == 0) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || ((((((((((((1 <= c_req_a && 0 <= a_t) && 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) && 0 <= a) && s_memory0 == 50) && i == req_a) && 1 <= req_a) && req_a <= 1) || (((((((1 <= c_req_a && 0 <= a_t) && 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) && 0 <= a) && s_memory0 == 50) && i == req_a) && 0 == req_a)) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a)) || ((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_t == 0 && ((c_req_d <= 50 && (((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) && 50 <= c_req_d) && a == 0)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 96]: 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: 1052]: Loop Invariant Derived loop invariant: (((((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && s_memory0 == req_d) && v == req_d) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && ((((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)) && 0 == s_run_pc))) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && i == req_a) && a_t == 0) && 0 == req_a) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1)) || ((((a == 0 && i == req_a) && a_t == 0) && (((((c_req_d <= 50 && 50 <= c_req_d) && ((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && (req_type == 0 && 6 == m_run_pc && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1) && 0 <= a) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((51 <= req_d && 0 <= a_t) && ((s_memory0 == 50 && 1 <= req_a) && req_a <= 1) && (((2 <= c_write_req_ev && 3 == m_run_pc && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) - InvariantResult [Line: 1231]: 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 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1209]: 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 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: ((((((51 <= req_d && s_memory0 == 50 && ((((1 <= c_req_a && 0 <= a_t) && (((((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) && 0 <= a) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d) || (a_t == 0 && ((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && (((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)) || ((((((((a == 0 && v <= 51) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && 0 == req_a) && ((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && 0 == req_a___0)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && ((((((1 <= c_req_a && 0 < i + 1) && ((((0 <= a_t && ((((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 <= a) && 6 == m_run_pc) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && a_t == 0) || (((((((((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)) || (((((((((m_run_pc <= 0 && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((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) && 6 == m_run_pc)) || (((((((((((m_run_pc <= 0 && 0 == c_req_type) && 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) && a_t == 0) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((((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) && 0 <= a) && s_memory0 == 50) && i == req_a) && 1 <= req_a) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && 0 < i + 1) && ((6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && c_req_a <= 1) && i <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && (req_type == 0 && ((0 <= a_t && (((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) && 0 <= a) && 6 == m_run_pc) && 0 == c_req_type) && 0 < i) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && i <= 1) && 51 == rsp_d)) || (((((((((((a == 0 && 0 == c_req_type && 0 == c_req_a && 6 == m_run_pc && (0 <= a_t && ((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) && 0 <= a) && req_tt_a == 0) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && a_t == 0) && v == req_d) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0)) || ((((((((c_req_d <= 50 && 50 <= c_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) && a == 0) && a_t == 0) && i == req_a) && s_memory0 == req_d) && v == req_d) && 50 <= req_d) && req_d <= 50) && 0 == req_a)) || (6 == m_run_pc && (0 <= a_t && ((((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) && 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)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((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) && 1 <= c_m_lock) && s_run_pc == 2) && a_t == 0)) || ((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && a == 0) && v <= 51) && (req_type == 0 && ((0 <= a_t && (((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) && 0 <= a) && 6 == m_run_pc) && 0 == c_req_type) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && i <= 1)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) && 0 == req_a)) || ((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)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((s_memory0 == 50 && ((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) && 0 <= a) && 0 == req_a) || (((s_memory0 == 50 && ((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) && 0 <= a) && 1 <= req_a) && req_a <= 1))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 272 locations, 5 error locations. Result: SAFE, OverallTime: 163.9s, OverallIterations: 26, TraceHistogramMax: 8, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 129.9s, HoareTripleCheckerStatistics: 15623 SDtfs, 33394 SDslu, 48628 SDs, 0 SdLazy, 4571 SolverSat, 942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1712 GetRequests, 1385 SyntacticMatches, 9 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9409occurred 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: 6.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 65154 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1454 NumberOfFragments, 30850 HoareAnnotationTreeSize, 98 FomulaSimplifications, 508445791 FormulaSimplificationTreeSizeReduction, 34.2s HoareSimplificationTime, 98 FomulaSimplificationsInter, 52616864 FormulaSimplificationTreeSizeReductionInter, 95.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4830 NumberOfCodeBlocks, 4830 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4800 ConstructedInterpolants, 0 QuantifiedInterpolants, 4111986 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3638 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 1578/2791 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...