/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:22:46,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:22:46,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:22:46,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:22:46,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:22:47,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:22:47,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:22:47,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:22:47,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:22:47,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:22:47,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:22:47,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:22:47,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:22:47,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:22:47,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:22:47,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:22:47,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:22:47,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:22:47,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:22:47,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:22:47,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:22:47,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:22:47,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:22:47,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:22:47,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:22:47,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:22:47,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:22:47,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:22:47,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:22:47,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:22:47,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:22:47,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:22:47,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:22:47,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:22:47,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:22:47,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:22:47,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:22:47,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:22:47,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:22:47,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:22:47,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:22:47,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:22:47,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:22:47,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:22:47,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:22:47,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:22:47,159 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:22:47,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:22:47,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:22:47,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:22:47,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:22:47,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:22:47,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:22:47,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:22:47,160 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:22:47,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:22:47,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:22:47,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:22:47,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:22:47,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:22:47,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:22:47,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:22:47,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:22:47,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:22:47,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:22:47,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:22:47,171 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:22:47,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:22:47,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:22:47,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:22:47,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:22:47,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:22:47,612 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:22:47,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-01-06 19:22:47,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/acbc96c14/31efe5b007c34a09a6c36f2f69ef875f/FLAG0cc22981a [2021-01-06 19:22:48,380 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:22:48,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-01-06 19:22:48,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/acbc96c14/31efe5b007c34a09a6c36f2f69ef875f/FLAG0cc22981a [2021-01-06 19:22:48,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/acbc96c14/31efe5b007c34a09a6c36f2f69ef875f [2021-01-06 19:22:48,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:22:48,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:22:48,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:22:48,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:22:48,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:22:48,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:22:48" (1/1) ... [2021-01-06 19:22:48,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e11eeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:48, skipping insertion in model container [2021-01-06 19:22:48,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:22:48" (1/1) ... [2021-01-06 19:22:48,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:22:48,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:22:48,923 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~s_memory0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 19:22:49,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:22:49,122 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:22:49,138 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~s_memory0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 19:22:49,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:22:49,304 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:22:49,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49 WrapperNode [2021-01-06 19:22:49,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:22:49,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:22:49,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:22:49,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:22:49,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:22:49,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:22:49,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:22:49,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:22:49,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... [2021-01-06 19:22:49,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:22:49,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:22:49,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:22:49,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:22:49,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 19:22:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:22:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:22:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:22:49,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:22:50,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:22:50,811 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-01-06 19:22:50,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:22:50 BoogieIcfgContainer [2021-01-06 19:22:50,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:22:50,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:22:50,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:22:50,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:22:50,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:22:48" (1/3) ... [2021-01-06 19:22:50,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2768afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:22:50, skipping insertion in model container [2021-01-06 19:22:50,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:49" (2/3) ... [2021-01-06 19:22:50,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2768afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:22:50, skipping insertion in model container [2021-01-06 19:22:50,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:22:50" (3/3) ... [2021-01-06 19:22:50,825 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2021-01-06 19:22:50,832 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:22:50,839 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 19:22:50,859 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 19:22:50,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:22:50,891 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:22:50,891 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:22:50,891 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:22:50,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:22:50,892 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:22:50,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:22:50,892 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:22:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states. [2021-01-06 19:22:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 19:22:50,929 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:50,930 INFO L422 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] [2021-01-06 19:22:50,931 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-01-06 19:22:50,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:50,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48848897] [2021-01-06 19:22:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:51,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48848897] [2021-01-06 19:22:51,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:51,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:51,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286946898] [2021-01-06 19:22:51,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:51,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:51,264 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 3 states. [2021-01-06 19:22:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:51,699 INFO L93 Difference]: Finished difference Result 725 states and 1316 transitions. [2021-01-06 19:22:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:51,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 19:22:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:51,740 INFO L225 Difference]: With dead ends: 725 [2021-01-06 19:22:51,741 INFO L226 Difference]: Without dead ends: 448 [2021-01-06 19:22:51,746 INFO L677 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 [2021-01-06 19:22:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-01-06 19:22:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 432. [2021-01-06 19:22:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2021-01-06 19:22:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 682 transitions. [2021-01-06 19:22:51,832 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 682 transitions. Word has length 28 [2021-01-06 19:22:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:51,832 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 682 transitions. [2021-01-06 19:22:51,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 682 transitions. [2021-01-06 19:22:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 19:22:51,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:51,836 INFO L422 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] [2021-01-06 19:22:51,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:22:51,837 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2021-01-06 19:22:51,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:51,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618870207] [2021-01-06 19:22:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:51,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618870207] [2021-01-06 19:22:51,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:51,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:51,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236620530] [2021-01-06 19:22:51,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:51,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:51,959 INFO L87 Difference]: Start difference. First operand 432 states and 682 transitions. Second operand 3 states. [2021-01-06 19:22:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:52,163 INFO L93 Difference]: Finished difference Result 1135 states and 1815 transitions. [2021-01-06 19:22:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:52,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 19:22:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:52,169 INFO L225 Difference]: With dead ends: 1135 [2021-01-06 19:22:52,170 INFO L226 Difference]: Without dead ends: 717 [2021-01-06 19:22:52,173 INFO L677 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 [2021-01-06 19:22:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-01-06 19:22:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 701. [2021-01-06 19:22:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2021-01-06 19:22:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1137 transitions. [2021-01-06 19:22:52,224 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1137 transitions. Word has length 38 [2021-01-06 19:22:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:52,224 INFO L481 AbstractCegarLoop]: Abstraction has 701 states and 1137 transitions. [2021-01-06 19:22:52,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1137 transitions. [2021-01-06 19:22:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:22:52,229 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:52,229 INFO L422 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] [2021-01-06 19:22:52,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:22:52,229 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2021-01-06 19:22:52,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:52,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509669150] [2021-01-06 19:22:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:52,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509669150] [2021-01-06 19:22:52,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:52,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:52,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371329001] [2021-01-06 19:22:52,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:52,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:52,366 INFO L87 Difference]: Start difference. First operand 701 states and 1137 transitions. Second operand 3 states. [2021-01-06 19:22:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:52,470 INFO L93 Difference]: Finished difference Result 1763 states and 2860 transitions. [2021-01-06 19:22:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:52,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:22:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:52,480 INFO L225 Difference]: With dead ends: 1763 [2021-01-06 19:22:52,480 INFO L226 Difference]: Without dead ends: 1087 [2021-01-06 19:22:52,483 INFO L677 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 [2021-01-06 19:22:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-01-06 19:22:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1075. [2021-01-06 19:22:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2021-01-06 19:22:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1740 transitions. [2021-01-06 19:22:52,543 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1740 transitions. Word has length 39 [2021-01-06 19:22:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:52,544 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1740 transitions. [2021-01-06 19:22:52,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1740 transitions. [2021-01-06 19:22:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 19:22:52,546 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:52,547 INFO L422 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] [2021-01-06 19:22:52,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:22:52,547 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:52,548 INFO L82 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2021-01-06 19:22:52,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:52,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780827394] [2021-01-06 19:22:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:52,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780827394] [2021-01-06 19:22:52,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:52,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:22:52,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022367582] [2021-01-06 19:22:52,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:52,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:52,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:52,620 INFO L87 Difference]: Start difference. First operand 1075 states and 1740 transitions. Second operand 4 states. [2021-01-06 19:22:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:53,182 INFO L93 Difference]: Finished difference Result 2957 states and 4769 transitions. [2021-01-06 19:22:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:53,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2021-01-06 19:22:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:53,194 INFO L225 Difference]: With dead ends: 2957 [2021-01-06 19:22:53,194 INFO L226 Difference]: Without dead ends: 1907 [2021-01-06 19:22:53,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2021-01-06 19:22:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1677. [2021-01-06 19:22:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2021-01-06 19:22:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2680 transitions. [2021-01-06 19:22:53,273 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2680 transitions. Word has length 46 [2021-01-06 19:22:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:53,274 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 2680 transitions. [2021-01-06 19:22:53,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2680 transitions. [2021-01-06 19:22:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:22:53,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:53,276 INFO L422 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] [2021-01-06 19:22:53,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:22:53,277 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-01-06 19:22:53,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:53,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169564858] [2021-01-06 19:22:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:53,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169564858] [2021-01-06 19:22:53,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:53,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:22:53,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700071026] [2021-01-06 19:22:53,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:53,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:53,353 INFO L87 Difference]: Start difference. First operand 1677 states and 2680 transitions. Second operand 4 states. [2021-01-06 19:22:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:53,971 INFO L93 Difference]: Finished difference Result 4989 states and 7868 transitions. [2021-01-06 19:22:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:53,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 19:22:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:53,991 INFO L225 Difference]: With dead ends: 4989 [2021-01-06 19:22:53,991 INFO L226 Difference]: Without dead ends: 3331 [2021-01-06 19:22:53,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2021-01-06 19:22:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2953. [2021-01-06 19:22:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2021-01-06 19:22:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4647 transitions. [2021-01-06 19:22:54,137 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4647 transitions. Word has length 52 [2021-01-06 19:22:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:54,137 INFO L481 AbstractCegarLoop]: Abstraction has 2953 states and 4647 transitions. [2021-01-06 19:22:54,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4647 transitions. [2021-01-06 19:22:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:22:54,139 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:54,140 INFO L422 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] [2021-01-06 19:22:54,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:22:54,140 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-01-06 19:22:54,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:54,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079019939] [2021-01-06 19:22:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:54,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079019939] [2021-01-06 19:22:54,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:54,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:54,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479338758] [2021-01-06 19:22:54,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:54,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:54,202 INFO L87 Difference]: Start difference. First operand 2953 states and 4647 transitions. Second operand 3 states. [2021-01-06 19:22:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:54,402 INFO L93 Difference]: Finished difference Result 6943 states and 10882 transitions. [2021-01-06 19:22:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:54,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-06 19:22:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:54,426 INFO L225 Difference]: With dead ends: 6943 [2021-01-06 19:22:54,427 INFO L226 Difference]: Without dead ends: 4013 [2021-01-06 19:22:54,436 INFO L677 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 [2021-01-06 19:22:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2021-01-06 19:22:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3829. [2021-01-06 19:22:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3829 states. [2021-01-06 19:22:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 5949 transitions. [2021-01-06 19:22:54,638 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 5949 transitions. Word has length 52 [2021-01-06 19:22:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:54,640 INFO L481 AbstractCegarLoop]: Abstraction has 3829 states and 5949 transitions. [2021-01-06 19:22:54,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 5949 transitions. [2021-01-06 19:22:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 19:22:54,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:54,643 INFO L422 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] [2021-01-06 19:22:54,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:22:54,644 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1900061236, now seen corresponding path program 1 times [2021-01-06 19:22:54,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:54,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089684549] [2021-01-06 19:22:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:54,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089684549] [2021-01-06 19:22:54,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:54,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:54,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526352790] [2021-01-06 19:22:54,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:54,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:54,708 INFO L87 Difference]: Start difference. First operand 3829 states and 5949 transitions. Second operand 3 states. [2021-01-06 19:22:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:55,232 INFO L93 Difference]: Finished difference Result 9203 states and 14417 transitions. [2021-01-06 19:22:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:55,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-06 19:22:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:55,262 INFO L225 Difference]: With dead ends: 9203 [2021-01-06 19:22:55,263 INFO L226 Difference]: Without dead ends: 5397 [2021-01-06 19:22:55,271 INFO L677 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 [2021-01-06 19:22:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2021-01-06 19:22:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 4635. [2021-01-06 19:22:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4635 states. [2021-01-06 19:22:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 6938 transitions. [2021-01-06 19:22:55,514 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 6938 transitions. Word has length 58 [2021-01-06 19:22:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:55,514 INFO L481 AbstractCegarLoop]: Abstraction has 4635 states and 6938 transitions. [2021-01-06 19:22:55,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 6938 transitions. [2021-01-06 19:22:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 19:22:55,517 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:55,517 INFO L422 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] [2021-01-06 19:22:55,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:22:55,518 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:55,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:55,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2021-01-06 19:22:55,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:55,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508366637] [2021-01-06 19:22:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:55,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508366637] [2021-01-06 19:22:55,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:55,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:55,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684465337] [2021-01-06 19:22:55,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:55,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:55,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:55,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:55,595 INFO L87 Difference]: Start difference. First operand 4635 states and 6938 transitions. Second operand 3 states. [2021-01-06 19:22:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:55,848 INFO L93 Difference]: Finished difference Result 9113 states and 13653 transitions. [2021-01-06 19:22:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:55,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2021-01-06 19:22:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:55,872 INFO L225 Difference]: With dead ends: 9113 [2021-01-06 19:22:55,872 INFO L226 Difference]: Without dead ends: 4501 [2021-01-06 19:22:55,879 INFO L677 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 [2021-01-06 19:22:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-01-06 19:22:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4501. [2021-01-06 19:22:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2021-01-06 19:22:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6637 transitions. [2021-01-06 19:22:56,073 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6637 transitions. Word has length 60 [2021-01-06 19:22:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:56,075 INFO L481 AbstractCegarLoop]: Abstraction has 4501 states and 6637 transitions. [2021-01-06 19:22:56,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6637 transitions. [2021-01-06 19:22:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:22:56,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:56,078 INFO L422 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] [2021-01-06 19:22:56,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:22:56,078 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash -468089154, now seen corresponding path program 1 times [2021-01-06 19:22:56,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:56,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364164339] [2021-01-06 19:22:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:56,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364164339] [2021-01-06 19:22:56,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:56,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:56,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828914947] [2021-01-06 19:22:56,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:56,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:56,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:56,163 INFO L87 Difference]: Start difference. First operand 4501 states and 6637 transitions. Second operand 3 states. [2021-01-06 19:22:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:56,439 INFO L93 Difference]: Finished difference Result 9649 states and 14392 transitions. [2021-01-06 19:22:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:56,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:22:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:56,466 INFO L225 Difference]: With dead ends: 9649 [2021-01-06 19:22:56,467 INFO L226 Difference]: Without dead ends: 5171 [2021-01-06 19:22:56,474 INFO L677 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 [2021-01-06 19:22:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5171 states. [2021-01-06 19:22:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5171 to 3471. [2021-01-06 19:22:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2021-01-06 19:22:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5175 transitions. [2021-01-06 19:22:56,636 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 5175 transitions. Word has length 61 [2021-01-06 19:22:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:56,636 INFO L481 AbstractCegarLoop]: Abstraction has 3471 states and 5175 transitions. [2021-01-06 19:22:56,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 5175 transitions. [2021-01-06 19:22:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:22:56,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:56,638 INFO L422 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] [2021-01-06 19:22:56,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:22:56,639 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2021-01-06 19:22:56,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:56,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493430748] [2021-01-06 19:22:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:56,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493430748] [2021-01-06 19:22:56,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:56,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:22:56,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716273836] [2021-01-06 19:22:56,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:22:56,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:22:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:22:56,703 INFO L87 Difference]: Start difference. First operand 3471 states and 5175 transitions. Second operand 6 states. [2021-01-06 19:22:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:58,041 INFO L93 Difference]: Finished difference Result 16445 states and 24335 transitions. [2021-01-06 19:22:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:22:58,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2021-01-06 19:22:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:58,078 INFO L225 Difference]: With dead ends: 16445 [2021-01-06 19:22:58,078 INFO L226 Difference]: Without dead ends: 13193 [2021-01-06 19:22:58,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:22:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13193 states. [2021-01-06 19:22:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13193 to 4337. [2021-01-06 19:22:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4337 states. [2021-01-06 19:22:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 6433 transitions. [2021-01-06 19:22:58,433 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 6433 transitions. Word has length 63 [2021-01-06 19:22:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:58,433 INFO L481 AbstractCegarLoop]: Abstraction has 4337 states and 6433 transitions. [2021-01-06 19:22:58,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:22:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 6433 transitions. [2021-01-06 19:22:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:22:58,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:58,435 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:58,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:22:58,435 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2021-01-06 19:22:58,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:58,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384441730] [2021-01-06 19:22:58,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:58,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384441730] [2021-01-06 19:22:58,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:58,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:22:58,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021270780] [2021-01-06 19:22:58,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:22:58,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:22:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:22:58,502 INFO L87 Difference]: Start difference. First operand 4337 states and 6433 transitions. Second operand 7 states. [2021-01-06 19:23:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:00,617 INFO L93 Difference]: Finished difference Result 29901 states and 44086 transitions. [2021-01-06 19:23:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 19:23:00,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2021-01-06 19:23:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:00,688 INFO L225 Difference]: With dead ends: 29901 [2021-01-06 19:23:00,688 INFO L226 Difference]: Without dead ends: 25783 [2021-01-06 19:23:00,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-01-06 19:23:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25783 states. [2021-01-06 19:23:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25783 to 4645. [2021-01-06 19:23:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4645 states. [2021-01-06 19:23:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 6843 transitions. [2021-01-06 19:23:01,239 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 6843 transitions. Word has length 64 [2021-01-06 19:23:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:01,240 INFO L481 AbstractCegarLoop]: Abstraction has 4645 states and 6843 transitions. [2021-01-06 19:23:01,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:23:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 6843 transitions. [2021-01-06 19:23:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:23:01,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:01,242 INFO L422 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] [2021-01-06 19:23:01,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:23:01,243 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash -642302294, now seen corresponding path program 1 times [2021-01-06 19:23:01,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:01,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250623694] [2021-01-06 19:23:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:01,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250623694] [2021-01-06 19:23:01,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:01,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:01,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092230938] [2021-01-06 19:23:01,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:01,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:01,282 INFO L87 Difference]: Start difference. First operand 4645 states and 6843 transitions. Second operand 3 states. [2021-01-06 19:23:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:01,707 INFO L93 Difference]: Finished difference Result 9788 states and 14388 transitions. [2021-01-06 19:23:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:01,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:23:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:01,720 INFO L225 Difference]: With dead ends: 9788 [2021-01-06 19:23:01,720 INFO L226 Difference]: Without dead ends: 5164 [2021-01-06 19:23:01,728 INFO L677 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 [2021-01-06 19:23:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2021-01-06 19:23:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5090. [2021-01-06 19:23:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5090 states. [2021-01-06 19:23:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 7472 transitions. [2021-01-06 19:23:02,090 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 7472 transitions. Word has length 77 [2021-01-06 19:23:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:02,090 INFO L481 AbstractCegarLoop]: Abstraction has 5090 states and 7472 transitions. [2021-01-06 19:23:02,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 7472 transitions. [2021-01-06 19:23:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:23:02,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:02,093 INFO L422 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] [2021-01-06 19:23:02,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:23:02,094 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2021-01-06 19:23:02,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:02,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938887018] [2021-01-06 19:23:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:02,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938887018] [2021-01-06 19:23:02,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:02,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:23:02,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482795092] [2021-01-06 19:23:02,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:23:02,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:02,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:23:02,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:23:02,136 INFO L87 Difference]: Start difference. First operand 5090 states and 7472 transitions. Second operand 4 states. [2021-01-06 19:23:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:03,064 INFO L93 Difference]: Finished difference Result 13614 states and 19820 transitions. [2021-01-06 19:23:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:23:03,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 19:23:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:03,084 INFO L225 Difference]: With dead ends: 13614 [2021-01-06 19:23:03,085 INFO L226 Difference]: Without dead ends: 8424 [2021-01-06 19:23:03,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2021-01-06 19:23:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 7525. [2021-01-06 19:23:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2021-01-06 19:23:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 10832 transitions. [2021-01-06 19:23:03,645 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 10832 transitions. Word has length 88 [2021-01-06 19:23:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:03,645 INFO L481 AbstractCegarLoop]: Abstraction has 7525 states and 10832 transitions. [2021-01-06 19:23:03,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:23:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 10832 transitions. [2021-01-06 19:23:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:23:03,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:03,649 INFO L422 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] [2021-01-06 19:23:03,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:23:03,649 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2021-01-06 19:23:03,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:03,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673022071] [2021-01-06 19:23:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:03,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673022071] [2021-01-06 19:23:03,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:03,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:03,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942248874] [2021-01-06 19:23:03,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:03,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:03,694 INFO L87 Difference]: Start difference. First operand 7525 states and 10832 transitions. Second operand 3 states. [2021-01-06 19:23:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:03,970 INFO L93 Difference]: Finished difference Result 10856 states and 15661 transitions. [2021-01-06 19:23:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:03,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 19:23:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:03,977 INFO L225 Difference]: With dead ends: 10856 [2021-01-06 19:23:03,978 INFO L226 Difference]: Without dead ends: 3339 [2021-01-06 19:23:03,987 INFO L677 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 [2021-01-06 19:23:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-01-06 19:23:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3286. [2021-01-06 19:23:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3286 states. [2021-01-06 19:23:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4433 transitions. [2021-01-06 19:23:04,224 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4433 transitions. Word has length 95 [2021-01-06 19:23:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:04,225 INFO L481 AbstractCegarLoop]: Abstraction has 3286 states and 4433 transitions. [2021-01-06 19:23:04,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4433 transitions. [2021-01-06 19:23:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:23:04,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:04,227 INFO L422 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] [2021-01-06 19:23:04,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:23:04,227 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1416682179, now seen corresponding path program 1 times [2021-01-06 19:23:04,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:04,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355130526] [2021-01-06 19:23:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:04,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355130526] [2021-01-06 19:23:04,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:04,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:23:04,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197348971] [2021-01-06 19:23:04,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:23:04,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:23:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:04,324 INFO L87 Difference]: Start difference. First operand 3286 states and 4433 transitions. Second operand 5 states. [2021-01-06 19:23:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:05,092 INFO L93 Difference]: Finished difference Result 12537 states and 16915 transitions. [2021-01-06 19:23:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:23:05,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2021-01-06 19:23:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:05,107 INFO L225 Difference]: With dead ends: 12537 [2021-01-06 19:23:05,107 INFO L226 Difference]: Without dead ends: 9425 [2021-01-06 19:23:05,115 INFO L677 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 [2021-01-06 19:23:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9425 states. [2021-01-06 19:23:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9425 to 3288. [2021-01-06 19:23:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2021-01-06 19:23:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4429 transitions. [2021-01-06 19:23:05,393 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4429 transitions. Word has length 98 [2021-01-06 19:23:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:05,393 INFO L481 AbstractCegarLoop]: Abstraction has 3288 states and 4429 transitions. [2021-01-06 19:23:05,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:23:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4429 transitions. [2021-01-06 19:23:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:23:05,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:05,395 INFO L422 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, 1] [2021-01-06 19:23:05,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:23:05,395 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1620290344, now seen corresponding path program 1 times [2021-01-06 19:23:05,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:05,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052432464] [2021-01-06 19:23:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:05,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052432464] [2021-01-06 19:23:05,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945052716] [2021-01-06 19:23:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 19:23:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:05,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:05,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:05,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:05,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:05,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516421055] [2021-01-06 19:23:05,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:05,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:05,773 INFO L87 Difference]: Start difference. First operand 3288 states and 4429 transitions. Second operand 3 states. [2021-01-06 19:23:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:06,244 INFO L93 Difference]: Finished difference Result 3923 states and 5276 transitions. [2021-01-06 19:23:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:06,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:23:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:06,251 INFO L225 Difference]: With dead ends: 3923 [2021-01-06 19:23:06,252 INFO L226 Difference]: Without dead ends: 3919 [2021-01-06 19:23:06,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2021-01-06 19:23:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3869. [2021-01-06 19:23:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3869 states. [2021-01-06 19:23:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 5200 transitions. [2021-01-06 19:23:06,605 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 5200 transitions. Word has length 100 [2021-01-06 19:23:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:06,606 INFO L481 AbstractCegarLoop]: Abstraction has 3869 states and 5200 transitions. [2021-01-06 19:23:06,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 5200 transitions. [2021-01-06 19:23:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:23:06,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:06,610 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:06,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 19:23:06,825 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash -576078609, now seen corresponding path program 1 times [2021-01-06 19:23:06,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:06,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120249783] [2021-01-06 19:23:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:06,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120249783] [2021-01-06 19:23:06,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889043583] [2021-01-06 19:23:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 19:23:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:07,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:07,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:07,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:07,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:07,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207443782] [2021-01-06 19:23:07,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:07,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:07,406 INFO L87 Difference]: Start difference. First operand 3869 states and 5200 transitions. Second operand 3 states. [2021-01-06 19:23:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:07,622 INFO L93 Difference]: Finished difference Result 6887 states and 9305 transitions. [2021-01-06 19:23:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:07,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2021-01-06 19:23:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:07,627 INFO L225 Difference]: With dead ends: 6887 [2021-01-06 19:23:07,627 INFO L226 Difference]: Without dead ends: 3027 [2021-01-06 19:23:07,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2021-01-06 19:23:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2806. [2021-01-06 19:23:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2021-01-06 19:23:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3712 transitions. [2021-01-06 19:23:07,890 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3712 transitions. Word has length 154 [2021-01-06 19:23:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:07,891 INFO L481 AbstractCegarLoop]: Abstraction has 2806 states and 3712 transitions. [2021-01-06 19:23:07,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3712 transitions. [2021-01-06 19:23:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 19:23:07,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:07,895 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:08,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 19:23:08,109 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1529302704, now seen corresponding path program 1 times [2021-01-06 19:23:08,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:08,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263767107] [2021-01-06 19:23:08,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:08,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263767107] [2021-01-06 19:23:08,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784696005] [2021-01-06 19:23:08,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 19:23:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:08,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:08,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:23:08,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:08,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:08,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896280741] [2021-01-06 19:23:08,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:08,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:08,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:08,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:08,590 INFO L87 Difference]: Start difference. First operand 2806 states and 3712 transitions. Second operand 3 states. [2021-01-06 19:23:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:08,895 INFO L93 Difference]: Finished difference Result 5443 states and 7240 transitions. [2021-01-06 19:23:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:08,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2021-01-06 19:23:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:08,941 INFO L225 Difference]: With dead ends: 5443 [2021-01-06 19:23:08,941 INFO L226 Difference]: Without dead ends: 2806 [2021-01-06 19:23:08,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-01-06 19:23:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2806. [2021-01-06 19:23:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2021-01-06 19:23:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3616 transitions. [2021-01-06 19:23:09,185 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3616 transitions. Word has length 157 [2021-01-06 19:23:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:09,185 INFO L481 AbstractCegarLoop]: Abstraction has 2806 states and 3616 transitions. [2021-01-06 19:23:09,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3616 transitions. [2021-01-06 19:23:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 19:23:09,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:09,188 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:09,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 19:23:09,390 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1270598443, now seen corresponding path program 1 times [2021-01-06 19:23:09,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:09,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398034785] [2021-01-06 19:23:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:09,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398034785] [2021-01-06 19:23:09,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992705187] [2021-01-06 19:23:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 19:23:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:09,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:23:09,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:09,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:09,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059982092] [2021-01-06 19:23:09,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:09,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:09,811 INFO L87 Difference]: Start difference. First operand 2806 states and 3616 transitions. Second operand 3 states. [2021-01-06 19:23:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:10,518 INFO L93 Difference]: Finished difference Result 6342 states and 8333 transitions. [2021-01-06 19:23:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:10,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2021-01-06 19:23:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:10,524 INFO L225 Difference]: With dead ends: 6342 [2021-01-06 19:23:10,525 INFO L226 Difference]: Without dead ends: 3705 [2021-01-06 19:23:10,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2021-01-06 19:23:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3614. [2021-01-06 19:23:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2021-01-06 19:23:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4545 transitions. [2021-01-06 19:23:10,867 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4545 transitions. Word has length 158 [2021-01-06 19:23:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:10,868 INFO L481 AbstractCegarLoop]: Abstraction has 3614 states and 4545 transitions. [2021-01-06 19:23:10,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4545 transitions. [2021-01-06 19:23:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:23:10,871 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:10,872 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:11,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:11,086 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:11,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:11,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2021-01-06 19:23:11,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:11,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803755935] [2021-01-06 19:23:11,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:11,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803755935] [2021-01-06 19:23:11,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90975146] [2021-01-06 19:23:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:11,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:23:11,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:11,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:11,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-01-06 19:23:11,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712952218] [2021-01-06 19:23:11,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:23:11,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:23:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:23:11,741 INFO L87 Difference]: Start difference. First operand 3614 states and 4545 transitions. Second operand 9 states. [2021-01-06 19:23:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:13,991 INFO L93 Difference]: Finished difference Result 18152 states and 22925 transitions. [2021-01-06 19:23:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 19:23:13,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2021-01-06 19:23:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:14,105 INFO L225 Difference]: With dead ends: 18152 [2021-01-06 19:23:14,106 INFO L226 Difference]: Without dead ends: 14707 [2021-01-06 19:23:14,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 19:23:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14707 states. [2021-01-06 19:23:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14707 to 5121. [2021-01-06 19:23:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5121 states. [2021-01-06 19:23:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 6468 transitions. [2021-01-06 19:23:14,942 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 6468 transitions. Word has length 160 [2021-01-06 19:23:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:14,942 INFO L481 AbstractCegarLoop]: Abstraction has 5121 states and 6468 transitions. [2021-01-06 19:23:14,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:23:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 6468 transitions. [2021-01-06 19:23:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-01-06 19:23:14,947 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:14,948 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:15,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:15,163 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2021-01-06 19:23:15,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:15,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970024081] [2021-01-06 19:23:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:23:15,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970024081] [2021-01-06 19:23:15,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991202304] [2021-01-06 19:23:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:15,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 19:23:15,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:23:16,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:16,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-01-06 19:23:16,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966025442] [2021-01-06 19:23:16,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:23:16,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:23:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:23:16,075 INFO L87 Difference]: Start difference. First operand 5121 states and 6468 transitions. Second operand 11 states. [2021-01-06 19:23:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:18,914 INFO L93 Difference]: Finished difference Result 23649 states and 29779 transitions. [2021-01-06 19:23:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-01-06 19:23:18,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2021-01-06 19:23:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:18,943 INFO L225 Difference]: With dead ends: 23649 [2021-01-06 19:23:18,943 INFO L226 Difference]: Without dead ends: 18697 [2021-01-06 19:23:18,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:23:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18697 states. [2021-01-06 19:23:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18697 to 6505. [2021-01-06 19:23:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6505 states. [2021-01-06 19:23:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 8224 transitions. [2021-01-06 19:23:19,572 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 8224 transitions. Word has length 258 [2021-01-06 19:23:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:19,572 INFO L481 AbstractCegarLoop]: Abstraction has 6505 states and 8224 transitions. [2021-01-06 19:23:19,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:23:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 8224 transitions. [2021-01-06 19:23:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2021-01-06 19:23:19,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:19,579 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:19,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:19,794 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1870192825, now seen corresponding path program 1 times [2021-01-06 19:23:19,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:19,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135346868] [2021-01-06 19:23:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 263 proven. 200 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:23:20,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135346868] [2021-01-06 19:23:20,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331526311] [2021-01-06 19:23:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 19:23:20,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:23:20,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:20,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2021-01-06 19:23:20,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278335470] [2021-01-06 19:23:20,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:23:20,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:23:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:23:20,786 INFO L87 Difference]: Start difference. First operand 6505 states and 8224 transitions. Second operand 9 states. [2021-01-06 19:23:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:21,977 INFO L93 Difference]: Finished difference Result 14753 states and 18614 transitions. [2021-01-06 19:23:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:23:21,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 357 [2021-01-06 19:23:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:21,992 INFO L225 Difference]: With dead ends: 14753 [2021-01-06 19:23:21,992 INFO L226 Difference]: Without dead ends: 8414 [2021-01-06 19:23:22,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-01-06 19:23:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2021-01-06 19:23:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 6375. [2021-01-06 19:23:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2021-01-06 19:23:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 8049 transitions. [2021-01-06 19:23:22,676 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 8049 transitions. Word has length 357 [2021-01-06 19:23:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:22,676 INFO L481 AbstractCegarLoop]: Abstraction has 6375 states and 8049 transitions. [2021-01-06 19:23:22,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:23:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 8049 transitions. [2021-01-06 19:23:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-01-06 19:23:22,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:22,684 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:22,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:22,899 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1050472350, now seen corresponding path program 1 times [2021-01-06 19:23:22,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:22,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788655982] [2021-01-06 19:23:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-01-06 19:23:23,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788655982] [2021-01-06 19:23:23,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:23,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:23,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609081597] [2021-01-06 19:23:23,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:23,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:23,064 INFO L87 Difference]: Start difference. First operand 6375 states and 8049 transitions. Second operand 3 states. [2021-01-06 19:23:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:23,340 INFO L93 Difference]: Finished difference Result 7610 states and 9448 transitions. [2021-01-06 19:23:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:23,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2021-01-06 19:23:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:23,343 INFO L225 Difference]: With dead ends: 7610 [2021-01-06 19:23:23,343 INFO L226 Difference]: Without dead ends: 1290 [2021-01-06 19:23:23,347 INFO L677 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 [2021-01-06 19:23:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-01-06 19:23:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1287. [2021-01-06 19:23:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2021-01-06 19:23:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1403 transitions. [2021-01-06 19:23:23,502 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1403 transitions. Word has length 358 [2021-01-06 19:23:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:23,503 INFO L481 AbstractCegarLoop]: Abstraction has 1287 states and 1403 transitions. [2021-01-06 19:23:23,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1403 transitions. [2021-01-06 19:23:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-01-06 19:23:23,506 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:23,507 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:23,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:23:23,507 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2021-01-06 19:23:23,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:23,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161283521] [2021-01-06 19:23:23,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-01-06 19:23:23,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161283521] [2021-01-06 19:23:23,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:23,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:23:23,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219748597] [2021-01-06 19:23:23,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:23:23,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:23:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:23:23,781 INFO L87 Difference]: Start difference. First operand 1287 states and 1403 transitions. Second operand 7 states. [2021-01-06 19:23:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:24,234 INFO L93 Difference]: Finished difference Result 2642 states and 2890 transitions. [2021-01-06 19:23:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:23:24,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2021-01-06 19:23:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:24,237 INFO L225 Difference]: With dead ends: 2642 [2021-01-06 19:23:24,237 INFO L226 Difference]: Without dead ends: 2144 [2021-01-06 19:23:24,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:23:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2021-01-06 19:23:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1283. [2021-01-06 19:23:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2021-01-06 19:23:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1393 transitions. [2021-01-06 19:23:24,356 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1393 transitions. Word has length 359 [2021-01-06 19:23:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:24,356 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1393 transitions. [2021-01-06 19:23:24,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:23:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1393 transitions. [2021-01-06 19:23:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-01-06 19:23:24,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:24,361 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:24,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:23:24,361 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2021-01-06 19:23:24,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:24,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418613785] [2021-01-06 19:23:24,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-01-06 19:23:24,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418613785] [2021-01-06 19:23:24,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:24,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:23:24,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028375861] [2021-01-06 19:23:24,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:23:24,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:23:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:24,547 INFO L87 Difference]: Start difference. First operand 1283 states and 1393 transitions. Second operand 5 states. [2021-01-06 19:23:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:24,844 INFO L93 Difference]: Finished difference Result 2112 states and 2304 transitions. [2021-01-06 19:23:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:23:24,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2021-01-06 19:23:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:24,847 INFO L225 Difference]: With dead ends: 2112 [2021-01-06 19:23:24,848 INFO L226 Difference]: Without dead ends: 1612 [2021-01-06 19:23:24,849 INFO L677 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 [2021-01-06 19:23:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2021-01-06 19:23:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1251. [2021-01-06 19:23:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2021-01-06 19:23:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1332 transitions. [2021-01-06 19:23:24,968 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1332 transitions. Word has length 360 [2021-01-06 19:23:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:24,969 INFO L481 AbstractCegarLoop]: Abstraction has 1251 states and 1332 transitions. [2021-01-06 19:23:24,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:23:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1332 transitions. [2021-01-06 19:23:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-01-06 19:23:24,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:24,973 INFO L422 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:24,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:23:24,973 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2021-01-06 19:23:24,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:24,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149303707] [2021-01-06 19:23:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2021-01-06 19:23:25,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149303707] [2021-01-06 19:23:25,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:25,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:25,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285753318] [2021-01-06 19:23:25,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:25,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:25,204 INFO L87 Difference]: Start difference. First operand 1251 states and 1332 transitions. Second operand 3 states. [2021-01-06 19:23:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:25,313 INFO L93 Difference]: Finished difference Result 2069 states and 2203 transitions. [2021-01-06 19:23:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:25,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2021-01-06 19:23:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:25,315 INFO L225 Difference]: With dead ends: 2069 [2021-01-06 19:23:25,315 INFO L226 Difference]: Without dead ends: 1076 [2021-01-06 19:23:25,316 INFO L677 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 [2021-01-06 19:23:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2021-01-06 19:23:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 860. [2021-01-06 19:23:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2021-01-06 19:23:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 915 transitions. [2021-01-06 19:23:25,400 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 915 transitions. Word has length 417 [2021-01-06 19:23:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:25,400 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 915 transitions. [2021-01-06 19:23:25,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 915 transitions. [2021-01-06 19:23:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-01-06 19:23:25,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:25,403 INFO L422 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:25,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:23:25,404 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2021-01-06 19:23:25,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:25,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643219723] [2021-01-06 19:23:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 64 proven. 223 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-01-06 19:23:26,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643219723] [2021-01-06 19:23:26,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591675810] [2021-01-06 19:23:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:26,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 19:23:26,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-01-06 19:23:27,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:27,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2021-01-06 19:23:27,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244322032] [2021-01-06 19:23:27,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 19:23:27,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 19:23:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-01-06 19:23:27,222 INFO L87 Difference]: Start difference. First operand 860 states and 915 transitions. Second operand 21 states. [2021-01-06 19:23:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:28,272 INFO L93 Difference]: Finished difference Result 1024 states and 1095 transitions. [2021-01-06 19:23:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 19:23:28,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 417 [2021-01-06 19:23:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:28,273 INFO L225 Difference]: With dead ends: 1024 [2021-01-06 19:23:28,274 INFO L226 Difference]: Without dead ends: 1022 [2021-01-06 19:23:28,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=1513, Unknown=0, NotChecked=0, Total=1806 [2021-01-06 19:23:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-01-06 19:23:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 860. [2021-01-06 19:23:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2021-01-06 19:23:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 914 transitions. [2021-01-06 19:23:28,400 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 914 transitions. Word has length 417 [2021-01-06 19:23:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:28,401 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 914 transitions. [2021-01-06 19:23:28,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 19:23:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 914 transitions. [2021-01-06 19:23:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2021-01-06 19:23:28,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:28,405 INFO L422 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:28,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 19:23:28,621 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2021-01-06 19:23:28,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:28,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046211966] [2021-01-06 19:23:28,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-01-06 19:23:28,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046211966] [2021-01-06 19:23:28,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084287820] [2021-01-06 19:23:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:29,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:23:29,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-01-06 19:23:29,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:29,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-01-06 19:23:29,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704870730] [2021-01-06 19:23:29,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:23:29,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:23:29,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:23:29,829 INFO L87 Difference]: Start difference. First operand 860 states and 914 transitions. Second operand 9 states. [2021-01-06 19:23:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:30,290 INFO L93 Difference]: Finished difference Result 1238 states and 1314 transitions. [2021-01-06 19:23:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:23:30,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 464 [2021-01-06 19:23:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:30,292 INFO L225 Difference]: With dead ends: 1238 [2021-01-06 19:23:30,293 INFO L226 Difference]: Without dead ends: 1046 [2021-01-06 19:23:30,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:23:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-01-06 19:23:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 859. [2021-01-06 19:23:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2021-01-06 19:23:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 910 transitions. [2021-01-06 19:23:30,390 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 910 transitions. Word has length 464 [2021-01-06 19:23:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:30,391 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 910 transitions. [2021-01-06 19:23:30,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:23:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 910 transitions. [2021-01-06 19:23:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2021-01-06 19:23:30,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:30,395 INFO L422 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:30,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-06 19:23:30,609 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2021-01-06 19:23:30,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:30,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316978547] [2021-01-06 19:23:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 121 proven. 561 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 19:23:31,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316978547] [2021-01-06 19:23:31,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502441444] [2021-01-06 19:23:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:31,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 45 conjunts are in the unsatisfiable core [2021-01-06 19:23:31,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-01-06 19:23:33,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:33,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2021-01-06 19:23:33,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132891360] [2021-01-06 19:23:33,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-06 19:23:33,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-06 19:23:33,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2021-01-06 19:23:33,193 INFO L87 Difference]: Start difference. First operand 859 states and 910 transitions. Second operand 32 states. [2021-01-06 19:23:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:34,816 INFO L93 Difference]: Finished difference Result 986 states and 1048 transitions. [2021-01-06 19:23:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-06 19:23:34,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 523 [2021-01-06 19:23:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:34,818 INFO L225 Difference]: With dead ends: 986 [2021-01-06 19:23:34,818 INFO L226 Difference]: Without dead ends: 984 [2021-01-06 19:23:34,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 525 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=428, Invalid=3232, Unknown=0, NotChecked=0, Total=3660 [2021-01-06 19:23:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2021-01-06 19:23:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 859. [2021-01-06 19:23:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2021-01-06 19:23:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 909 transitions. [2021-01-06 19:23:34,915 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 909 transitions. Word has length 523 [2021-01-06 19:23:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:34,915 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 909 transitions. [2021-01-06 19:23:34,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-06 19:23:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 909 transitions. [2021-01-06 19:23:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2021-01-06 19:23:34,918 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:34,919 INFO L422 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:35,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-06 19:23:35,127 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2021-01-06 19:23:35,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:35,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407261278] [2021-01-06 19:23:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-01-06 19:23:35,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407261278] [2021-01-06 19:23:35,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964798854] [2021-01-06 19:23:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:36,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 19:23:36,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-01-06 19:23:36,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:36,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-01-06 19:23:36,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82899946] [2021-01-06 19:23:36,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:23:36,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:23:36,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:23:36,911 INFO L87 Difference]: Start difference. First operand 859 states and 909 transitions. Second operand 11 states. [2021-01-06 19:23:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:37,519 INFO L93 Difference]: Finished difference Result 1052 states and 1117 transitions. [2021-01-06 19:23:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:23:37,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 570 [2021-01-06 19:23:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:37,521 INFO L225 Difference]: With dead ends: 1052 [2021-01-06 19:23:37,521 INFO L226 Difference]: Without dead ends: 987 [2021-01-06 19:23:37,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 580 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:23:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-01-06 19:23:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 857. [2021-01-06 19:23:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2021-01-06 19:23:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 905 transitions. [2021-01-06 19:23:37,619 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 905 transitions. Word has length 570 [2021-01-06 19:23:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:37,619 INFO L481 AbstractCegarLoop]: Abstraction has 857 states and 905 transitions. [2021-01-06 19:23:37,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:23:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 905 transitions. [2021-01-06 19:23:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2021-01-06 19:23:37,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:37,623 INFO L422 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:37,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:37,830 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2021-01-06 19:23:37,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:37,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374938082] [2021-01-06 19:23:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 80 proven. 1006 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:23:39,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374938082] [2021-01-06 19:23:39,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757482589] [2021-01-06 19:23:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:39,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 57 conjunts are in the unsatisfiable core [2021-01-06 19:23:39,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:23:41,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:41,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 38 [2021-01-06 19:23:41,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690319654] [2021-01-06 19:23:41,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-06 19:23:41,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-06 19:23:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2021-01-06 19:23:41,134 INFO L87 Difference]: Start difference. First operand 857 states and 905 transitions. Second operand 38 states. [2021-01-06 19:23:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:43,517 INFO L93 Difference]: Finished difference Result 987 states and 1047 transitions. [2021-01-06 19:23:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-01-06 19:23:43,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 630 [2021-01-06 19:23:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:43,519 INFO L225 Difference]: With dead ends: 987 [2021-01-06 19:23:43,519 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 19:23:43,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=590, Invalid=5416, Unknown=0, NotChecked=0, Total=6006 [2021-01-06 19:23:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 19:23:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 19:23:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 19:23:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 19:23:43,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 630 [2021-01-06 19:23:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:43,522 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 19:23:43,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-06 19:23:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 19:23:43,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 19:23:43,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:43,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 19:23:44,240 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 174 [2021-01-06 19:23:45,382 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 411 DAG size of output: 330 [2021-01-06 19:23:46,732 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 531 DAG size of output: 396 [2021-01-06 19:23:46,854 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 165 [2021-01-06 19:23:46,969 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 166 [2021-01-06 19:23:48,035 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 529 DAG size of output: 417 [2021-01-06 19:23:48,743 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 236 [2021-01-06 19:23:49,727 WARN L197 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 531 DAG size of output: 396 [2021-01-06 19:23:50,074 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 194 [2021-01-06 19:23:50,503 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 306 [2021-01-06 19:23:50,903 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 349 [2021-01-06 19:23:53,826 WARN L197 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 1109 DAG size of output: 870 [2021-01-06 19:23:54,137 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 194 [2021-01-06 19:23:54,654 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 270 [2021-01-06 19:23:55,063 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 194 [2021-01-06 19:23:55,352 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 214 [2021-01-06 19:23:55,675 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 236 [2021-01-06 19:23:56,109 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 349 [2021-01-06 19:23:56,423 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 295 [2021-01-06 19:23:56,812 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 349 [2021-01-06 19:23:57,157 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 318 [2021-01-06 19:23:57,382 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 169 [2021-01-06 19:23:58,321 WARN L197 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 334 [2021-01-06 19:23:58,467 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 182 [2021-01-06 19:23:58,944 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 236 [2021-01-06 19:23:59,397 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 236 [2021-01-06 19:23:59,841 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 349 [2021-01-06 19:23:59,973 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 199 [2021-01-06 19:24:00,083 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 174 [2021-01-06 19:24:00,471 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 357 [2021-01-06 19:24:00,872 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 349 [2021-01-06 19:24:01,018 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 182 [2021-01-06 19:24:01,392 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 249 [2021-01-06 19:24:01,570 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2021-01-06 19:24:01,731 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 196 [2021-01-06 19:24:02,056 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 236 [2021-01-06 19:24:02,666 WARN L197 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 428 DAG size of output: 268 [2021-01-06 19:24:02,803 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 201 [2021-01-06 19:24:03,144 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 236 [2021-01-06 19:24:03,550 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 210 [2021-01-06 19:24:03,696 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 174 [2021-01-06 19:24:06,502 WARN L197 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 1117 DAG size of output: 872 [2021-01-06 19:24:06,863 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 19:24:07,228 WARN L197 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 19:24:07,798 WARN L197 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-06 19:24:08,831 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 170 DAG size of output: 101 [2021-01-06 19:24:12,668 WARN L197 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 318 DAG size of output: 136 [2021-01-06 19:24:13,031 WARN L197 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2021-01-06 19:24:13,630 WARN L197 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-06 19:24:14,226 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-06 19:24:17,515 WARN L197 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 381 DAG size of output: 144 [2021-01-06 19:24:18,354 WARN L197 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 102 [2021-01-06 19:24:18,481 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:24:19,311 WARN L197 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 103 [2021-01-06 19:24:19,592 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 19:24:23,543 WARN L197 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 401 DAG size of output: 140 [2021-01-06 19:24:23,662 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-01-06 19:24:24,312 WARN L197 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2021-01-06 19:24:24,438 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:24:25,398 WARN L197 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2021-01-06 19:24:25,677 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 19:24:26,750 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 147 DAG size of output: 91 [2021-01-06 19:24:28,118 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 191 DAG size of output: 94 [2021-01-06 19:24:29,787 WARN L197 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2021-01-06 19:24:33,193 WARN L197 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 381 DAG size of output: 144 [2021-01-06 19:24:33,527 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2021-01-06 19:24:34,782 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 186 DAG size of output: 101 [2021-01-06 19:24:35,071 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 19:24:35,200 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:24:35,488 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 19:24:38,142 WARN L197 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 299 DAG size of output: 109 [2021-01-06 19:24:38,270 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:24:38,399 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:24:40,693 WARN L197 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 324 DAG size of output: 131 [2021-01-06 19:24:52,777 WARN L197 SmtUtils]: Spent 12.08 s on a formula simplification. DAG size of input: 824 DAG size of output: 197 [2021-01-06 19:24:54,056 WARN L197 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 186 DAG size of output: 101 [2021-01-06 19:24:56,104 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 258 DAG size of output: 136 [2021-01-06 19:24:57,308 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2021-01-06 19:24:58,592 WARN L197 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 186 DAG size of output: 101 [2021-01-06 19:24:59,807 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 168 DAG size of output: 104 [2021-01-06 19:25:01,075 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 207 DAG size of output: 92 [2021-01-06 19:25:02,766 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2021-01-06 19:25:03,443 WARN L197 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 100 [2021-01-06 19:25:04,413 WARN L197 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2021-01-06 19:25:06,786 WARN L197 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 324 DAG size of output: 131 [2021-01-06 19:25:08,670 WARN L197 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 266 DAG size of output: 106 [2021-01-06 19:25:09,624 WARN L197 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2021-01-06 19:25:11,989 WARN L197 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 324 DAG size of output: 131 [2021-01-06 19:25:12,609 WARN L197 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2021-01-06 19:25:14,564 WARN L197 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 292 DAG size of output: 106 [2021-01-06 19:25:15,783 WARN L197 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2021-01-06 19:25:16,678 WARN L197 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 100 [2021-01-06 19:25:17,020 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 65 [2021-01-06 19:25:18,165 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2021-01-06 19:25:21,570 WARN L197 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 318 DAG size of output: 144 [2021-01-06 19:25:21,951 WARN L197 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 19:25:23,392 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 181 DAG size of output: 103 [2021-01-06 19:25:24,126 WARN L197 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2021-01-06 19:25:25,274 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2021-01-06 19:25:26,987 WARN L197 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2021-01-06 19:25:28,161 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2021-01-06 19:25:28,904 WARN L197 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 95 [2021-01-06 19:25:30,639 WARN L197 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2021-01-06 19:25:31,276 WARN L197 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-06 19:25:32,242 WARN L197 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2021-01-06 19:25:34,600 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 324 DAG size of output: 131 [2021-01-06 19:25:35,608 WARN L197 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 190 DAG size of output: 107 [2021-01-06 19:25:36,730 WARN L197 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 170 DAG size of output: 101 [2021-01-06 19:25:39,243 WARN L197 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 332 DAG size of output: 131 [2021-01-06 19:25:40,204 WARN L197 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2021-01-06 19:25:42,571 WARN L197 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 324 DAG size of output: 131 [2021-01-06 19:25:42,944 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 19:25:44,371 WARN L197 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 181 DAG size of output: 103 [2021-01-06 19:25:46,259 WARN L197 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 235 DAG size of output: 80 [2021-01-06 19:25:46,586 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2021-01-06 19:25:47,162 WARN L197 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 24 [2021-01-06 19:25:47,538 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 19:25:49,021 WARN L197 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 195 DAG size of output: 102 [2021-01-06 19:25:50,730 WARN L197 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2021-01-06 19:25:51,361 WARN L197 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-06 19:25:53,542 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 258 DAG size of output: 60 [2021-01-06 19:25:55,521 WARN L197 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 190 DAG size of output: 105 [2021-01-06 19:25:57,222 WARN L197 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2021-01-06 19:25:57,853 WARN L197 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-06 19:25:58,818 WARN L197 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2021-01-06 19:25:59,773 WARN L197 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2021-01-06 19:26:00,070 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 19:26:01,364 WARN L197 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 202 DAG size of output: 86 [2021-01-06 19:26:01,497 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:26:01,798 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-06 19:26:02,896 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 170 DAG size of output: 101 [2021-01-06 19:26:15,262 WARN L197 SmtUtils]: Spent 12.36 s on a formula simplification. DAG size of input: 829 DAG size of output: 197 [2021-01-06 19:26:15,642 WARN L197 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-01-06 19:26:15,648 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,649 INFO L189 CegarLoopUtils]: For program point L498(lines 497 525) no Hoare annotation was computed. [2021-01-06 19:26:15,649 INFO L189 CegarLoopUtils]: For program point L366(lines 136 482) no Hoare annotation was computed. [2021-01-06 19:26:15,649 INFO L189 CegarLoopUtils]: For program point L1225(lines 1225 1229) no Hoare annotation was computed. [2021-01-06 19:26:15,649 INFO L189 CegarLoopUtils]: For program point L499(lines 499 503) no Hoare annotation was computed. [2021-01-06 19:26:15,649 INFO L189 CegarLoopUtils]: For program point L433(lines 433 437) no Hoare annotation was computed. [2021-01-06 19:26:15,650 INFO L189 CegarLoopUtils]: For program point L367(lines 367 371) no Hoare annotation was computed. [2021-01-06 19:26:15,651 INFO L185 CegarLoopUtils]: At program point L1028(lines 1002 1029) the Hoare annotation is: (let ((.cse3 (<= 2 ~a_t~0)) (.cse16 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse18 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse19 (= ~m_run_pc~0 3)) (.cse24 (<= 50 ~c_req_d~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse23 (= ~a_t~0 0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse25 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse17 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse5 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 2 ULTIMATE.start_s_run_~req_a~1) .cse16 .cse17) (and .cse18 .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse1 .cse3 .cse19 .cse14 .cse6 .cse15 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse18 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~a_t~0) .cse2 .cse1 .cse19 (<= 51 ~c_req_d~0) .cse14 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse15 .cse8 .cse9 (<= ~a_t~0 1) .cse17 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse18 .cse20 .cse21 .cse22 (not (= ~s_run_st~0 0)) .cse1 (= ~c_req_type~0 1) .cse19 (= ULTIMATE.start_s_run_~req_type~1 1) .cse23 (= ~s_run_pc~0 0) .cse6 .cse24 .cse8 .cse25 .cse9 .cse17 .cse26) (and .cse18 .cse20 .cse21 .cse22 .cse2 .cse1 .cse19 .cse23 .cse14 .cse6 .cse24 .cse8 .cse25 .cse9 .cse17 .cse26) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) (= ~a_t~0 1) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 (= ~req_tt_a~0 1)) (and .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 .cse25 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse17))) [2021-01-06 19:26:15,651 INFO L189 CegarLoopUtils]: For program point L566(lines 566 619) no Hoare annotation was computed. [2021-01-06 19:26:15,651 INFO L189 CegarLoopUtils]: For program point L104(lines 104 132) no Hoare annotation was computed. [2021-01-06 19:26:15,651 INFO L189 CegarLoopUtils]: For program point L831(lines 831 837) no Hoare annotation was computed. [2021-01-06 19:26:15,652 INFO L185 CegarLoopUtils]: At program point L831-1(lines 831 837) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (let ((.cse0 (= ~s_memory1~0 51)) (.cse5 (= ~c_req_type~0 0)) (.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= .cse15 ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ~s_memory0~0 50)) (.cse10 (= ~m_run_pc~0 6)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse7 (<= 2 ~c_m_ev~0)) (.cse19 (<= 2 ~a_t~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse4 (<= 6 ~m_run_pc~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse15 ~c_rsp_d~0) .cse16 .cse17 .cse18 (= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse17 .cse1 .cse7 .cse3 .cse2 .cse19 (= ~m_run_pc~0 3) .cse9 .cse20 .cse14) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse8 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 .cse16 .cse17 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse18 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)) (and .cse10 .cse17 .cse6 .cse1 .cse7 .cse19 .cse2 .cse3 .cse9 .cse20 .cse14 .cse4)))) [2021-01-06 19:26:15,652 INFO L185 CegarLoopUtils]: At program point L765(lines 758 811) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,653 INFO L185 CegarLoopUtils]: At program point L699(lines 692 727) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16) (let ((.cse17 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse17 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse17 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16)))) [2021-01-06 19:26:15,653 INFO L189 CegarLoopUtils]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-01-06 19:26:15,654 INFO L185 CegarLoopUtils]: At program point L1096(lines 1089 1106) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse15 (= ~m_run_st~0 0))) (let ((.cse3 (= ~a_t~0 0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse20 (<= 2 ~a_t~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~s_memory2~0 52)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse21 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse18 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (let ((.cse26 (= ~m_run_pc~0 3))) (or (and .cse6 .cse15 .cse2 .cse26) (and (= ~s_run_pc~0 0) .cse6 .cse15 (not (= ~s_run_st~0 0)) .cse26)))) (.cse23 (<= 1 ~a_t~0)) (.cse1 (= ~c_write_rsp_ev~0 1)) (.cse24 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse25 (<= ~a_t~0 1)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse14 .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse17) (and .cse18 .cse19 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse9 .cse10 .cse17 (<= ~c_req_d~0 50)) (and .cse18 .cse0 .cse19 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse20 .cse16 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse7 .cse10 .cse21 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse8 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse14 .cse24 .cse15 (= 51 ~c_rsp_d~0) .cse16 .cse25 .cse17 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse20 .cse2 .cse4 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse5 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse10 .cse11 .cse12 .cse13 (<= ~c_req_a~0 2) .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~i 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 2 ULTIMATE.start_s_run_~req_a~1) .cse21 .cse17) (and .cse18 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse19 .cse23 .cse1 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse24 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse16 .cse7 .cse10 .cse25 .cse17 (<= ~c_req_d~0 51) .cse22)))) [2021-01-06 19:26:15,654 INFO L185 CegarLoopUtils]: At program point L1163(lines 1115 1168) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 (<= 2 ~a_t~0) .cse8 .cse4 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,654 INFO L189 CegarLoopUtils]: For program point L1097(lines 1089 1106) no Hoare annotation was computed. [2021-01-06 19:26:15,654 INFO L189 CegarLoopUtils]: For program point L767(lines 767 771) no Hoare annotation was computed. [2021-01-06 19:26:15,654 INFO L189 CegarLoopUtils]: For program point L701(lines 701 705) no Hoare annotation was computed. [2021-01-06 19:26:15,655 INFO L185 CegarLoopUtils]: At program point L1296(lines 1289 1315) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 (<= 2 ~a_t~0) .cse8 .cse4 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,655 INFO L185 CegarLoopUtils]: At program point L239(lines 232 267) the Hoare annotation is: (let ((.cse13 (= ~m_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= ~c_req_d~0 .cse21)) (.cse5 (= ~a_t~0 0)) (.cse6 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse15 (<= .cse21 ~c_req_d~0)) (.cse19 (= 2 ~s_run_pc~0)) (.cse7 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (or (and .cse8 .cse13) (and .cse8 (= ~m_run_pc~0 3)))) (.cse1 (= ~c_req_type~0 1)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 0)) (.cse17 (not (= ~s_run_st~0 0))) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (not (= ULTIMATE.start_m_run_~req_type~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse17 .cse18 (<= 1 ~c_req_a~0) .cse0 .cse19 .cse1 (<= 51 ~c_req_d~0) .cse5 .cse20 .cse7 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse17 .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse11 .cse10 .cse12 .cse14 .cse15) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~c_req_a~0) .cse17 .cse0 .cse19 .cse7 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse11 .cse16 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) .cse18 (<= ~c_req_a~0 2) .cse1 .cse20 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 52 ~c_req_d~0)) (and .cse9 .cse8 .cse17 (not (= ~c_req_type~0 0)) .cse0 .cse12 .cse13 .cse3 .cse4 .cse20)))) [2021-01-06 19:26:15,655 INFO L189 CegarLoopUtils]: For program point L107(lines 107 131) no Hoare annotation was computed. [2021-01-06 19:26:15,655 INFO L189 CegarLoopUtils]: For program point L1098(lines 1098 1102) no Hoare annotation was computed. [2021-01-06 19:26:15,655 INFO L185 CegarLoopUtils]: At program point L108(lines 103 845) the Hoare annotation is: false [2021-01-06 19:26:15,656 INFO L185 CegarLoopUtils]: At program point L439(lines 432 458) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,656 INFO L189 CegarLoopUtils]: For program point L1298(lines 1298 1302) no Hoare annotation was computed. [2021-01-06 19:26:15,656 INFO L189 CegarLoopUtils]: For program point L241(lines 241 245) no Hoare annotation was computed. [2021-01-06 19:26:15,656 INFO L189 CegarLoopUtils]: For program point L968(lines 968 972) no Hoare annotation was computed. [2021-01-06 19:26:15,656 INFO L185 CegarLoopUtils]: At program point L176(lines 146 177) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse22 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= ~m_run_pc~0 3)) (.cse12 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse15 (<= .cse22 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse17 (= ~c_req_type~0 0)) (.cse18 (<= ULTIMATE.start_m_run_~req_d~0 .cse22)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse16 (= ~s_run_pc~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse19 (not .cse2)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse21 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (not (= ULTIMATE.start_m_run_~req_type~0 0)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) .cse8 .cse9 (<= 51 ~c_req_d~0) .cse10 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse7 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse8 .cse9 .cse11 .cse3 .cse10 .cse4 (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse5 .cse6 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse9 .cse12 .cse11 .cse13 .cse14 .cse15 .cse3 .cse16 .cse10 .cse17 .cse4 .cse18 .cse5 .cse19 .cse20 .cse6 .cse21) (and .cse0 .cse2 .cse1 .cse9 .cse12 .cse13 .cse11 .cse15 .cse3 .cse10 .cse17 .cse4 .cse18 .cse5 .cse20 .cse6 .cse21) (and .cse16 .cse10 .cse4 .cse0 .cse19 .cse20 .cse1 .cse21 .cse9 .cse13 .cse14)))) [2021-01-06 19:26:15,656 INFO L189 CegarLoopUtils]: For program point L110(lines 110 130) no Hoare annotation was computed. [2021-01-06 19:26:15,656 INFO L189 CegarLoopUtils]: For program point L1035(lines 1035 1088) no Hoare annotation was computed. [2021-01-06 19:26:15,657 INFO L185 CegarLoopUtils]: At program point L573(lines 566 619) the Hoare annotation is: (let ((.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= ~s_memory1~0 51)) (.cse9 (= ~s_memory2~0 52)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_req_type~0 0)) (.cse13 (= ~s_memory0~0 50)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 .cse9 (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~a~0 2) .cse13 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse14) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse9 .cse1 (<= 2 ~a_t~0) .cse3 .cse2 (= ~m_run_pc~0 3) (= ~c_req_a~0 0) .cse10 .cse12 .cse4 .cse13 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse14))) [2021-01-06 19:26:15,657 INFO L189 CegarLoopUtils]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-01-06 19:26:15,657 INFO L185 CegarLoopUtils]: At program point L111(lines 103 845) the Hoare annotation is: false [2021-01-06 19:26:15,657 INFO L189 CegarLoopUtils]: For program point L1036(lines 1036 1040) no Hoare annotation was computed. [2021-01-06 19:26:15,657 INFO L185 CegarLoopUtils]: At program point L640-2(lines 640 668) the Hoare annotation is: (let ((.cse26 (= ~a_t~0 0)) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse39 (<= 0 ~a_t~0)) (.cse38 (= ~c_req_a~0 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse36 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse37 (= ULTIMATE.start_m_run_~a~0 0)) (.cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ULTIMATE.start_s_memory_read_~i 1)) (.cse25 (<= 1 ~c_req_a~0)) (.cse23 (<= ~c_req_a~0 1)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (<= 1 ~a_t~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= ~a_t~0 1)) (.cse28 (= ~req_tt_a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse2 (<= 2 ~c_req_a~0)) (.cse4 (= ~req_tt_a~0 2)) (.cse6 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse33 (not (= ~s_run_st~0 0))) (.cse12 (= 2 ~s_run_pc~0)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse34 (<= 2 ~a_t~0)) (.cse35 (<= 6 ~m_run_pc~0)) (.cse15 (= ~c_req_type~0 0)) (.cse32 (= ~c_empty_req~0 1)) (.cse17 (<= 2 ~c_m_ev~0)) (.cse18 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory2~0 52)) (.cse10 (<= ~c_req_a~0 2)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse16 (= ~s_memory0~0 50)) (.cse20 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~a_t~0 1) .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 2) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse7 (let ((.cse27 (or (and .cse14 .cse29 .cse17 .cse11 .cse12 .cse19 .cse21 .cse26) (and .cse14 .cse29 .cse9 .cse17 .cse11 .cse12 .cse19 .cse30 .cse21)))) (or (and .cse0 .cse1 .cse22 .cse15 .cse23 .cse16 .cse24 .cse25 .cse26 .cse27 .cse13) (and .cse0 .cse1 .cse22 .cse15 .cse23 .cse16 .cse24 .cse25 .cse28 .cse27 .cse13))) .cse18 .cse31) (and .cse1 .cse14 .cse32 .cse33 .cse17 .cse34 .cse12 .cse11 .cse19 .cse20) (and .cse0 .cse33 (= ~req_tt_a~0 0) .cse12 .cse11 .cse26 .cse35 .cse15 .cse32 .cse24 .cse36 .cse17 .cse18 .cse37 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse3 .cse7 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse38 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse13 .cse16 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse21) (and .cse14 (<= 0 ULTIMATE.start_m_run_~a~0) .cse39 .cse33 .cse17 .cse11 .cse12 .cse19 .cse21) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse0 .cse39 .cse7 .cse11 .cse12 .cse38 .cse14 .cse15 .cse16 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse36 .cse17 .cse37 .cse19 .cse21) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse5 .cse8 .cse33 .cse25 .cse12 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse35 .cse15 .cse23 .cse32 .cse18 .cse17 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse19 .cse31 .cse1 .cse3 .cse7 .cse9 .cse13 .cse29 .cse16 (= 51 ~c_rsp_d~0) .cse30 .cse21 .cse28) (and .cse0 .cse2 .cse4 .cse6 .cse33 .cse12 .cse11 .cse34 .cse35 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse15 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse32 (= 52 ~c_rsp_d~0) .cse17 .cse18 .cse19 .cse1 .cse3 .cse7 .cse10 .cse13 .cse16 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse20 .cse21))) [2021-01-06 19:26:15,658 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,658 INFO L185 CegarLoopUtils]: At program point L773(lines 766 810) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,658 INFO L185 CegarLoopUtils]: At program point L707(lines 700 726) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16) (let ((.cse17 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse17 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse17 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16)))) [2021-01-06 19:26:15,658 INFO L189 CegarLoopUtils]: For program point L641(lines 640 668) no Hoare annotation was computed. [2021-01-06 19:26:15,658 INFO L189 CegarLoopUtils]: For program point L575(lines 575 579) no Hoare annotation was computed. [2021-01-06 19:26:15,659 INFO L189 CegarLoopUtils]: For program point L113(lines 113 129) no Hoare annotation was computed. [2021-01-06 19:26:15,659 INFO L185 CegarLoopUtils]: At program point L906(lines 880 907) the Hoare annotation is: (let ((.cse8 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_d~0 50)) (.cse14 (<= 1 ~a_t~0)) (.cse15 (<= 1 ~c_req_a~0)) (.cse16 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (<= ~c_req_a~0 1)) (.cse19 (<= ~a_t~0 1)) (.cse20 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse24 (<= 2 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 2)) (.cse3 (= ~c_req_type~0 1)) (.cse27 (<= 2 ~a_t~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse31 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse25 (= ~s_memory2~0 52)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~a_t~0 0)) (.cse28 (<= 6 ~m_run_pc~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse29 (= ~c_req_type~0 0)) (.cse18 (= ~s_memory0~0 50)) (.cse30 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse14 .cse15 .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse7 .cse16 .cse17 .cse18 .cse9 .cse11 .cse19 .cse12 (<= ~c_req_d~0 51) .cse20) (and .cse21 .cse22 .cse23 .cse24 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse26 .cse1 .cse2 .cse27 .cse28 .cse7 .cse29 .cse18 .cse9 .cse30 .cse11 .cse31 .cse12) (and .cse21 .cse22 .cse23 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse25 .cse0 .cse14 .cse15 .cse1 .cse2 .cse28 .cse7 .cse29 .cse16 .cse17 .cse18 .cse30 .cse9 .cse11 .cse19 .cse12 (= ~req_tt_a~0 1) .cse20) (and .cse21 .cse24 .cse0 .cse26 .cse1 .cse2 .cse3 .cse27 .cse4 .cse7 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse18 (<= ~c_req_d~0 52) .cse9 .cse11 .cse31 .cse12 (<= 52 ~c_req_d~0)) (and .cse21 .cse22 .cse23 .cse25 .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse5 .cse6 .cse28 .cse7 .cse29 .cse18 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse30 .cse9 .cse10 .cse11 .cse12))) [2021-01-06 19:26:15,659 INFO L189 CegarLoopUtils]: For program point L642(lines 642 646) no Hoare annotation was computed. [2021-01-06 19:26:15,660 INFO L185 CegarLoopUtils]: At program point L114(lines 103 845) the Hoare annotation is: (let ((.cse18 (= 2 ~s_run_pc~0))) (let ((.cse5 (= ~a_t~0 0)) (.cse8 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_d~0 50)) (.cse26 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (<= 1 ~a_t~0)) (.cse19 (<= 51 ~c_req_d~0)) (.cse24 (<= ~a_t~0 1)) (.cse25 (<= ~c_req_d~0 51)) (.cse6 (= ~s_run_pc~0 0)) (.cse9 (not .cse18)) (.cse4 (= ~c_req_a~0 0)) (.cse21 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (not (= ~c_req_type~0 0))) (.cse2 (= ~c_req_type~0 1)) (.cse29 (<= 2 ~a_t~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse22 (= ~s_memory0~0 50)) (.cse23 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (<= ~c_req_d~0 52)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse31 (<= 52 ~c_req_d~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse16 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse1 .cse18 .cse3 .cse19 .cse20 .cse21 .cse22 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25) (and .cse14 .cse26 .cse27 .cse28 .cse16 .cse1 .cse18 .cse3 .cse5 .cse21 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse18 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse26 .cse27 .cse28 .cse17 .cse0 (<= 1 ~c_req_a~0) .cse18 .cse2 .cse1 .cse3 .cse19 .cse7 (<= ~c_req_a~0 1) .cse10 .cse11 .cse24 .cse12 .cse25) (and .cse7 .cse21 .cse1 .cse18 .cse3) (and .cse6 .cse7 .cse16 .cse0 .cse9 .cse1 .cse3 .cse4) (and (= ~s_memory1~0 51) .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse16 .cse29 .cse1 .cse18 .cse3 .cse21 .cse22 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse30 .cse10 .cse11 .cse12 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse31) (and .cse14 .cse15 (<= 2 ~c_req_a~0) .cse0 (<= ~c_req_a~0 2) .cse18 .cse2 .cse1 .cse29 .cse3 .cse7 .cse20 .cse22 .cse23 .cse30 .cse10 .cse11 .cse12 .cse31) (and .cse7 .cse16 .cse1 .cse18 .cse3 .cse11)))) [2021-01-06 19:26:15,660 INFO L185 CegarLoopUtils]: At program point L180-2(lines 180 208) the Hoare annotation is: (let ((.cse20 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse6 (= ~s_run_pc~0 0)) (.cse1 (= ~c_req_a~0 0)) (.cse3 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse4 (<= .cse20 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_req_type~0 0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse20)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 0)) (.cse18 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~m_run_pc~0 3)) (.cse2 (= ~a_t~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse6 .cse7 .cse9 .cse16 .cse0 .cse12 .cse14 .cse3 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse16 .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse10 .cse12 .cse13 .cse14 .cse15) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 .cse17 .cse0 .cse5 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse11 .cse13 .cse18 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) .cse19 (<= 51 ~c_req_d~0) .cse7 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse15 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse18 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 .cse17 .cse0 .cse19 .cse2 .cse5 .cse7 .cse9 (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse11 .cse13 .cse15 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0))))) [2021-01-06 19:26:15,660 INFO L189 CegarLoopUtils]: For program point L775(lines 775 779) no Hoare annotation was computed. [2021-01-06 19:26:15,660 INFO L189 CegarLoopUtils]: For program point L709(lines 709 713) no Hoare annotation was computed. [2021-01-06 19:26:15,661 INFO L185 CegarLoopUtils]: At program point L1304(lines 1297 1314) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 (<= 2 ~a_t~0) .cse8 .cse4 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,661 INFO L185 CegarLoopUtils]: At program point L247(lines 240 266) the Hoare annotation is: (let ((.cse13 (= ~m_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= ~c_req_d~0 .cse21)) (.cse5 (= ~a_t~0 0)) (.cse6 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse15 (<= .cse21 ~c_req_d~0)) (.cse19 (= 2 ~s_run_pc~0)) (.cse7 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (or (and .cse8 .cse13) (and .cse8 (= ~m_run_pc~0 3)))) (.cse1 (= ~c_req_type~0 1)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 0)) (.cse17 (not (= ~s_run_st~0 0))) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (not (= ULTIMATE.start_m_run_~req_type~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse17 .cse18 (<= 1 ~c_req_a~0) .cse0 .cse19 .cse1 (<= 51 ~c_req_d~0) .cse5 .cse20 .cse7 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse17 .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse11 .cse10 .cse12 .cse14 .cse15) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~c_req_a~0) .cse17 .cse0 .cse19 .cse7 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse11 .cse16 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) .cse18 (<= ~c_req_a~0 2) .cse1 .cse20 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 52 ~c_req_d~0)) (and .cse9 .cse8 .cse17 (not (= ~c_req_type~0 0)) .cse0 .cse12 .cse13 .cse3 .cse4 .cse20)))) [2021-01-06 19:26:15,661 INFO L189 CegarLoopUtils]: For program point L181(lines 180 208) no Hoare annotation was computed. [2021-01-06 19:26:15,662 INFO L185 CegarLoopUtils]: At program point L974(lines 967 984) the Hoare annotation is: (let ((.cse32 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse35 (<= 2 ~c_req_a~0)) (.cse36 (<= 2 ~a_t~0)) (.cse24 (<= 6 ~m_run_pc~0)) (.cse37 (<= ~c_req_a~0 2)) (.cse38 (= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse39 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse23 (<= 1 ~c_req_a~0)) (.cse26 (<= ~c_req_a~0 1)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse3 (not .cse25)) (.cse9 (not .cse32)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse21 (= ~s_memory1~0 51)) (.cse29 (= ~m_run_pc~0 6)) (.cse30 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (= ~s_memory2~0 52)) (.cse4 (= 2 ~s_run_pc~0)) (.cse34 (= ~s_memory0~0 50)) (.cse27 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse22 .cse2 .cse23 (= ~a_t~0 1) .cse4 .cse6 .cse24 .cse25 .cse13 .cse26 .cse27 .cse16 .cse18 .cse28 .cse29 .cse30 .cse31 .cse32 .cse12 .cse33 .cse34 .cse19 (= ~req_tt_a~0 1)) (and .cse21 .cse35 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse4 .cse6 .cse36 .cse7 .cse13 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse16 .cse18 .cse37 .cse3 .cse5 .cse8 .cse9 .cse12 .cse34 .cse38 .cse39 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse21 .cse35 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse4 .cse6 .cse36 .cse24 .cse25 .cse13 .cse27 .cse16 .cse18 .cse29 .cse30 .cse31 .cse37 .cse32 .cse12 .cse34 .cse38 .cse39 .cse19) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse2 .cse23 .cse4 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse26 .cse13 .cse16 .cse18 .cse28 (<= ULTIMATE.start_s_memory_write_~v 50) (<= 1 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse33 .cse34 (<= ~a_t~0 1) .cse19 (<= ~c_req_d~0 51)) (and .cse21 .cse29 .cse30 .cse31 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse10 .cse11 .cse32 .cse12 .cse25 .cse13 .cse34 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 19:26:15,662 INFO L189 CegarLoopUtils]: For program point L1305(lines 1257 1346) no Hoare annotation was computed. [2021-01-06 19:26:15,662 INFO L189 CegarLoopUtils]: For program point L1239(lines 1239 1243) no Hoare annotation was computed. [2021-01-06 19:26:15,662 INFO L189 CegarLoopUtils]: For program point L182(lines 182 186) no Hoare annotation was computed. [2021-01-06 19:26:15,662 INFO L189 CegarLoopUtils]: For program point L116(lines 116 128) no Hoare annotation was computed. [2021-01-06 19:26:15,662 INFO L189 CegarLoopUtils]: For program point L975(lines 967 984) no Hoare annotation was computed. [2021-01-06 19:26:15,663 INFO L185 CegarLoopUtils]: At program point L447(lines 440 457) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,663 INFO L189 CegarLoopUtils]: For program point L381(lines 381 385) no Hoare annotation was computed. [2021-01-06 19:26:15,663 INFO L189 CegarLoopUtils]: For program point L1306(lines 1306 1310) no Hoare annotation was computed. [2021-01-06 19:26:15,663 INFO L189 CegarLoopUtils]: For program point L249(lines 249 253) no Hoare annotation was computed. [2021-01-06 19:26:15,663 INFO L189 CegarLoopUtils]: For program point L1174(lines 1174 1178) no Hoare annotation was computed. [2021-01-06 19:26:15,663 INFO L185 CegarLoopUtils]: At program point L117(lines 103 845) the Hoare annotation is: false [2021-01-06 19:26:15,663 INFO L189 CegarLoopUtils]: For program point L1174-2(lines 1172 1351) no Hoare annotation was computed. [2021-01-06 19:26:15,664 INFO L185 CegarLoopUtils]: At program point L1042(lines 1035 1088) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse5 (= ~m_run_pc~0 3)) (.cse15 (= ~a_t~0 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= ~c_req_d~0 50)) (.cse4 (<= 2 ~a_t~0)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse1 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse29 (<= 6 ~m_run_pc~0)) (.cse23 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse24 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse21 (= ~s_memory2~0 52)) (.cse25 (<= 1 ~a_t~0)) (.cse22 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse26 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse27 (<= ~a_t~0 1)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 .cse12 .cse13 .cse14 .cse2 .cse3 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse11 .cse18) (and .cse1 .cse19 .cse20 .cse21 .cse2 (= ~req_tt_a~0 0) .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse15 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse22 .cse23 .cse6 .cse7 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse24 .cse17 .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 .cse2 .cse3 .cse5 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 .cse27 .cse11 (<= ~c_req_d~0 51) .cse28) (and .cse0 .cse12 .cse13 .cse14 (not (= ~s_run_st~0 0)) .cse2 (= ~c_req_type~0 1) .cse5 (= ULTIMATE.start_s_run_~req_type~1 1) .cse15 (= ~s_run_pc~0 0) .cse6 .cse16 .cse8 .cse17 .cse9 .cse11 .cse18) (and .cse1 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 .cse3 .cse4 .cse29 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse23 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse24 .cse9 .cse19 .cse20 .cse21 (<= ~c_req_a~0 2) .cse22 .cse7 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11) (and .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse29 .cse23 (<= ~c_req_a~0 1) .cse6 .cse24 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse28 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26 (= 51 ~c_rsp_d~0) .cse7 .cse27 .cse11 (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,664 INFO L189 CegarLoopUtils]: For program point L976(lines 976 980) no Hoare annotation was computed. [2021-01-06 19:26:15,664 INFO L189 CegarLoopUtils]: For program point L448(lines 136 482) no Hoare annotation was computed. [2021-01-06 19:26:15,665 INFO L185 CegarLoopUtils]: At program point L581(lines 574 618) the Hoare annotation is: (let ((.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= ~s_memory1~0 51)) (.cse9 (= ~s_memory2~0 52)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_req_type~0 0)) (.cse13 (= ~s_memory0~0 50)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 .cse9 (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~a~0 2) .cse13 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse14) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse9 .cse1 (<= 2 ~a_t~0) .cse3 .cse2 (= ~m_run_pc~0 3) (= ~c_req_a~0 0) .cse10 .cse12 .cse4 .cse13 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse14))) [2021-01-06 19:26:15,665 INFO L189 CegarLoopUtils]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-01-06 19:26:15,665 INFO L189 CegarLoopUtils]: For program point L119(lines 119 127) no Hoare annotation was computed. [2021-01-06 19:26:15,665 INFO L189 CegarLoopUtils]: For program point L1044(lines 1044 1048) no Hoare annotation was computed. [2021-01-06 19:26:15,665 INFO L185 CegarLoopUtils]: At program point L120(lines 103 845) the Hoare annotation is: false [2021-01-06 19:26:15,665 INFO L189 CegarLoopUtils]: For program point L913(lines 913 966) no Hoare annotation was computed. [2021-01-06 19:26:15,666 INFO L185 CegarLoopUtils]: At program point L781(lines 774 809) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,666 INFO L185 CegarLoopUtils]: At program point L715(lines 708 725) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16) (let ((.cse17 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse17 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse17 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16)))) [2021-01-06 19:26:15,666 INFO L189 CegarLoopUtils]: For program point L583(lines 583 587) no Hoare annotation was computed. [2021-01-06 19:26:15,666 INFO L192 CegarLoopUtils]: At program point L1376(lines 1353 1378) the Hoare annotation is: true [2021-01-06 19:26:15,667 INFO L185 CegarLoopUtils]: At program point L319(lines 289 320) the Hoare annotation is: (let ((.cse6 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse5 .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 (<= ~a_t~0 1) .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse7 .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,667 INFO L189 CegarLoopUtils]: For program point L914(lines 914 918) no Hoare annotation was computed. [2021-01-06 19:26:15,667 INFO L189 CegarLoopUtils]: For program point L716(lines 487 839) no Hoare annotation was computed. [2021-01-06 19:26:15,667 INFO L185 CegarLoopUtils]: At program point L1245(lines 1238 1255) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2021-01-06 19:26:15,667 INFO L189 CegarLoopUtils]: For program point L1179-1(lines 1172 1351) no Hoare annotation was computed. [2021-01-06 19:26:15,667 INFO L189 CegarLoopUtils]: For program point L122(lines 122 126) no Hoare annotation was computed. [2021-01-06 19:26:15,668 INFO L189 CegarLoopUtils]: For program point L783(lines 783 787) no Hoare annotation was computed. [2021-01-06 19:26:15,668 INFO L189 CegarLoopUtils]: For program point L717(lines 717 721) no Hoare annotation was computed. [2021-01-06 19:26:15,668 INFO L185 CegarLoopUtils]: At program point L387(lines 380 397) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,669 INFO L185 CegarLoopUtils]: At program point L255(lines 248 265) the Hoare annotation is: (let ((.cse13 (= ~m_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= ~c_req_d~0 .cse21)) (.cse5 (= ~a_t~0 0)) (.cse6 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse15 (<= .cse21 ~c_req_d~0)) (.cse19 (= 2 ~s_run_pc~0)) (.cse7 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (or (and .cse8 .cse13) (and .cse8 (= ~m_run_pc~0 3)))) (.cse1 (= ~c_req_type~0 1)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 0)) (.cse17 (not (= ~s_run_st~0 0))) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (not (= ULTIMATE.start_m_run_~req_type~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse17 .cse18 (<= 1 ~c_req_a~0) .cse0 .cse19 .cse1 (<= 51 ~c_req_d~0) .cse5 .cse20 .cse7 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse17 .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse11 .cse10 .cse12 .cse14 .cse15) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~c_req_a~0) .cse17 .cse0 .cse19 .cse7 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse11 .cse16 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) .cse18 (<= ~c_req_a~0 2) .cse1 .cse20 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 52 ~c_req_d~0)) (and .cse9 .cse8 .cse17 (not (= ~c_req_type~0 0)) .cse0 .cse12 .cse13 .cse3 .cse4 .cse20)))) [2021-01-06 19:26:15,669 INFO L185 CegarLoopUtils]: At program point L123(lines 103 845) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_req_a~0)) (.cse2 (= ~req_tt_a~0 2)) (.cse16 (<= ~c_req_a~0 2)) (.cse20 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse21 (= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~a_t~0)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse23 (<= 1 ~c_req_a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (<= ~c_req_a~0 1)) (.cse29 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse25 (= ~req_tt_a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse15 (= ~s_memory2~0 52)) (.cse26 (= ~req_tt_a~0 0)) (.cse27 (= ~c_req_a~0 0)) (.cse28 (= ~a_t~0 0)) (.cse7 (<= 6 ~m_run_pc~0)) (.cse8 (= ~c_req_type~0 0)) (.cse18 (= ~s_memory0~0 50)) (.cse13 (= ~m_run_pc~0 6)) (.cse22 (= ~c_empty_rsp~0 1)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (<= 2 ~c_m_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 52 ~c_rsp_d~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse19) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse20 .cse15 .cse21 .cse16 .cse6 .cse4 .cse5 .cse7 .cse17 .cse22 .cse8 .cse18 .cse10 .cse11 .cse12 .cse19) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse3 .cse23 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 .cse14 .cse15 (<= 1 ~a_t~0) .cse17 .cse18 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse19 .cse25) (and .cse0 .cse13 .cse14 .cse15 .cse3 .cse26 .cse4 .cse5 .cse27 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse28 .cse7 .cse17 .cse8 .cse9 (= ~c_rsp_d~0 50) .cse18 .cse29 .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse19 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse22 .cse9 .cse3 .cse10 .cse6 .cse4 .cse5 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse23 (= ~a_t~0 1) .cse4 .cse5 .cse17 .cse7 .cse22 .cse8 .cse24 .cse18 .cse29 .cse11 .cse10 .cse12 .cse19 .cse25) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse13 .cse15 .cse26 .cse4 .cse5 .cse27 .cse28 .cse7 .cse22 .cse8 .cse18 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse12 .cse19) (and .cse13 .cse22 (<= 0 ~a_t~0) .cse3 .cse10 .cse4 .cse5 .cse12 .cse19))) [2021-01-06 19:26:15,669 INFO L189 CegarLoopUtils]: For program point L388(lines 380 397) no Hoare annotation was computed. [2021-01-06 19:26:15,669 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 19:26:15,669 INFO L189 CegarLoopUtils]: For program point L256(lines 136 482) no Hoare annotation was computed. [2021-01-06 19:26:15,670 INFO L189 CegarLoopUtils]: For program point L1247(lines 1247 1251) no Hoare annotation was computed. [2021-01-06 19:26:15,670 INFO L189 CegarLoopUtils]: For program point L389(lines 389 393) no Hoare annotation was computed. [2021-01-06 19:26:15,670 INFO L189 CegarLoopUtils]: For program point L257(lines 257 261) no Hoare annotation was computed. [2021-01-06 19:26:15,670 INFO L185 CegarLoopUtils]: At program point L1050(lines 1043 1087) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse5 (= ~m_run_pc~0 3)) (.cse15 (= ~a_t~0 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= ~c_req_d~0 50)) (.cse4 (<= 2 ~a_t~0)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse1 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse29 (<= 6 ~m_run_pc~0)) (.cse23 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse24 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse21 (= ~s_memory2~0 52)) (.cse25 (<= 1 ~a_t~0)) (.cse22 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse26 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse27 (<= ~a_t~0 1)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 .cse12 .cse13 .cse14 .cse2 .cse3 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse11 .cse18) (and .cse1 .cse19 .cse20 .cse21 .cse2 (= ~req_tt_a~0 0) .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse15 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse22 .cse23 .cse6 .cse7 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse24 .cse17 .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse25 .cse2 .cse3 .cse5 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 .cse27 .cse11 (<= ~c_req_d~0 51) .cse28) (and .cse0 .cse12 .cse13 .cse14 (not (= ~s_run_st~0 0)) .cse2 (= ~c_req_type~0 1) .cse5 (= ULTIMATE.start_s_run_~req_type~1 1) .cse15 (= ~s_run_pc~0 0) .cse6 .cse16 .cse8 .cse17 .cse9 .cse11 .cse18) (and .cse1 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 .cse3 .cse4 .cse29 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse23 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse24 .cse9 .cse19 .cse20 .cse21 (<= ~c_req_a~0 2) .cse22 .cse7 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11) (and .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse29 .cse23 (<= ~c_req_a~0 1) .cse6 .cse24 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse28 .cse19 .cse20 .cse21 .cse25 .cse22 .cse26 (= 51 ~c_rsp_d~0) .cse7 .cse27 .cse11 (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,670 INFO L189 CegarLoopUtils]: For program point L60(lines 60 67) no Hoare annotation was computed. [2021-01-06 19:26:15,671 INFO L185 CegarLoopUtils]: At program point L589(lines 582 617) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_req_type~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~s_memory2~0 52)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) .cse1 .cse2 (or (and .cse3 (= ~m_run_pc~0 0)) (and .cse3 (= ~m_run_pc~0 3))) .cse4 .cse5 (= ~c_req_a~0 0) .cse6 .cse7 .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse9 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 .cse1 (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse6 .cse14 .cse3 (<= ULTIMATE.start_m_run_~a~0 2) .cse8 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse2 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse4 .cse5 (= ~a_t~0 0) .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse9 .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ULTIMATE.start_m_run_~a~0) .cse12 .cse13 .cse1 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse6 .cse14 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10))) [2021-01-06 19:26:15,671 INFO L189 CegarLoopUtils]: For program point L1052(lines 1052 1056) no Hoare annotation was computed. [2021-01-06 19:26:15,672 INFO L185 CegarLoopUtils]: At program point L920(lines 913 966) the Hoare annotation is: (let ((.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= ~c_req_type~0 0))) (let ((.cse3 (not .cse35)) (.cse9 (not .cse34)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse29 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_a~0 1)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (<= 2 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse23 (<= 2 ~a_t~0)) (.cse37 (<= 6 ~m_run_pc~0)) (.cse36 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~m_run_pc~0 6)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= ~s_memory2~0 52)) (.cse24 (<= ~c_req_a~0 2)) (.cse25 (= ~s_memory0~0 50)) (.cse26 (= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse4 .cse6 .cse23 .cse7 .cse13 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse16 .cse18 .cse24 .cse3 .cse5 .cse8 .cse9 .cse12 .cse25 .cse26 .cse27 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse28 .cse2 .cse29 .cse4 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 1 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse25 (<= ~a_t~0 1) .cse19 (<= ~c_req_d~0 51)) (and .cse21 .cse31 .cse32 .cse33 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse36 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse31 .cse32 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse28 .cse33 .cse2 .cse29 .cse4 .cse6 (= ~a_t~0 1) .cse37 .cse34 .cse12 .cse35 .cse30 .cse13 .cse25 (= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse36 .cse18 .cse19 (= ~req_tt_a~0 1)) (and .cse21 .cse22 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse6 .cse23 .cse37 .cse35 .cse13 .cse16 .cse36 .cse18 .cse31 .cse32 .cse33 .cse24 .cse34 .cse12 .cse25 .cse26 .cse27 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 19:26:15,672 INFO L189 CegarLoopUtils]: For program point L326(lines 326 379) no Hoare annotation was computed. [2021-01-06 19:26:15,672 INFO L189 CegarLoopUtils]: For program point L1185(lines 1185 1189) no Hoare annotation was computed. [2021-01-06 19:26:15,672 INFO L189 CegarLoopUtils]: For program point L62(lines 62 67) no Hoare annotation was computed. [2021-01-06 19:26:15,672 INFO L189 CegarLoopUtils]: For program point L987(lines 987 1001) no Hoare annotation was computed. [2021-01-06 19:26:15,673 INFO L185 CegarLoopUtils]: At program point L789(lines 782 808) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,673 INFO L189 CegarLoopUtils]: For program point L591(lines 591 595) no Hoare annotation was computed. [2021-01-06 19:26:15,673 INFO L189 CegarLoopUtils]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-01-06 19:26:15,673 INFO L189 CegarLoopUtils]: For program point L922(lines 922 926) no Hoare annotation was computed. [2021-01-06 19:26:15,673 INFO L185 CegarLoopUtils]: At program point L526(lines 496 527) the Hoare annotation is: (let ((.cse4 (= ~c_req_type~0 0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= ~s_memory1~0 51)) (.cse11 (= ~s_memory2~0 52)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) (= ~a_t~0 0) .cse4 (= ~c_rsp_d~0 50) .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse9 .cse10 .cse11 .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse13 .cse14 .cse15 (<= ULTIMATE.start_m_run_~a~0 1) .cse16 (= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= ~c_req_a~0 1) .cse5 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse6 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_m_run_~a~0 2) .cse16 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 .cse1 (<= 2 ~a_t~0) .cse2 .cse3 (= ~m_run_pc~0 3) .cse12 .cse13 .cse15 .cse5 .cse16 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,673 INFO L189 CegarLoopUtils]: For program point L64(lines 64 67) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L189 CegarLoopUtils]: For program point L791(lines 791 795) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L189 CegarLoopUtils]: For program point L1320(lines 1320 1324) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L189 CegarLoopUtils]: For program point L1122(lines 1121 1162) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L189 CegarLoopUtils]: For program point L463(lines 463 467) no Hoare annotation was computed. [2021-01-06 19:26:15,674 INFO L185 CegarLoopUtils]: At program point L133(lines 103 845) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse2 (= ~c_req_type~0 0)) (.cse4 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse12 (not (= ~s_run_st~0 0))) (.cse5 (not .cse13)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse12 .cse5 .cse6 .cse8 .cse9)))) [2021-01-06 19:26:15,675 INFO L185 CegarLoopUtils]: At program point L1058(lines 1051 1086) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse5 (= 2 ~s_run_pc~0)) (.cse14 (<= 6 ~m_run_pc~0)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 (<= 2 ~a_t~0) .cse14 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= 52 ~c_rsp_d~0) .cse10 .cse11 .cse12 .cse1 .cse2 .cse3 (<= ~c_req_a~0 2) .cse6 .cse9 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse14 .cse7 (<= ~c_req_a~0 1) .cse8 .cse11 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse2 .cse3 (<= 1 ~a_t~0) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (= 51 ~c_rsp_d~0) .cse9 (<= ~a_t~0 1) .cse13 (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,675 INFO L185 CegarLoopUtils]: At program point L530-2(lines 530 558) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse12 (<= 6 ~m_run_pc~0)) (.cse13 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse14 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~s_memory2~0 52)) (.cse5 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 (<= 2 ~a_t~0) .cse3 .cse4 (= ~m_run_pc~0 3) .cse5 .cse6 .cse7 .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse11 (<= 52 ~c_req_d~0)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse7 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse9 .cse14 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse15 .cse16 .cse1 (<= 1 ~a_t~0) .cse5 .cse17 .cse6 (<= ULTIMATE.start_m_run_~a~0 2) .cse8 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse11 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= ~a_t~0 0) .cse12 .cse13 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse9 .cse14 .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse15 .cse16 .cse1 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse5 .cse17 .cse6 .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11))) [2021-01-06 19:26:15,675 INFO L185 CegarLoopUtils]: At program point L1191(lines 1184 1237) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2021-01-06 19:26:15,676 INFO L189 CegarLoopUtils]: For program point L993(lines 993 1000) no Hoare annotation was computed. [2021-01-06 19:26:15,676 INFO L185 CegarLoopUtils]: At program point L597(lines 590 616) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_req_type~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~s_memory2~0 52)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) .cse1 .cse2 (or (and .cse3 (= ~m_run_pc~0 0)) (and .cse3 (= ~m_run_pc~0 3))) .cse4 .cse5 (= ~c_req_a~0 0) .cse6 .cse7 .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse9 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 .cse1 (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse6 .cse14 .cse3 (<= ULTIMATE.start_m_run_~a~0 2) .cse8 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse2 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse4 .cse5 (= ~a_t~0 0) .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse9 .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ULTIMATE.start_m_run_~a~0) .cse12 .cse13 .cse1 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse6 .cse14 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10))) [2021-01-06 19:26:15,676 INFO L189 CegarLoopUtils]: For program point L531(lines 530 558) no Hoare annotation was computed. [2021-01-06 19:26:15,676 INFO L189 CegarLoopUtils]: For program point L399(lines 399 405) no Hoare annotation was computed. [2021-01-06 19:26:15,677 INFO L185 CegarLoopUtils]: At program point L399-1(lines 399 405) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2021-01-06 19:26:15,677 INFO L185 CegarLoopUtils]: At program point L333(lines 326 379) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,677 INFO L189 CegarLoopUtils]: For program point L1258(line 1258) no Hoare annotation was computed. [2021-01-06 19:26:15,677 INFO L189 CegarLoopUtils]: For program point L1126(lines 1126 1130) no Hoare annotation was computed. [2021-01-06 19:26:15,677 INFO L189 CegarLoopUtils]: For program point L1126-1(lines 1121 1162) no Hoare annotation was computed. [2021-01-06 19:26:15,678 INFO L185 CegarLoopUtils]: At program point L69(lines 56 70) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (<= 6 ~m_run_pc~0)) (.cse4 (= ~c_req_type~0 0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~s_memory0~0 50)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 (<= 2 ~a_t~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse15) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse4 (<= ~c_req_a~0 1) .cse5 .cse6 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 (<= ULTIMATE.start_m_run_~a~0 1) .cse14 (<= ~a_t~0 1) .cse15 (= ~req_tt_a~0 1)) (and .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 (= ULTIMATE.start_s_memory_read_~i 0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= ~c_req_a~0 0) .cse12 .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse15))) [2021-01-06 19:26:15,678 INFO L189 CegarLoopUtils]: For program point L1060(lines 1060 1064) no Hoare annotation was computed. [2021-01-06 19:26:15,679 INFO L185 CegarLoopUtils]: At program point L928(lines 921 965) the Hoare annotation is: (let ((.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= ~c_req_type~0 0))) (let ((.cse3 (not .cse35)) (.cse9 (not .cse34)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse29 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_a~0 1)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (<= 2 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse23 (<= 2 ~a_t~0)) (.cse37 (<= 6 ~m_run_pc~0)) (.cse36 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~m_run_pc~0 6)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= ~s_memory2~0 52)) (.cse24 (<= ~c_req_a~0 2)) (.cse25 (= ~s_memory0~0 50)) (.cse26 (= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse4 .cse6 .cse23 .cse7 .cse13 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse16 .cse18 .cse24 .cse3 .cse5 .cse8 .cse9 .cse12 .cse25 .cse26 .cse27 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse28 .cse2 .cse29 .cse4 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 1 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse25 (<= ~a_t~0 1) .cse19 (<= ~c_req_d~0 51)) (and .cse21 .cse31 .cse32 .cse33 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse36 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse31 .cse32 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse28 .cse33 .cse2 .cse29 .cse4 .cse6 (= ~a_t~0 1) .cse37 .cse34 .cse12 .cse35 .cse30 .cse13 .cse25 (= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse36 .cse18 .cse19 (= ~req_tt_a~0 1)) (and .cse21 .cse22 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse6 .cse23 .cse37 .cse35 .cse13 .cse16 .cse36 .cse18 .cse31 .cse32 .cse33 .cse24 .cse34 .cse12 .cse25 .cse26 .cse27 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 19:26:15,679 INFO L189 CegarLoopUtils]: For program point L532(lines 532 536) no Hoare annotation was computed. [2021-01-06 19:26:15,679 INFO L189 CegarLoopUtils]: For program point L1193(lines 1193 1197) no Hoare annotation was computed. [2021-01-06 19:26:15,679 INFO L185 CegarLoopUtils]: At program point L136-2(lines 136 482) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0))) (let ((.cse4 (= ~c_req_a~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse17 (= ~s_memory0~0 50)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse16 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse13 (= ~s_run_pc~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_empty_req~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse14 (not .cse2)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse3 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12) (and .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse16 .cse3 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 (<= ULTIMATE.start_m_run_~a~0 2) .cse17 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse11 (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and (= ~s_memory1~0 51) .cse15 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (<= 2 ~a_t~0) .cse16 (<= 3 ULTIMATE.start_m_run_~a~0) .cse3 .cse6 .cse8 .cse17 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse9 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse6 .cse8 (<= ULTIMATE.start_m_run_~a~0 1) (<= 50 ~c_req_d~0) .cse9 .cse11 (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse6 .cse8 .cse0 .cse14 .cse1 .cse10 .cse12 .cse3)))) [2021-01-06 19:26:15,679 INFO L189 CegarLoopUtils]: For program point L863(lines 863 875) no Hoare annotation was computed. [2021-01-06 19:26:15,680 INFO L185 CegarLoopUtils]: At program point L797(lines 790 807) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,680 INFO L189 CegarLoopUtils]: For program point L731(lines 731 735) no Hoare annotation was computed. [2021-01-06 19:26:15,680 INFO L189 CegarLoopUtils]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-01-06 19:26:15,680 INFO L189 CegarLoopUtils]: For program point L335(lines 335 339) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L185 CegarLoopUtils]: At program point L1326(lines 1319 1336) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 .cse8 .cse4 (<= 2 ~a_t~0) .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,681 INFO L189 CegarLoopUtils]: For program point L137(lines 136 482) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L189 CegarLoopUtils]: For program point L930(lines 930 934) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L189 CegarLoopUtils]: For program point L798(lines 487 839) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L189 CegarLoopUtils]: For program point L1327(lines 1257 1346) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L189 CegarLoopUtils]: For program point L138(lines 138 142) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L189 CegarLoopUtils]: For program point L799(lines 799 803) no Hoare annotation was computed. [2021-01-06 19:26:15,681 INFO L185 CegarLoopUtils]: At program point L469(lines 462 479) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,682 INFO L189 CegarLoopUtils]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2021-01-06 19:26:15,682 INFO L189 CegarLoopUtils]: For program point L271(lines 271 275) no Hoare annotation was computed. [2021-01-06 19:26:15,682 INFO L189 CegarLoopUtils]: For program point L866(lines 866 874) no Hoare annotation was computed. [2021-01-06 19:26:15,682 INFO L189 CegarLoopUtils]: For program point L470(lines 462 479) no Hoare annotation was computed. [2021-01-06 19:26:15,682 INFO L189 CegarLoopUtils]: For program point L74(lines 74 81) no Hoare annotation was computed. [2021-01-06 19:26:15,682 INFO L185 CegarLoopUtils]: At program point L867(lines 862 1113) the Hoare annotation is: false [2021-01-06 19:26:15,682 INFO L185 CegarLoopUtils]: At program point L669(lines 639 670) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~s_memory0~0 50)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse2 .cse3 (= ~a_t~0 1) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= 51 ~c_rsp_d~0) .cse15 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse15) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse15))) [2021-01-06 19:26:15,683 INFO L189 CegarLoopUtils]: For program point L471(lines 471 475) no Hoare annotation was computed. [2021-01-06 19:26:15,683 INFO L185 CegarLoopUtils]: At program point L1132(lines 1121 1162) the Hoare annotation is: (let ((.cse11 (= ~c_req_type~0 0))) (let ((.cse29 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse32 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse34 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (= ~c_req_type~0 1)) (.cse31 (<= 51 ~c_req_d~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse36 (<= ~c_req_d~0 51)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse23 (= ~m_run_pc~0 0)) (.cse20 (not (= ~c_m_lock~0 1))) (.cse26 (= ~s_run_pc~0 0)) (.cse40 (not .cse11)) (.cse12 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse42 (<= ~c_req_d~0 52)) (.cse44 (<= 52 ~c_req_d~0)) (.cse1 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse50 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse51 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse52 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse27 (<= 50 ~c_req_d~0)) (.cse28 (<= ~c_req_d~0 50)) (.cse38 (<= 2 ~c_req_a~0)) (.cse45 (= ~req_tt_a~0 2)) (.cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse41 (<= 2 ~a_t~0)) (.cse43 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse4 (= ~req_tt_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse56 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse16 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= ~c_req_a~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse55 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse59 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse60 (= ULTIMATE.start_s_memory_read_~i 1)) (.cse53 (<= 1 ~c_req_a~0)) (.cse9 (<= 6 ~m_run_pc~0)) (.cse21 (= ~c_empty_req~0 1)) (.cse54 (<= ~c_req_a~0 1)) (.cse57 (= ULTIMATE.start_m_run_~a~0 1)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse47 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ~m_run_pc~0 6)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse30 (<= 1 ~a_t~0)) (.cse49 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (= ~m_run_st~0 0)) (.cse13 (= ~s_memory0~0 50)) (.cse35 (<= ~a_t~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse58 (= ~req_tt_a~0 1)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse19 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse25 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse5 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11 .cse21 .cse22 .cse15 .cse17 .cse23) (and .cse2 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse19 .cse15 .cse5 .cse6 .cse17 .cse18) (and .cse6 .cse24 .cse25 .cse7 .cse8 .cse26 .cse10 .cse27 .cse15 .cse16 .cse17 .cse18 .cse28) (and .cse26 .cse10 .cse21 .cse22 .cse19 .cse6 .cse23 .cse20 .cse7) (and .cse1 .cse29 .cse19 .cse30 .cse6 .cse5 .cse25 .cse31 .cse32 .cse21 .cse22 .cse33 .cse34 .cse13 .cse15 .cse17 .cse35 .cse18 .cse36 .cse37) (and .cse1 .cse29 .cse38 .cse39 .cse40 .cse5 .cse24 .cse6 .cse41 .cse25 .cse10 .cse32 .cse13 .cse34 .cse42 .cse15 .cse17 .cse43 .cse18 .cse44) (and .cse40 .cse6 .cse5 .cse24 .cse25 .cse7 .cse8 .cse10 .cse27 .cse15 .cse16 .cse17 .cse18 .cse28) (and .cse0 .cse38 .cse45 .cse46 .cse19 .cse6 .cse5 .cse41 .cse9 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse21 (= 52 ~c_rsp_d~0) .cse47 .cse15 .cse17 .cse2 .cse48 .cse3 .cse39 .cse49 .cse22 .cse13 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse43 .cse18) (and .cse1 .cse50 .cse51 .cse52 .cse30 .cse53 .cse40 .cse5 .cse24 .cse6 .cse25 .cse31 .cse10 .cse33 .cse54 .cse15 .cse17 .cse35 .cse18 .cse36 .cse37) (and .cse26 .cse10 .cse11 .cse21 .cse15 .cse6 .cse17 .cse23 .cse20 .cse7 .cse8) (and .cse0 .cse2 .cse48 .cse55 .cse3 .cse53 .cse5 .cse6 (= ~a_t~0 1) .cse9 .cse49 .cse10 .cse11 .cse54 .cse13 .cse56 .cse57 .cse15 .cse47 .cse17 .cse18 .cse58) (and .cse26 .cse10 .cse19 .cse40 .cse6 .cse25 .cse7) (and .cse1 .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse19 .cse6 .cse5 .cse41 .cse25 .cse21 .cse22 .cse12 .cse13 .cse42 .cse15 .cse17 .cse43 .cse18 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse44) (and .cse1 .cse50 .cse51 .cse52 .cse19 .cse6 .cse5 .cse25 .cse8 .cse21 .cse22 .cse27 .cse15 .cse16 .cse17 .cse18 .cse28) (and .cse2 .cse10 .cse21 .cse19 .cse15 .cse41 .cse5 .cse6 .cse17 .cse43) (and .cse10 .cse21 .cse5 .cse6 .cse25) (and .cse0 .cse2 .cse48 .cse38 .cse45 .cse46 .cse59 .cse3 .cse60 .cse39 .cse5 .cse6 .cse41 .cse9 .cse49 .cse10 .cse11 .cse13 .cse15 .cse47 .cse17 .cse43 .cse18) (and .cse0 .cse19 .cse4 .cse6 .cse5 .cse8 .cse9 .cse11 .cse21 .cse56 .cse14 .cse15 .cse47 .cse16 .cse17 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse2 .cse48 .cse3 .cse7 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse49 .cse22 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse18) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse55 .cse59 .cse19 .cse60 .cse53 .cse6 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse11 .cse21 .cse54 .cse57 .cse15 .cse47 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse2 .cse48 .cse3 .cse30 .cse49 .cse22 .cse13 (= 51 ~c_rsp_d~0) .cse35 .cse18 .cse58) (and .cse10 .cse19 .cse6 .cse5 .cse17 .cse25)))) [2021-01-06 19:26:15,684 INFO L185 CegarLoopUtils]: At program point L1066(lines 1059 1085) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse5 (= 2 ~s_run_pc~0)) (.cse14 (<= 6 ~m_run_pc~0)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 (<= 2 ~a_t~0) .cse14 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= 52 ~c_rsp_d~0) .cse10 .cse11 .cse12 .cse1 .cse2 .cse3 (<= ~c_req_a~0 2) .cse6 .cse9 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse14 .cse7 (<= ~c_req_a~0 1) .cse8 .cse11 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse2 .cse3 (<= 1 ~a_t~0) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (= 51 ~c_rsp_d~0) .cse9 (<= ~a_t~0 1) .cse13 (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,684 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,684 INFO L189 CegarLoopUtils]: For program point L1265(lines 1265 1318) no Hoare annotation was computed. [2021-01-06 19:26:15,684 INFO L185 CegarLoopUtils]: At program point L1199(lines 1192 1236) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2021-01-06 19:26:15,684 INFO L189 CegarLoopUtils]: For program point L76(lines 76 81) no Hoare annotation was computed. [2021-01-06 19:26:15,685 INFO L189 CegarLoopUtils]: For program point L869(lines 869 873) no Hoare annotation was computed. [2021-01-06 19:26:15,685 INFO L185 CegarLoopUtils]: At program point L737(lines 730 747) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16) (let ((.cse17 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse17 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse17 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16)))) [2021-01-06 19:26:15,686 INFO L185 CegarLoopUtils]: At program point L605(lines 598 615) the Hoare annotation is: (let ((.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= ~s_memory1~0 51)) (.cse9 (= ~s_memory2~0 52)) (.cse1 (not (= ~s_run_st~0 0))) (.cse12 (= ~c_empty_rsp~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_req_type~0 0)) (.cse13 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_m_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 .cse9 (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~a~0 2) .cse13 (= 51 ~c_rsp_d~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~a_t~0 1) .cse14 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse14) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) .cse9 .cse1 (or (and .cse12 (= ~m_run_pc~0 0)) (and .cse12 (= ~m_run_pc~0 3))) .cse3 .cse2 (= ~c_req_a~0 0) .cse10 .cse4 .cse13 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 0) .cse14))) [2021-01-06 19:26:15,686 INFO L185 CegarLoopUtils]: At program point L341(lines 334 378) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,686 INFO L189 CegarLoopUtils]: For program point L1266(lines 1266 1270) no Hoare annotation was computed. [2021-01-06 19:26:15,686 INFO L185 CegarLoopUtils]: At program point L209(lines 179 210) the Hoare annotation is: (let ((.cse19 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (= ~s_run_pc~0 0)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (= ~m_run_pc~0 3)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse17 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse9 (<= .cse19 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_req_type~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse19)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse3 .cse7 .cse8 .cse6 .cse9 .cse10 .cse0 .cse1 .cse11 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15) (and .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse2 (<= 1 ~a_t~0) .cse17 .cse3 .cse18 (<= 51 ~c_req_d~0) .cse10 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse14 (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse15 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse16 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse2 .cse17 .cse3 .cse18 .cse8 .cse10 .cse1 (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse13 .cse14 .cse15 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse2 .cse3 .cse17 .cse7 .cse6 .cse8 .cse9 .cse10 .cse1 .cse11 .cse13 .cse12 .cse4 .cse14 .cse5 .cse15)))) [2021-01-06 19:26:15,687 INFO L189 CegarLoopUtils]: For program point L1068(lines 1068 1072) no Hoare annotation was computed. [2021-01-06 19:26:15,687 INFO L185 CegarLoopUtils]: At program point L936(lines 929 964) the Hoare annotation is: (let ((.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= ~c_req_type~0 0))) (let ((.cse3 (not .cse35)) (.cse9 (not .cse34)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse29 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_a~0 1)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (<= 2 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse23 (<= 2 ~a_t~0)) (.cse37 (<= 6 ~m_run_pc~0)) (.cse36 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~m_run_pc~0 6)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= ~s_memory2~0 52)) (.cse24 (<= ~c_req_a~0 2)) (.cse25 (= ~s_memory0~0 50)) (.cse26 (= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse4 .cse6 .cse23 .cse7 .cse13 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse16 .cse18 .cse24 .cse3 .cse5 .cse8 .cse9 .cse12 .cse25 .cse26 .cse27 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse28 .cse2 .cse29 .cse4 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 1 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse25 (<= ~a_t~0 1) .cse19 (<= ~c_req_d~0 51)) (and .cse21 .cse31 .cse32 .cse33 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse36 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse31 .cse32 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse28 .cse33 .cse2 .cse29 .cse4 .cse6 (= ~a_t~0 1) .cse37 .cse34 .cse12 .cse35 .cse30 .cse13 .cse25 (= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse36 .cse18 .cse19 (= ~req_tt_a~0 1)) (and .cse21 .cse22 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse6 .cse23 .cse37 .cse35 .cse13 .cse16 .cse36 .cse18 .cse31 .cse32 .cse33 .cse24 .cse34 .cse12 .cse25 .cse26 .cse27 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 19:26:15,688 INFO L185 CegarLoopUtils]: At program point L870(lines 862 1113) the Hoare annotation is: (let ((.cse12 (<= 1 ~a_t~0)) (.cse13 (<= 1 ~c_req_a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse15 (<= ~c_req_a~0 1)) (.cse17 (<= ~a_t~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= 2 ~c_req_a~0)) (.cse24 (<= ~c_req_a~0 2)) (.cse3 (= ~c_req_type~0 1)) (.cse25 (<= 2 ~a_t~0)) (.cse29 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse19 (= ~s_memory1~0 51)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse23 (= ~s_memory2~0 52)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~a_t~0 0)) (.cse26 (<= 6 ~m_run_pc~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse27 (= ~c_req_type~0 0)) (.cse16 (= ~s_memory0~0 50)) (.cse28 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 50)) (and (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse12 .cse13 .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse7 .cse14 .cse15 .cse16 .cse8 .cse10 .cse17 .cse11 (<= ~c_req_d~0 51) .cse18) (and .cse19 .cse20 .cse21 .cse22 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse23 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse24 .cse1 .cse2 .cse25 .cse26 .cse7 .cse27 .cse16 .cse8 .cse28 .cse10 .cse29 .cse11) (and .cse19 .cse20 .cse21 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse23 .cse0 .cse12 .cse13 .cse1 .cse2 .cse26 .cse7 .cse27 .cse14 .cse15 .cse16 .cse28 .cse8 .cse10 .cse17 .cse11 (= ~req_tt_a~0 1) .cse18) (and .cse19 .cse22 .cse0 .cse24 .cse1 .cse2 .cse3 .cse25 .cse4 .cse7 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse16 (<= ~c_req_d~0 52) .cse8 .cse10 .cse29 .cse11 (<= 52 ~c_req_d~0)) (and .cse7 (= ~c_empty_req~0 1) .cse0 .cse1 .cse2 .cse4) (and .cse19 .cse20 .cse21 .cse23 .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse5 .cse6 .cse26 .cse7 .cse27 .cse16 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse28 .cse8 .cse9 .cse10 .cse11))) [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L738(lines 730 747) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L606(lines 487 839) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L408(lines 408 461) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L1201(lines 1201 1205) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L78(lines 78 81) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,688 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L1003-1(lines 878 1108) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L739(lines 739 743) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L607(lines 607 611) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-01-06 19:26:15,689 INFO L189 CegarLoopUtils]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-01-06 19:26:15,690 INFO L185 CegarLoopUtils]: At program point L277(lines 270 287) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~s_run_st~0 0))) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= ~m_run_pc~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (let ((.cse1 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse0 (= ~c_req_type~0 1) (<= ~c_req_d~0 .cse1) .cse2 .cse3 (= ~a_t~0 0) (<= .cse1 ULTIMATE.start_m_run_~req_d~0) (= ULTIMATE.start_m_run_~req_type~0 1) .cse4 .cse5 (<= ULTIMATE.start_m_run_~req_d~0 .cse1) (<= 2 ~c_m_ev~0) .cse6 .cse7 (<= 1 ~c_m_lock~0) (<= .cse1 ~c_req_d~0))) (and .cse4 .cse8 .cse0 (= 2 ~s_run_pc~0)) (and .cse5 .cse4 .cse8 (not (= ~c_req_type~0 0)) .cse0 .cse6 .cse7 .cse2 .cse3 (not (= ULTIMATE.start_m_run_~req_type~0 0))))) [2021-01-06 19:26:15,690 INFO L189 CegarLoopUtils]: For program point L1136(lines 1136 1143) no Hoare annotation was computed. [2021-01-06 19:26:15,690 INFO L189 CegarLoopUtils]: For program point L1004(lines 1003 1027) no Hoare annotation was computed. [2021-01-06 19:26:15,690 INFO L189 CegarLoopUtils]: For program point L938(lines 938 942) no Hoare annotation was computed. [2021-01-06 19:26:15,690 INFO L185 CegarLoopUtils]: At program point L13-3(lines 1 1378) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (<= 6 ~m_run_pc~0)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_req_type~0 0)) (.cse5 (= ~c_empty_req~0 1)) (.cse14 (= ~s_memory0~0 50)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 (<= 2 ~a_t~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse15) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse1 .cse2 (= ~a_t~0 1) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse4 (<= ~c_req_a~0 1) .cse5 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse0 .cse9 .cse10 .cse11 (= ~req_tt_a~0 0) .cse1 .cse2 (= ~c_req_a~0 0) (= ~a_t~0 0) .cse3 .cse12 .cse13 .cse4 .cse5 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 (= ULTIMATE.start_s_memory_read_~i 0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2021-01-06 19:26:15,691 INFO L185 CegarLoopUtils]: At program point L13-4(lines 72 84) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse11 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse14 (= ~a_t~0 0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse15 (<= 50 ~c_req_d~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and .cse0 (= ~s_memory1~0 51) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 .cse11 .cse12 .cse13 (not (= ~s_run_st~0 0)) .cse2 (= ~c_req_type~0 1) .cse4 .cse3 .cse14 (= ~s_run_pc~0 0) .cse5 .cse6 .cse15 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse0 .cse11 .cse12 .cse13 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse9 .cse10 .cse17))) [2021-01-06 19:26:15,691 INFO L189 CegarLoopUtils]: For program point L278(lines 270 287) no Hoare annotation was computed. [2021-01-06 19:26:15,691 INFO L189 CegarLoopUtils]: For program point L1005(lines 1005 1009) no Hoare annotation was computed. [2021-01-06 19:26:15,691 INFO L189 CegarLoopUtils]: For program point L279(lines 279 283) no Hoare annotation was computed. [2021-01-06 19:26:15,692 INFO L185 CegarLoopUtils]: At program point L147-2(lines 147 175) the Hoare annotation is: (let ((.cse22 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse2 (= 2 ~s_run_pc~0))) (let ((.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= ~m_run_pc~0 3)) (.cse16 (= ~s_run_pc~0 0)) (.cse19 (not .cse2)) (.cse14 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse12 (= ~c_req_a~0 0)) (.cse13 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse15 (<= .cse22 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse17 (= ~c_req_type~0 0)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_d~0 .cse22)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse21 (= ~m_run_pc~0 0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) .cse8 .cse9 (<= 51 ~c_req_d~0) .cse10 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse7 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse8 .cse9 .cse11 .cse3 .cse10 .cse4 (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse5 .cse6 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse9 .cse12 .cse11 .cse13 .cse14 .cse15 .cse3 .cse16 .cse10 .cse17 .cse4 .cse18 .cse5 .cse19 .cse20 .cse6 .cse21) (and .cse16 .cse10 .cse4 .cse0 .cse19 .cse20 .cse1 .cse21 .cse9 .cse13 .cse14) (and .cse0 .cse2 .cse1 .cse9 .cse12 .cse13 .cse11 .cse15 .cse3 .cse10 .cse17 .cse4 .cse5 .cse18 .cse20 .cse6 .cse21)))) [2021-01-06 19:26:15,692 INFO L189 CegarLoopUtils]: For program point L676(lines 676 729) no Hoare annotation was computed. [2021-01-06 19:26:15,692 INFO L189 CegarLoopUtils]: For program point L148(lines 147 175) no Hoare annotation was computed. [2021-01-06 19:26:15,692 INFO L189 CegarLoopUtils]: For program point L677(lines 677 681) no Hoare annotation was computed. [2021-01-06 19:26:15,692 INFO L185 CegarLoopUtils]: At program point L1272(lines 1265 1318) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 (<= 2 ~a_t~0) .cse8 .cse4 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,693 INFO L189 CegarLoopUtils]: For program point L149(lines 149 153) no Hoare annotation was computed. [2021-01-06 19:26:15,693 INFO L185 CegarLoopUtils]: At program point L1074(lines 1067 1084) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse5 (= 2 ~s_run_pc~0)) (.cse14 (<= 6 ~m_run_pc~0)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ~s_memory2~0 52)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 (<= 2 ~a_t~0) .cse14 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (= 52 ~c_rsp_d~0) .cse10 .cse11 .cse12 .cse1 .cse2 .cse3 (<= ~c_req_a~0 2) .cse6 .cse9 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse14 .cse7 (<= ~c_req_a~0 1) .cse8 .cse11 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse2 .cse3 (<= 1 ~a_t~0) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (= 51 ~c_rsp_d~0) .cse9 (<= ~a_t~0 1) .cse13 (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,693 INFO L189 CegarLoopUtils]: For program point L216(lines 216 269) no Hoare annotation was computed. [2021-01-06 19:26:15,693 INFO L185 CegarLoopUtils]: At program point L1207(lines 1200 1235) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2021-01-06 19:26:15,693 INFO L189 CegarLoopUtils]: For program point L1075(lines 878 1108) no Hoare annotation was computed. [2021-01-06 19:26:15,694 INFO L185 CegarLoopUtils]: At program point L415(lines 408 461) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,694 INFO L185 CegarLoopUtils]: At program point L349(lines 342 377) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,694 INFO L189 CegarLoopUtils]: For program point L1340(lines 1340 1344) no Hoare annotation was computed. [2021-01-06 19:26:15,694 INFO L189 CegarLoopUtils]: For program point L1340-1(lines 1172 1351) no Hoare annotation was computed. [2021-01-06 19:26:15,695 INFO L189 CegarLoopUtils]: For program point L1274(lines 1274 1278) no Hoare annotation was computed. [2021-01-06 19:26:15,695 INFO L189 CegarLoopUtils]: For program point L217(lines 217 221) no Hoare annotation was computed. [2021-01-06 19:26:15,695 INFO L189 CegarLoopUtils]: For program point L1076(lines 1076 1080) no Hoare annotation was computed. [2021-01-06 19:26:15,695 INFO L185 CegarLoopUtils]: At program point L944(lines 937 963) the Hoare annotation is: (let ((.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= ~c_req_type~0 0))) (let ((.cse3 (not .cse35)) (.cse9 (not .cse34)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse29 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_a~0 1)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (<= 2 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse23 (<= 2 ~a_t~0)) (.cse37 (<= 6 ~m_run_pc~0)) (.cse36 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~m_run_pc~0 6)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= ~s_memory2~0 52)) (.cse24 (<= ~c_req_a~0 2)) (.cse25 (= ~s_memory0~0 50)) (.cse26 (= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse4 .cse6 .cse23 .cse7 .cse13 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse16 .cse18 .cse24 .cse3 .cse5 .cse8 .cse9 .cse12 .cse25 .cse26 .cse27 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse28 .cse2 .cse29 .cse4 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 1 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse25 (<= ~a_t~0 1) .cse19 (<= ~c_req_d~0 51)) (and .cse21 .cse31 .cse32 .cse33 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse36 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse31 .cse32 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse28 .cse33 .cse2 .cse29 .cse4 .cse6 (= ~a_t~0 1) .cse37 .cse34 .cse12 .cse35 .cse30 .cse13 .cse25 (= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse36 .cse18 .cse19 (= ~req_tt_a~0 1)) (and .cse21 .cse22 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse6 .cse23 .cse37 .cse35 .cse13 .cse16 .cse36 .cse18 .cse31 .cse32 .cse33 .cse24 .cse34 .cse12 .cse25 .cse26 .cse27 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 19:26:15,696 INFO L185 CegarLoopUtils]: At program point L878-1(lines 862 1113) the Hoare annotation is: (let ((.cse3 (<= 2 ~a_t~0)) (.cse16 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse19 (not (= ~s_run_st~0 0))) (.cse20 (= ~c_req_a~0 0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse21 (= ~a_t~0 0)) (.cse25 (<= 50 ~c_req_d~0)) (.cse24 (= ULTIMATE.start_m_run_~a~0 0)) (.cse26 (<= ~c_req_d~0 50)) (.cse22 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse23 (= ~m_run_pc~0 3)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse27 (<= 1 ~a_t~0)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= ~m_run_st~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse29 (<= ~a_t~0 1)) (.cse17 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse5 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 2 ULTIMATE.start_s_run_~req_a~1) .cse16 .cse17) (and .cse18 .cse5 .cse6 .cse19 .cse8 .cse1 .cse9 (= ~m_run_pc~0 0) (not (= ~c_m_lock~0 1)) .cse20 .cse21) (and .cse22 .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse3 .cse1 .cse23 .cse6 .cse14 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse15 (<= ~c_req_d~0 52) .cse8 .cse9 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 .cse24 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 .cse20 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse17) (and .cse19 (= ~c_req_type~0 1) .cse1 .cse23 .cse20 .cse21 (= ~s_run_pc~0 0) .cse18 .cse25 .cse8 .cse24 .cse9 .cse17 .cse26) (and .cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse23 .cse21 .cse6 .cse14 .cse25 .cse8 .cse24 .cse9 .cse17 .cse26) (and .cse22 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse1 .cse23 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse28 .cse6 .cse14 .cse15 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 .cse29 .cse17 (<= ~c_req_d~0 51) .cse30) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse30 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse14 (= 51 ~c_rsp_d~0) .cse15 .cse29 .cse17 (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,696 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 19:26:15,696 INFO L189 CegarLoopUtils]: For program point L1209(lines 1209 1213) no Hoare annotation was computed. [2021-01-06 19:26:15,696 INFO L189 CegarLoopUtils]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-01-06 19:26:15,697 INFO L185 CegarLoopUtils]: At program point L483(lines 135 484) the Hoare annotation is: (and (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 52 ULTIMATE.start_s_run_~req_d~1) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (<= 2 ~a_t~0) (= ~m_run_pc~0 3) (<= 3 ULTIMATE.start_m_run_~a~0) (not (= ~c_m_lock~0 1)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) [2021-01-06 19:26:15,697 INFO L189 CegarLoopUtils]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-01-06 19:26:15,697 INFO L189 CegarLoopUtils]: For program point L351(lines 351 355) no Hoare annotation was computed. [2021-01-06 19:26:15,697 INFO L189 CegarLoopUtils]: For program point L946(lines 946 950) no Hoare annotation was computed. [2021-01-06 19:26:15,697 INFO L189 CegarLoopUtils]: For program point L881-1(lines 878 1108) no Hoare annotation was computed. [2021-01-06 19:26:15,697 INFO L189 CegarLoopUtils]: For program point L749(lines 749 755) no Hoare annotation was computed. [2021-01-06 19:26:15,697 INFO L185 CegarLoopUtils]: At program point L749-1(lines 749 755) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse2 .cse3 (= ~a_t~0 1) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse15 (= 51 ~c_rsp_d~0) (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))))) [2021-01-06 19:26:15,698 INFO L185 CegarLoopUtils]: At program point L683(lines 676 729) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16) (let ((.cse17 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse17 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse17 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16)))) [2021-01-06 19:26:15,698 INFO L189 CegarLoopUtils]: For program point L882(lines 881 905) no Hoare annotation was computed. [2021-01-06 19:26:15,699 INFO L185 CegarLoopUtils]: At program point L1147(lines 1121 1162) the Hoare annotation is: (let ((.cse1 (= ~c_req_type~0 0))) (let ((.cse28 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse34 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse23 (= ~c_req_type~0 1)) (.cse30 (<= 51 ~c_req_d~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse36 (<= ~c_req_d~0 51)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse40 (not .cse1)) (.cse18 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse42 (<= ~c_req_d~0 52)) (.cse44 (<= 52 ~c_req_d~0)) (.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse50 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse51 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse52 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse26 (<= 50 ~c_req_d~0)) (.cse27 (<= ~c_req_d~0 50)) (.cse38 (<= 2 ~c_req_a~0)) (.cse45 (= ~req_tt_a~0 2)) (.cse46 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse41 (<= 2 ~a_t~0)) (.cse43 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (= ~req_tt_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse56 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse20 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~s_memory1~0 51)) (.cse55 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse59 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse60 (= ULTIMATE.start_s_memory_read_~i 1)) (.cse53 (<= 1 ~c_req_a~0)) (.cse17 (<= 6 ~m_run_pc~0)) (.cse54 (<= ~c_req_a~0 1)) (.cse57 (= ULTIMATE.start_m_run_~a~0 1)) (.cse4 (<= 2 ~c_m_ev~0)) (.cse47 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse14 (= ~m_run_pc~0 6)) (.cse48 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~s_memory2~0 52)) (.cse29 (<= 1 ~a_t~0)) (.cse49 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse32 (= ~m_run_st~0 0)) (.cse19 (= ~s_memory0~0 50)) (.cse35 (<= ~a_t~0 1)) (.cse22 (<= 1 ~c_m_lock~0)) (.cse58 (= ~req_tt_a~0 1)) (.cse25 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse5 .cse6 .cse10 .cse11 .cse17 .cse0 .cse1 .cse18 .cse19 .cse20 .cse4 .cse21 .cse7 .cse22) (and .cse14 .cse0 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse22) (and .cse6 .cse23 .cse24 .cse10 .cse11 .cse25 .cse0 .cse26 .cse4 .cse21 .cse7 .cse22 .cse27) (and .cse13 .cse28 .cse3 .cse29 .cse6 .cse5 .cse24 .cse30 .cse31 .cse2 .cse32 .cse33 .cse34 .cse19 .cse4 .cse7 .cse35 .cse22 .cse36 .cse37) (and .cse13 .cse28 .cse38 .cse39 .cse40 .cse5 .cse23 .cse6 .cse41 .cse24 .cse0 .cse31 .cse19 .cse34 .cse42 .cse4 .cse7 .cse43 .cse22 .cse44) (and .cse40 .cse6 .cse5 .cse23 .cse24 .cse10 .cse11 .cse0 .cse26 .cse4 .cse21 .cse7 .cse22 .cse27) (and .cse12 .cse38 .cse45 .cse46 .cse3 .cse6 .cse5 .cse41 .cse17 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 52 ~c_rsp_d~0) .cse47 .cse4 .cse7 .cse14 .cse48 .cse15 .cse39 .cse49 .cse32 .cse19 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse43 .cse22) (and .cse13 .cse50 .cse51 .cse52 .cse29 .cse53 .cse40 .cse5 .cse23 .cse6 .cse24 .cse30 .cse0 .cse33 .cse54 .cse4 .cse7 .cse35 .cse22 .cse36 .cse37) (and .cse25 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse14 .cse48 .cse55 .cse15 .cse53 .cse5 .cse6 (= ~a_t~0 1) .cse17 .cse49 .cse0 .cse1 .cse54 .cse19 .cse56 .cse57 .cse4 .cse47 .cse7 .cse22 .cse58) (and .cse25 .cse0 .cse3 .cse40 .cse6 .cse24 .cse10) (and .cse13 .cse12 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse3 .cse6 .cse5 .cse41 .cse24 .cse2 .cse32 .cse18 .cse19 .cse42 .cse4 .cse7 .cse43 .cse22 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse44) (and .cse13 .cse50 .cse51 .cse52 .cse3 .cse6 .cse5 .cse24 .cse11 .cse2 .cse32 .cse26 .cse4 .cse21 .cse7 .cse22 .cse27) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse41 .cse5 .cse6 .cse7 .cse43) (and .cse0 .cse2 .cse5 .cse6 .cse24) (and .cse12 .cse14 .cse48 .cse38 .cse45 .cse46 .cse59 .cse15 .cse60 .cse39 .cse5 .cse6 .cse41 .cse17 .cse49 .cse0 .cse1 .cse19 .cse4 .cse47 .cse7 .cse43 .cse22) (and .cse12 .cse3 .cse16 .cse6 .cse5 .cse11 .cse17 .cse1 .cse2 .cse56 .cse20 .cse4 .cse47 .cse21 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse14 .cse48 .cse15 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse49 .cse32 .cse19 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse22) (and .cse12 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse55 .cse59 .cse3 .cse60 .cse53 .cse6 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse17 .cse1 .cse2 .cse54 .cse57 .cse4 .cse47 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse14 .cse48 .cse15 .cse29 .cse49 .cse32 .cse19 (= 51 ~c_rsp_d~0) .cse35 .cse22 .cse58) (and .cse25 .cse0 .cse2 .cse3 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse3 .cse6 .cse5 .cse7 .cse24)))) [2021-01-06 19:26:15,699 INFO L189 CegarLoopUtils]: For program point L883(lines 883 887) no Hoare annotation was computed. [2021-01-06 19:26:15,699 INFO L189 CegarLoopUtils]: For program point L685(lines 685 689) no Hoare annotation was computed. [2021-01-06 19:26:15,699 INFO L185 CegarLoopUtils]: At program point L487-2(lines 487 839) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (let ((.cse9 (<= 3 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= 2 ~a_t~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse13 (= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 6 ~m_run_pc~0)) (.cse14 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_m_ev~0)) (.cse15 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (= ~m_run_pc~0 6)) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~s_memory2~0 52)) (.cse18 (= .cse21 ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse20 (= ~s_memory0~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 .cse12 .cse8 .cse9 .cse10) (and .cse13 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~c_req_a~0) .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse14 (<= ~c_req_a~0 1) .cse2 .cse15 .cse4 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse0 .cse16 .cse17 (<= 1 ~a_t~0) .cse18 .cse10 .cse19 .cse1 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse20 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1)) (and .cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse17 .cse3 .cse7 .cse6 .cse5 .cse12 .cse10 .cse1 .cse2 .cse20 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse4 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= 52 ~c_req_d~0)) (and .cse13 .cse3 (= ~req_tt_a~0 0) .cse6 .cse7 (= ~a_t~0 0) .cse11 .cse14 .cse2 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 1) .cse4 .cse15 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse16 .cse17 .cse18 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse21 ~c_rsp_d~0) .cse19 .cse1 .cse20 (= |ULTIMATE.start_s_memory_read_#res| 50))))) [2021-01-06 19:26:15,700 INFO L185 CegarLoopUtils]: At program point L1280(lines 1273 1317) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 (<= 2 ~a_t~0) .cse8 .cse4 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,700 INFO L185 CegarLoopUtils]: At program point L223(lines 216 269) the Hoare annotation is: (let ((.cse20 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (= ~m_run_pc~0 3)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_req_type~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse16 (<= ~c_req_d~0 .cse20)) (.cse14 (= ~c_req_a~0 0)) (.cse10 (= ~a_t~0 0)) (.cse15 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse17 (<= .cse20 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (= ~s_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse18 (<= ULTIMATE.start_m_run_~req_d~0 .cse20)) (.cse4 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (= ~m_run_pc~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse19 (<= .cse20 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~c_req_a~0) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse4 .cse5 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse6 .cse7 .cse8 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse9 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 52 ~c_req_d~0)) (and .cse5 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 (<= 1 ~c_req_a~0) .cse1 .cse6 .cse2 .cse7 (<= 51 ~c_req_d~0) .cse10 .cse3 .cse8 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse4 .cse9 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse11 .cse8 .cse0 (not (= ~c_req_type~0 0)) .cse2 .cse12 .cse13 .cse14 .cse15 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse1 .cse6 .cse2 .cse16 .cse14 .cse15 .cse10 .cse17 .cse3 .cse8 .cse18 .cse4 .cse12 .cse13 .cse9 .cse19) (and .cse6 .cse2 .cse16 .cse14 .cse10 .cse15 .cse17 .cse3 .cse11 .cse8 .cse18 .cse4 .cse12 .cse13 .cse9 .cse19)))) [2021-01-06 19:26:15,700 INFO L189 CegarLoopUtils]: For program point L488(lines 487 839) no Hoare annotation was computed. [2021-01-06 19:26:15,700 INFO L192 CegarLoopUtils]: At program point L1347(lines 1169 1352) the Hoare annotation is: true [2021-01-06 19:26:15,701 INFO L185 CegarLoopUtils]: At program point L290-2(lines 290 318) the Hoare annotation is: (let ((.cse18 (= 2 ~s_run_pc~0))) (let ((.cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse25 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse26 (<= 1 ~a_t~0)) (.cse19 (<= 51 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (<= ~a_t~0 1)) (.cse22 (<= ~c_req_d~0 51)) (.cse23 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse34 (= ~m_run_pc~0 3)) (.cse33 (= ~c_empty_req~0 1)) (.cse28 (= ~s_memory0~0 50)) (.cse30 (<= ~c_req_d~0 52)) (.cse31 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse32 (<= 52 ~c_req_d~0)) (.cse5 (= ~s_run_pc~0 0)) (.cse24 (not (= ~s_run_st~0 0))) (.cse9 (not .cse18)) (.cse0 (not (= ~c_req_type~0 0))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= 50 ~c_req_d~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_a~0 0)) (.cse13 (<= ~c_req_d~0 50)) (.cse4 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 (<= 0 ~a_t~0) .cse17 (<= 1 ~c_req_a~0) .cse2 .cse18 .cse1 .cse19 .cse6 .cse20 (<= ~c_req_a~0 1) .cse8 .cse11 .cse21 .cse12 .cse22 .cse23) (and .cse6 .cse24 .cse2 .cse18 .cse11) (and .cse14 .cse25 (<= 2 ~c_req_a~0) .cse26 (<= ~c_req_a~0 2) .cse2 .cse18 .cse1 .cse6 .cse27 .cse28 .cse29 .cse30 .cse8 .cse11 .cse31 .cse12 .cse32) (and .cse6 .cse33 .cse2 .cse18 .cse34) (and .cse14 .cse15 .cse16 .cse17 .cse24 .cse2 .cse18 .cse34 .cse4 .cse33 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse25 .cse24 .cse26 .cse2 .cse18 .cse34 .cse19 .cse27 .cse33 .cse20 .cse28 .cse29 .cse8 .cse11 .cse21 .cse12 .cse22 .cse23) (and (= ~s_memory1~0 51) .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse24 (<= 2 ~a_t~0) .cse2 .cse18 .cse34 .cse33 .cse28 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse30 .cse8 .cse11 .cse31 .cse12 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse32) (and .cse5 .cse6 .cse24 .cse9 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse2 .cse18 .cse1 .cse10 .cse11 .cse12 .cse3 .cse13 .cse4)))) [2021-01-06 19:26:15,701 INFO L185 CegarLoopUtils]: At program point L1215(lines 1208 1234) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2021-01-06 19:26:15,701 INFO L185 CegarLoopUtils]: At program point L819(lines 812 829) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_a~0 2) .cse12 .cse13 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0)) (let ((.cse16 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= .cse16 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse16 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50))) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (= ~req_tt_a~0 1)))) [2021-01-06 19:26:15,701 INFO L189 CegarLoopUtils]: For program point L621(lines 621 625) no Hoare annotation was computed. [2021-01-06 19:26:15,702 INFO L189 CegarLoopUtils]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-01-06 19:26:15,702 INFO L185 CegarLoopUtils]: At program point L423(lines 416 460) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,702 INFO L185 CegarLoopUtils]: At program point L357(lines 350 376) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,702 INFO L189 CegarLoopUtils]: For program point L291(lines 290 318) no Hoare annotation was computed. [2021-01-06 19:26:15,703 INFO L189 CegarLoopUtils]: For program point L1282(lines 1282 1286) no Hoare annotation was computed. [2021-01-06 19:26:15,703 INFO L189 CegarLoopUtils]: For program point L225(lines 225 229) no Hoare annotation was computed. [2021-01-06 19:26:15,703 INFO L185 CegarLoopUtils]: At program point L952(lines 945 962) the Hoare annotation is: (let ((.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= ~c_req_type~0 0))) (let ((.cse3 (not .cse35)) (.cse9 (not .cse34)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse29 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_a~0 1)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (<= 2 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse23 (<= 2 ~a_t~0)) (.cse37 (<= 6 ~m_run_pc~0)) (.cse36 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ~m_run_pc~0 6)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= ~s_memory2~0 52)) (.cse24 (<= ~c_req_a~0 2)) (.cse25 (= ~s_memory0~0 50)) (.cse26 (= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse4 .cse6 .cse23 .cse7 .cse13 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse16 .cse18 .cse24 .cse3 .cse5 .cse8 .cse9 .cse12 .cse25 .cse26 .cse27 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse28 .cse2 .cse29 .cse4 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 1 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 (<= ULTIMATE.start_m_run_~a~0 1) .cse25 (<= ~a_t~0 1) .cse19 (<= ~c_req_d~0 51)) (and .cse21 .cse31 .cse32 .cse33 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse36 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse31 .cse32 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse28 .cse33 .cse2 .cse29 .cse4 .cse6 (= ~a_t~0 1) .cse37 .cse34 .cse12 .cse35 .cse30 .cse13 .cse25 (= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse36 .cse18 .cse19 (= ~req_tt_a~0 1)) (and .cse21 .cse22 (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse6 .cse23 .cse37 .cse35 .cse13 .cse16 .cse36 .cse18 .cse31 .cse32 .cse33 .cse24 .cse34 .cse12 .cse25 .cse26 .cse27 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 19:26:15,703 INFO L189 CegarLoopUtils]: For program point L820(lines 812 829) no Hoare annotation was computed. [2021-01-06 19:26:15,703 INFO L189 CegarLoopUtils]: For program point L292(lines 292 296) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L1217(lines 1217 1221) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L1151(lines 1151 1158) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L953(lines 878 1108) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L821(lines 821 825) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L425(lines 425 429) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L359(lines 359 363) no Hoare annotation was computed. [2021-01-06 19:26:15,704 INFO L189 CegarLoopUtils]: For program point L954(lines 954 958) no Hoare annotation was computed. [2021-01-06 19:26:15,705 INFO L185 CegarLoopUtils]: At program point L691(lines 684 728) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse7 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 2 ~c_req_a~0) (= ~req_tt_a~0 2) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 52 ~c_rsp_d~0) .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 2) .cse13 .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse15 (= ULTIMATE.start_s_memory_read_~i 2) (= 2 ULTIMATE.start_s_run_~req_a~1) (= 52 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16) (let ((.cse17 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 (= .cse17 ULTIMATE.start_m_run_~rsp_d___0~0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse17 ~c_rsp_d~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16)))) [2021-01-06 19:26:15,705 INFO L185 CegarLoopUtils]: At program point L559(lines 529 560) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse6 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse9 .cse10 .cse11 (<= 1 ~a_t~0) .cse12 .cse13 .cse14 (<= ULTIMATE.start_m_run_~a~0 2) .cse15 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse16 (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 .cse1 (<= 2 ~a_t~0) .cse3 .cse2 (= ~m_run_pc~0 3) .cse12 .cse14 .cse15 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse16 (<= 52 ~c_req_d~0)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16))) [2021-01-06 19:26:15,705 INFO L189 CegarLoopUtils]: For program point L758(lines 758 811) no Hoare annotation was computed. [2021-01-06 19:26:15,705 INFO L189 CegarLoopUtils]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-01-06 19:26:15,705 INFO L189 CegarLoopUtils]: For program point L693(lines 693 697) no Hoare annotation was computed. [2021-01-06 19:26:15,706 INFO L185 CegarLoopUtils]: At program point L627(lines 620 637) the Hoare annotation is: (and (= ~c_empty_rsp~0 1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 2 ~c_m_ev~0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (<= 1 ~c_m_lock~0)) [2021-01-06 19:26:15,706 INFO L185 CegarLoopUtils]: At program point L1288(lines 1281 1316) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 .cse9 (<= 2 ~a_t~0) .cse8 .cse4 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2021-01-06 19:26:15,706 INFO L185 CegarLoopUtils]: At program point L231(lines 224 268) the Hoare annotation is: (let ((.cse20 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (= ~m_run_pc~0 3)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_req_type~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse16 (<= ~c_req_d~0 .cse20)) (.cse14 (= ~c_req_a~0 0)) (.cse10 (= ~a_t~0 0)) (.cse15 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse17 (<= .cse20 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (= ~s_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse18 (<= ULTIMATE.start_m_run_~req_d~0 .cse20)) (.cse4 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (= ~m_run_pc~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse19 (<= .cse20 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~c_req_a~0) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse4 .cse5 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= 1 ~a_t~0) (<= ~c_req_a~0 2) .cse6 .cse7 .cse8 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 2) (= ~s_memory0~0 50) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) .cse9 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 52 ~c_req_d~0)) (and .cse5 (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 (<= 1 ~c_req_a~0) .cse1 .cse6 .cse2 .cse7 (<= 51 ~c_req_d~0) .cse10 .cse3 .cse8 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse4 .cse9 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse11 .cse8 .cse0 (not (= ~c_req_type~0 0)) .cse2 .cse12 .cse13 .cse14 .cse15 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse1 .cse6 .cse2 .cse16 .cse14 .cse15 .cse10 .cse17 .cse3 .cse8 .cse18 .cse4 .cse12 .cse13 .cse9 .cse19) (and .cse6 .cse2 .cse16 .cse14 .cse10 .cse15 .cse17 .cse3 .cse11 .cse8 .cse18 .cse4 .cse12 .cse13 .cse9 .cse19)))) [2021-01-06 19:26:15,706 INFO L189 CegarLoopUtils]: For program point L1090(lines 1090 1094) no Hoare annotation was computed. [2021-01-06 19:26:15,707 INFO L189 CegarLoopUtils]: For program point L628(lines 620 637) no Hoare annotation was computed. [2021-01-06 19:26:15,707 INFO L185 CegarLoopUtils]: At program point L1223(lines 1216 1233) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2021-01-06 19:26:15,707 INFO L189 CegarLoopUtils]: For program point L629(lines 629 633) no Hoare annotation was computed. [2021-01-06 19:26:15,707 INFO L185 CegarLoopUtils]: At program point L431(lines 424 459) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ~a_t~0 1) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 2 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,708 INFO L185 CegarLoopUtils]: At program point L497-2(lines 497 525) the Hoare annotation is: (let ((.cse4 (<= 6 ~m_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= ~s_memory1~0 51)) (.cse12 (= ~s_memory2~0 52)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse13 (not (= ~c_m_lock~0 1))) (.cse14 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse17 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 (= ~c_rsp_d~0 50) .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (<= ULTIMATE.start_m_run_~req_a___0~0 2) .cse8 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse11 .cse12 (<= 1 ~a_t~0) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_m_run_~a~0 2) .cse17 (= 51 ~c_rsp_d~0) (<= ~a_t~0 1) (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) (<= 2 ULTIMATE.start_m_run_~req_a___0~0)) (and .cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse12 .cse1 (<= 2 ~a_t~0) .cse3 .cse2 (= ~m_run_pc~0 3) .cse13 .cse14 .cse16 .cse6 .cse17 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse9 (<= 52 ~c_req_d~0)))) [2021-01-06 19:26:15,708 INFO L185 CegarLoopUtils]: At program point L365(lines 358 375) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (<= ~a_t~0 1) .cse10 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) .cse0 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= 2 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 52 ~c_req_d~0)) (and .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (<= 50 ~c_req_d~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 50)))) [2021-01-06 19:26:15,708 INFO L189 CegarLoopUtils]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2021-01-06 19:26:15,708 INFO L189 CegarLoopUtils]: For program point L233(lines 233 237) no Hoare annotation was computed. [2021-01-06 19:26:15,708 INFO L189 CegarLoopUtils]: For program point L1224(lines 1172 1351) no Hoare annotation was computed. [2021-01-06 19:26:16,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:26:16 BoogieIcfgContainer [2021-01-06 19:26:16,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:26:16,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:26:16,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:26:16,005 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:26:16,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:22:50" (3/4) ... [2021-01-06 19:26:16,009 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 19:26:16,048 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-01-06 19:26:16,050 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-01-06 19:26:16,051 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:26:16,053 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:26:16,092 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && m_run_pc == 6) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory2 == req_d) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && a <= 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_req_a) && c_req_a <= 2) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && s_memory2 == 52) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && m_run_st == 0) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && req_a == 1) && s_memory2 == 52) && i == 1) && c_req_a <= 2) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2021-01-06 19:26:16,093 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((s_memory1 == 51 && v == req_d) && m_run_pc == 6) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory2 == req_d) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && a <= 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_req_a) && c_req_a <= 2) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && s_memory2 == 52) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && m_run_st == 0) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && req_a == 1) && s_memory2 == 52) && i == 1) && c_req_a <= 2) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2021-01-06 19:26:16,095 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 52 == x) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) || ((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || ((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && 2 <= a_t) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_req == 1) && m_run_st == 0) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || (((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((!(s_run_st == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && a <= 1) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) [2021-01-06 19:26:16,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 52 == x) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) || (((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && a_t == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && a == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,100 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 3 <= a) && !(c_m_lock == 1)) && 6 <= m_run_pc) || (((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 3 <= a) && !(c_m_lock == 1))) || (((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && req_tt_a == 1)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 52 <= c_req_d)) || (((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2021-01-06 19:26:16,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 1 <= c_m_lock) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && req_a == 1) && s_memory2 == 52) && i == 1) && c_req_a <= 2) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= c_req_a) && a_t == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((s_memory1 == 51 && v == req_d) && m_run_pc == 6) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) [2021-01-06 19:26:16,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && req_tt_a == 1) && 2 <= req_a___0)) || (((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 52 <= c_req_d) [2021-01-06 19:26:16,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 1 <= req_a___0) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && 1 <= a) && req_a___0 <= 1) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) || (((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && req_tt_a == 1) && 2 <= req_a___0)) || (((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 52 <= c_req_d) [2021-01-06 19:26:16,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) [2021-01-06 19:26:16,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= c_req_d) || ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0)) || (((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,107 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) [2021-01-06 19:26:16,108 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && c_empty_rsp == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= c_req_d)) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_rsp_d == 50) && a == 1) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,108 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) [2021-01-06 19:26:16,108 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || ((((((((((((v == req_d && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && a_t == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((v == req_d && s_memory1 == 51) && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && 52 <= req_d) && c_write_rsp_ev == 1) && 2 <= a_t) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 <= a_t) && 2 == s_run_pc) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 52 == x) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || (((((((((((((((v == req_d && 51 <= req_d) && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 <= c_req_d) && req_d <= 51) && a <= 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) [2021-01-06 19:26:16,108 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) [2021-01-06 19:26:16,108 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) [2021-01-06 19:26:16,109 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_req_a) && v <= 52) && req_tt_a == 2) && req_a == 1) && 2 == req_a___0) && s_memory2 == 52) && i == 1) && 1 <= a_t) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_req_a) && v <= 52) && req_a == 1) && 2 == req_a___0) && s_memory2 == 52) && i == 1) && 1 <= a_t) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 1) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && a == 2) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((v <= 52 && s_memory2 == 52) && (((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 1 <= c_req_a) && a_t == 0) && ((((((((c_empty_rsp == 1 && a <= 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || ((((((((c_empty_rsp == 1 && a <= 1) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock))) && req_type == 0) || ((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 1 <= c_req_a) && req_tt_a == 1) && ((((((((c_empty_rsp == 1 && a <= 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || ((((((((c_empty_rsp == 1 && a <= 1) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock))) && req_type == 0))) && 52 <= v) && 1 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || ((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((v == req_d && s_memory1 == 51) && 0 <= a_t) && s_memory2 == 52) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock) [2021-01-06 19:26:16,109 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 1) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,109 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) [2021-01-06 19:26:16,110 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 0 == req_a___0) && req_a == 0) && 52 <= v) && i == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,110 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) [2021-01-06 19:26:16,110 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s_memory1 == 51 && v == req_d) && 0 <= a_t) && s_memory2 == 52) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0)) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,110 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s_memory1 == 51 && v == req_d) && 0 <= a_t) && s_memory2 == 52) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0)) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && 2 <= a) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || (((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && a == 1) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || ((((((((((((((((s_memory1 == 51 && v == req_d) && 0 <= a_t) && s_memory2 == 52) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) [2021-01-06 19:26:16,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,112 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,112 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2021-01-06 19:26:16,112 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 1) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && req_tt_a == 1) || ((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2021-01-06 19:26:16,112 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) [2021-01-06 19:26:16,112 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) [2021-01-06 19:26:16,113 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) [2021-01-06 19:26:16,113 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) [2021-01-06 19:26:16,113 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) [2021-01-06 19:26:16,113 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) [2021-01-06 19:26:16,113 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || (((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1))) || (((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1)) || (((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1)) && 6 <= m_run_pc) [2021-01-06 19:26:16,267 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/mem_slave_tlm.3.cil.c-witness.graphml [2021-01-06 19:26:16,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:26:16,268 INFO L168 Benchmark]: Toolchain (without parser) took 207590.60 ms. Allocated memory was 157.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 132.2 MB in the beginning and 952.4 MB in the end (delta: -820.2 MB). Peak memory consumption was 704.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,269 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 157.3 MB. Free memory is still 131.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:26:16,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.45 ms. Allocated memory is still 157.3 MB. Free memory was 132.0 MB in the beginning and 111.4 MB in the end (delta: 20.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.13 ms. Allocated memory is still 157.3 MB. Free memory was 111.2 MB in the beginning and 107.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,270 INFO L168 Benchmark]: Boogie Preprocessor took 137.25 ms. Allocated memory is still 157.3 MB. Free memory was 107.9 MB in the beginning and 137.4 MB in the end (delta: -29.5 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,270 INFO L168 Benchmark]: RCFGBuilder took 1263.11 ms. Allocated memory is still 157.3 MB. Free memory was 136.9 MB in the beginning and 57.8 MB in the end (delta: 79.2 MB). Peak memory consumption was 78.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,271 INFO L168 Benchmark]: TraceAbstraction took 205187.91 ms. Allocated memory was 157.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 57.2 MB in the beginning and 982.8 MB in the end (delta: -925.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,271 INFO L168 Benchmark]: Witness Printer took 262.40 ms. Allocated memory is still 1.7 GB. Free memory was 982.8 MB in the beginning and 952.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:16,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 157.3 MB. Free memory is still 131.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 625.45 ms. Allocated memory is still 157.3 MB. Free memory was 132.0 MB in the beginning and 111.4 MB in the end (delta: 20.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 105.13 ms. Allocated memory is still 157.3 MB. Free memory was 111.2 MB in the beginning and 107.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 137.25 ms. Allocated memory is still 157.3 MB. Free memory was 107.9 MB in the beginning and 137.4 MB in the end (delta: -29.5 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1263.11 ms. Allocated memory is still 157.3 MB. Free memory was 136.9 MB in the beginning and 57.8 MB in the end (delta: 79.2 MB). Peak memory consumption was 78.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 205187.91 ms. Allocated memory was 157.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 57.2 MB in the beginning and 982.8 MB in the end (delta: -925.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. * Witness Printer took 262.40 ms. Allocated memory is still 1.7 GB. Free memory was 982.8 MB in the beginning and 952.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || (((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && a <= 1) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((!(s_run_st == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((((((51 <= req_d && 2 <= c_req_a) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 1) && req_d <= 52) && req_d <= 51) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && c_req_a <= 2) && c_req_type == 1) && !(req_type == 0)) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && 52 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((((((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || (((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_req_a) && v <= 52) && req_tt_a == 2) && req_a == 1) && 2 == req_a___0) && s_memory2 == 52) && i == 1) && 1 <= a_t) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_req_a) && v <= 52) && req_a == 1) && 2 == req_a___0) && s_memory2 == 52) && i == 1) && 1 <= a_t) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 1) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && a == 2) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((v <= 52 && s_memory2 == 52) && (((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 1 <= c_req_a) && a_t == 0) && ((((((((c_empty_rsp == 1 && a <= 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || ((((((((c_empty_rsp == 1 && a <= 1) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock))) && req_type == 0) || ((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 1 <= c_req_a) && req_tt_a == 1) && ((((((((c_empty_rsp == 1 && a <= 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || ((((((((c_empty_rsp == 1 && a <= 1) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock))) && req_type == 0))) && 52 <= v) && 1 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || ((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((v == req_d && s_memory1 == 51) && 0 <= a_t) && s_memory2 == 52) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock) - InvariantResult [Line: 812]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= c_req_d) || ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0)) || (((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 1192]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) - InvariantResult [Line: 497]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && req_tt_a == 1) && 2 <= req_a___0)) || (((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 52 <= c_req_d) - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 52 == x) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) || (((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && a_t == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && a == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && 3 <= a) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_d <= 52) && 52 <= c_req_d - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) || ((((((((((((2 == c_write_rsp_ev && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(2 == s_run_pc)) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || (((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 2) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 2 <= a) && c_req_d <= 51)) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && 3 <= a) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_d <= 52) && 52 <= c_req_d)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && a <= 1) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_d <= 50) && 1 <= a)) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 1200]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((51 <= req_d && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 1) && req_d <= 52) && req_d <= 51) && c_empty_req == 1) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 52 <= req_d) && c_req_d <= 51) || ((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && a <= 1) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a)) || (((((((((((((((((2 == c_write_rsp_ev && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && req_a == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && !(2 == s_run_pc)) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((!(c_req_type == 0) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 1 <= a_t) && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_req_a) && !(c_req_type == 0)) && c_req_a <= 2) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == c_write_rsp_ev && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || ((((((((((((((((((((((((51 <= req_d && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 52) && req_d <= 51) && c_empty_req == 1) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && a <= 1) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1043]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1169]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 462]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) - InvariantResult [Line: 1208]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_req_type == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a_t) && req_d <= 50) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_req_a) && 1 <= a_t) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && c_req_a == 0)) || (((((((((((c_empty_rsp == 1 && 50 <= c_req_d) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50) && a_t == 0) - InvariantResult [Line: 1238]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1216]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 913]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && 52 <= req_d) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && req_type == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_a <= 2) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && v <= 50) && 1 <= a_t) && 50 <= v) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && req_a == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && i == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1121]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((s_memory1 == 51 && v == req_d) && m_run_pc == 6) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory2 == req_d) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && a <= 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_req_a) && c_req_a <= 2) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && s_memory2 == 52) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && m_run_st == 0) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && req_a == 1) && s_memory2 == 52) && i == 1) && c_req_a <= 2) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || ((((((((((((v == req_d && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && a_t == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((v == req_d && s_memory1 == 51) && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && 52 <= req_d) && c_write_rsp_ev == 1) && 2 <= a_t) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 <= a_t) && 2 == s_run_pc) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 52 == x) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || (((((((((((((((v == req_d && 51 <= req_d) && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 <= c_req_d) && req_d <= 51) && a <= 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1067]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_write_rsp_ev == 1) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 1 <= req_a___0) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && 1 <= a) && req_a___0 <= 1) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) || (((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && req_tt_a == 1) && 2 <= req_a___0)) || (((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 52 <= c_req_d) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 0 == req_a___0) && req_a == 0) && 52 <= v) && i == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 1265]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 749]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 1) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && req_tt_a == 1) || ((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 921]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && 52 <= req_d) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && req_type == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_a <= 2) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && v <= 50) && 1 <= a_t) && 50 <= v) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && req_a == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && i == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((!(s_run_st == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && !(s_run_st == 0)) && 50 <= v) && 1 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && s_memory2 == 52) && !(s_run_st == 0)) && i == 1) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && a <= 1) && c_req_a <= 1) && s_memory0 == 50) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && !(s_run_st == 0)) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 929]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && 52 <= req_d) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && req_type == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_a <= 2) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && v <= 50) && 1 <= a_t) && 50 <= v) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && req_a == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && i == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 1) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((v <= 50 && !(s_run_st == 0)) && 50 <= v) && 1 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && s_memory2 == 52) && !(s_run_st == 0)) && i == 1) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && a <= 1) && c_req_a <= 1) && s_memory0 == 50) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && !(s_run_st == 0)) && c_req_a <= 2) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && c_empty_rsp == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= c_req_d)) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_rsp_d == 50) && a == 1) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) || (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50)) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((51 <= req_d && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 1) && req_d <= 52) && req_d <= 51) && c_empty_req == 1) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 52 <= req_d) && c_req_d <= 51) || ((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && a <= 1) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a)) || (((((((((((((((((2 == c_write_rsp_ev && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && req_a == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 52 == x) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) || ((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || ((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && 2 <= a_t) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_req == 1) && m_run_st == 0) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || (((((((((((((((((((((((((s_memory1 == 51 && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((!(s_run_st == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && a <= 1) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && a <= 1) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && v == req_d) && 0 <= a_t) && s_memory2 == 52) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0)) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((2 == c_write_rsp_ev && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || (((((((((((((((((((((((v == req_d && 51 <= req_d) && req_a <= 2) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && req_type == 1) && req_d <= 52) && c_empty_rsp == 1) && req_d <= 51) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && c_req_d <= 51)) || (((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a)) || (((((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((51 <= req_d && 2 <= c_req_a) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 52) && req_d <= 51) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && c_req_a <= 2) && c_req_type == 1) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && 52 <= c_req_d) || (((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((c_req_type == 1 && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((51 <= req_d && 2 <= c_req_a) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 52) && req_d <= 51) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && c_req_a <= 2) && c_req_type == 1) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && 52 <= c_req_d) || (((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((c_req_type == 1 && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 831]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || (((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1))) || (((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1)) || (((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1)) && 6 <= m_run_pc) - InvariantResult [Line: 1281]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 937]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && 52 <= req_d) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && req_type == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_a <= 2) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && v <= 50) && 1 <= a_t) && 50 <= v) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && req_a == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && i == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 3 <= a) && !(c_m_lock == 1)) && 6 <= m_run_pc) || (((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 3 <= a) && !(c_m_lock == 1))) || (((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && req_tt_a == 1)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && s_memory2 == 52) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 52 <= c_req_d)) || (((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || (((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && a <= 1) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((!(s_run_st == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((((((51 <= req_d && 2 <= c_req_a) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 1) && req_d <= 52) && req_d <= 51) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && c_req_a <= 2) && c_req_type == 1) && !(req_type == 0)) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && 52 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 967]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && a_t == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && 52 <= req_d) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && req_type == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_a <= 2) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && v <= 50) && 1 <= a_t) && 50 <= v) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 945]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && 52 <= req_d) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && req_type == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_a <= 2) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && v <= 50) && 1 <= a_t) && 50 <= v) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && req_a == 1) && s_memory2 == 52) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && i == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 2 == req_a) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1353]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 590]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && v == req_d) && 0 <= a_t) && s_memory2 == 52) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0)) || ((((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && x == 50) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d) || ((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: ((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 1 <= c_m_lock - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && 2 <= c_req_a) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && req_a___0 <= 2) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && c_req_a <= 2) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && a <= 2) && s_memory0 == 50) && 51 == c_rsp_d) && 2 <= a) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) && 2 <= req_a___0) || (((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && a == 1) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || ((((((((((((((((s_memory1 == 51 && v == req_d) && 0 <= a_t) && s_memory2 == 52) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) - InvariantResult [Line: 1289]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) - InvariantResult [Line: 1319]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 2 <= c_write_req_ev) && 2 <= a)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 1 <= c_m_lock) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && req_a == 1) && s_memory2 == 52) && i == 1) && c_req_a <= 2) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= c_req_a) && a_t == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((s_memory1 == 51 && v == req_d) && m_run_pc == 6) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && s_memory2 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1297]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && !(c_m_lock == 1)) && req_type == 0) && rsp_d___0 == 52) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && req_tt_a == 1) - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && 52 == \result) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && rsp_d___0 == 52) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_a___0 + 50 == rsp_d___0) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock) || ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && req_a == 1) && i == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 52 <= v) && i == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 1184]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_write_req_ev) && a_t <= 1) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_write_req_ev) && 2 <= a) && req_d <= 52) && 52 <= c_req_d) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || (((((((((((((((((((((((v == req_d && 1 <= req_a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && a <= 1) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((!(s_run_st == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((((((51 <= req_d && 2 <= c_req_a) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && req_type == 1) && req_d <= 52) && req_d <= 51) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && v == req_d) && req_a <= 2) && 1 <= a_t) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && c_req_a <= 2) && c_req_type == 1) && !(req_type == 0)) && 2 <= req_a) && a <= 2) && s_memory0 == 50) && a_t <= 1) && 2 <= a) && 1 <= c_m_lock) && 52 <= req_d) && 52 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 1121]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && m_run_pc == 6) && s_memory2 == 52) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_memory2 == req_d) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && a <= 1) && s_memory1 == req_d) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || (((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_req_a) && c_req_a <= 2) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && s_memory1 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && 52 <= c_req_d)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((((s_memory1 == 51 && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && 6 <= m_run_pc) && 52 == \result) && c_req_type == 0) && 52 == rsp_d) && c_empty_req == 1) && 52 == c_rsp_d) && 52 <= v) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a <= 2) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && i == 2) && 2 == req_a) && 52 == x) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && a <= 1) && c_req_a <= 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && req_a___0 == 1) && s_memory2 == 52) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 1) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((((((((((v == req_d && s_memory1 == 51) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_req == 1) && m_run_st == 0) && s_memory2 == req_d) && s_memory0 == 50) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && v <= 52) && 2 <= c_req_a) && req_tt_a == 2) && 2 == req_a___0) && req_a == 1) && s_memory2 == 52) && i == 1) && c_req_a <= 2) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= a_t) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 52 <= v) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock)) || ((((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && 52 <= v) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock)) || (((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 52 <= v) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && v <= 52) && s_memory2 == 52) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && a_t <= 1) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v == req_d && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && a_t <= 1) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) || ((((((((((((((((((s_memory1 == 51 && v == req_d) && 52 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= a_t) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && s_memory2 == req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && 1 <= c_m_lock) && req_d <= 52) && 52 <= c_req_d)) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 274 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 52.8s, OverallIterations: 31, TraceHistogramMax: 12, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 151.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19180 SDtfs, 34798 SDslu, 76976 SDs, 0 SdLazy, 7855 SolverSat, 920 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4523 GetRequests, 4098 SyntacticMatches, 15 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3869 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7525occurred 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: 7.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 66679 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 685 NumberOfFragments, 25977 HoareAnnotationTreeSize, 98 FomulaSimplifications, 4418620602 FormulaSimplificationTreeSizeReduction, 22.7s HoareSimplificationTime, 98 FomulaSimplificationsInter, 176354679 FormulaSimplificationTreeSizeReductionInter, 128.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 10309 NumberOfCodeBlocks, 10309 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 10266 ConstructedInterpolants, 0 QuantifiedInterpolants, 13923852 SizeOfPredicates, 96 NumberOfNonLiveVariables, 11777 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 43 InterpolantComputations, 24 PerfectInterpolantSequences, 6404/11006 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...