./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e2877807aa4495b85046b7dde4548c35f2172f1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:46:22,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:46:22,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:46:22,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:46:22,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:46:22,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:46:22,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:46:22,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:46:22,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:46:22,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:46:22,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:46:22,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:46:22,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:46:22,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:46:22,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:46:22,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:46:22,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:46:22,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:46:22,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:46:22,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:46:22,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:46:22,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:46:22,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:46:22,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:46:22,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:46:22,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:46:22,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:46:22,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:46:22,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:46:22,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:46:22,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:46:22,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:46:22,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:46:22,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:46:22,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:46:22,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:46:22,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:46:22,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:46:22,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:46:22,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:46:22,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:46:22,190 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:46:22,246 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:46:22,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:46:22,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:46:22,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:46:22,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:46:22,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:46:22,263 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:46:22,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:46:22,263 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:46:22,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:46:22,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:46:22,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:46:22,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:46:22,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:46:22,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:46:22,266 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:46:22,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:46:22,267 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:46:22,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:46:22,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:46:22,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:46:22,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:46:22,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:46:22,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:46:22,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:46:22,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:46:22,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:46:22,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:46:22,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:46:22,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:46:22,274 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e2877807aa4495b85046b7dde4548c35f2172f1 [2021-10-13 00:46:22,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:46:22,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:46:22,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:46:22,612 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:46:22,615 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:46:22,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-10-13 00:46:22,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/data/bfaba1297/7a55eb4019244d8f97c0d261ab7566e7/FLAG06ed55f02 [2021-10-13 00:46:23,337 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:46:23,338 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-10-13 00:46:23,357 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/data/bfaba1297/7a55eb4019244d8f97c0d261ab7566e7/FLAG06ed55f02 [2021-10-13 00:46:23,638 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/data/bfaba1297/7a55eb4019244d8f97c0d261ab7566e7 [2021-10-13 00:46:23,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:46:23,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:46:23,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:46:23,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:46:23,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:46:23,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:23" (1/1) ... [2021-10-13 00:46:23,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f24f684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:23, skipping insertion in model container [2021-10-13 00:46:23,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:23" (1/1) ... [2021-10-13 00:46:23,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:46:23,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:46:23,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-10-13 00:46:24,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:46:24,080 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:46:24,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-10-13 00:46:24,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:46:24,189 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:46:24,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24 WrapperNode [2021-10-13 00:46:24,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:46:24,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:46:24,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:46:24,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:46:24,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:46:24,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:46:24,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:46:24,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:46:24,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:46:24,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:46:24,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:46:24,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:46:24,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (1/1) ... [2021-10-13 00:46:24,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:46:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:24,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:46:24,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:46:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:46:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:46:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:46:24,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:46:25,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:46:25,597 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-10-13 00:46:25,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:25 BoogieIcfgContainer [2021-10-13 00:46:25,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:46:25,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:46:25,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:46:25,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:46:25,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:46:23" (1/3) ... [2021-10-13 00:46:25,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b062742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:25, skipping insertion in model container [2021-10-13 00:46:25,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:24" (2/3) ... [2021-10-13 00:46:25,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b062742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:25, skipping insertion in model container [2021-10-13 00:46:25,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:25" (3/3) ... [2021-10-13 00:46:25,612 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2021-10-13 00:46:25,619 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:46:25,620 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-10-13 00:46:25,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:46:25,688 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 00:46:25,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 00:46:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 268 states have (on average 1.8656716417910448) internal successors, (500), 273 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 00:46:25,730 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:25,731 INFO L512 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-10-13 00:46:25,732 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-10-13 00:46:25,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:25,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78260483] [2021-10-13 00:46:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:25,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:25,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:25,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78260483] [2021-10-13 00:46:25,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78260483] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:25,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:25,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:26,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424855623] [2021-10-13 00:46:26,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:26,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:26,060 INFO L87 Difference]: Start difference. First operand has 274 states, 268 states have (on average 1.8656716417910448) internal successors, (500), 273 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:26,582 INFO L93 Difference]: Finished difference Result 725 states and 1316 transitions. [2021-10-13 00:46:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 00:46:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:26,616 INFO L225 Difference]: With dead ends: 725 [2021-10-13 00:46:26,617 INFO L226 Difference]: Without dead ends: 448 [2021-10-13 00:46:26,626 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-13 00:46:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 432. [2021-10-13 00:46:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 427 states have (on average 1.5971896955503513) internal successors, (682), 431 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 682 transitions. [2021-10-13 00:46:26,752 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 682 transitions. Word has length 28 [2021-10-13 00:46:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:26,754 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 682 transitions. [2021-10-13 00:46:26,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 682 transitions. [2021-10-13 00:46:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:46:26,766 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:26,766 INFO L512 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-10-13 00:46:26,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:46:26,767 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2021-10-13 00:46:26,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:26,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217165939] [2021-10-13 00:46:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:26,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:26,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:26,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217165939] [2021-10-13 00:46:26,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217165939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:26,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:26,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:26,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333131420] [2021-10-13 00:46:26,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:26,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:26,924 INFO L87 Difference]: Start difference. First operand 432 states and 682 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:27,109 INFO L93 Difference]: Finished difference Result 1135 states and 1815 transitions. [2021-10-13 00:46:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:27,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-13 00:46:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:27,116 INFO L225 Difference]: With dead ends: 1135 [2021-10-13 00:46:27,117 INFO L226 Difference]: Without dead ends: 717 [2021-10-13 00:46:27,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-10-13 00:46:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 701. [2021-10-13 00:46:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 696 states have (on average 1.6336206896551724) internal successors, (1137), 700 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1137 transitions. [2021-10-13 00:46:27,170 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1137 transitions. Word has length 38 [2021-10-13 00:46:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:27,171 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1137 transitions. [2021-10-13 00:46:27,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1137 transitions. [2021-10-13 00:46:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 00:46:27,174 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:27,174 INFO L512 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-10-13 00:46:27,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:46:27,176 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2021-10-13 00:46:27,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:27,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110371236] [2021-10-13 00:46:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:27,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:27,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:27,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110371236] [2021-10-13 00:46:27,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110371236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:27,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:27,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:27,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096956189] [2021-10-13 00:46:27,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:27,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:27,320 INFO L87 Difference]: Start difference. First operand 701 states and 1137 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:27,400 INFO L93 Difference]: Finished difference Result 1763 states and 2860 transitions. [2021-10-13 00:46:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:27,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 00:46:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:27,418 INFO L225 Difference]: With dead ends: 1763 [2021-10-13 00:46:27,418 INFO L226 Difference]: Without dead ends: 1087 [2021-10-13 00:46:27,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-10-13 00:46:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1075. [2021-10-13 00:46:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1070 states have (on average 1.6261682242990654) internal successors, (1740), 1074 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1740 transitions. [2021-10-13 00:46:27,474 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1740 transitions. Word has length 39 [2021-10-13 00:46:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:27,475 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 1740 transitions. [2021-10-13 00:46:27,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1740 transitions. [2021-10-13 00:46:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 00:46:27,481 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:27,481 INFO L512 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-10-13 00:46:27,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:46:27,482 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2021-10-13 00:46:27,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:27,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650793579] [2021-10-13 00:46:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:27,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:27,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:27,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650793579] [2021-10-13 00:46:27,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650793579] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:27,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:27,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:46:27,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82325528] [2021-10-13 00:46:27,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:46:27,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:46:27,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:27,616 INFO L87 Difference]: Start difference. First operand 1075 states and 1740 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:28,078 INFO L93 Difference]: Finished difference Result 2957 states and 4769 transitions. [2021-10-13 00:46:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:46:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-13 00:46:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:28,094 INFO L225 Difference]: With dead ends: 2957 [2021-10-13 00:46:28,094 INFO L226 Difference]: Without dead ends: 1907 [2021-10-13 00:46:28,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2021-10-13 00:46:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1677. [2021-10-13 00:46:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1672 states have (on average 1.6028708133971292) internal successors, (2680), 1676 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2680 transitions. [2021-10-13 00:46:28,197 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2680 transitions. Word has length 46 [2021-10-13 00:46:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:28,198 INFO L470 AbstractCegarLoop]: Abstraction has 1677 states and 2680 transitions. [2021-10-13 00:46:28,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2680 transitions. [2021-10-13 00:46:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 00:46:28,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:28,200 INFO L512 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-10-13 00:46:28,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:46:28,202 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-10-13 00:46:28,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:28,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159041182] [2021-10-13 00:46:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:28,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:28,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:28,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159041182] [2021-10-13 00:46:28,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159041182] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:28,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:28,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:46:28,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307752331] [2021-10-13 00:46:28,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:46:28,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:46:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:28,268 INFO L87 Difference]: Start difference. First operand 1677 states and 2680 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:28,823 INFO L93 Difference]: Finished difference Result 4989 states and 7868 transitions. [2021-10-13 00:46:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:46:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 00:46:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:28,847 INFO L225 Difference]: With dead ends: 4989 [2021-10-13 00:46:28,847 INFO L226 Difference]: Without dead ends: 3331 [2021-10-13 00:46:28,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2021-10-13 00:46:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2953. [2021-10-13 00:46:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2948 states have (on average 1.5763229308005426) internal successors, (4647), 2952 states have internal predecessors, (4647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4647 transitions. [2021-10-13 00:46:29,008 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4647 transitions. Word has length 52 [2021-10-13 00:46:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:29,009 INFO L470 AbstractCegarLoop]: Abstraction has 2953 states and 4647 transitions. [2021-10-13 00:46:29,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4647 transitions. [2021-10-13 00:46:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 00:46:29,011 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:29,011 INFO L512 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-10-13 00:46:29,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:46:29,012 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-10-13 00:46:29,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:29,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800746668] [2021-10-13 00:46:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:29,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:29,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:29,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800746668] [2021-10-13 00:46:29,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800746668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:29,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:29,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:29,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722466955] [2021-10-13 00:46:29,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:29,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:29,059 INFO L87 Difference]: Start difference. First operand 2953 states and 4647 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:29,285 INFO L93 Difference]: Finished difference Result 6943 states and 10882 transitions. [2021-10-13 00:46:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 00:46:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:29,314 INFO L225 Difference]: With dead ends: 6943 [2021-10-13 00:46:29,315 INFO L226 Difference]: Without dead ends: 4013 [2021-10-13 00:46:29,321 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2021-10-13 00:46:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3829. [2021-10-13 00:46:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3829 states, 3824 states have (on average 1.5557008368200838) internal successors, (5949), 3828 states have internal predecessors, (5949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 5949 transitions. [2021-10-13 00:46:29,565 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 5949 transitions. Word has length 52 [2021-10-13 00:46:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:29,565 INFO L470 AbstractCegarLoop]: Abstraction has 3829 states and 5949 transitions. [2021-10-13 00:46:29,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 5949 transitions. [2021-10-13 00:46:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 00:46:29,568 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:29,569 INFO L512 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-10-13 00:46:29,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:46:29,569 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1900061236, now seen corresponding path program 1 times [2021-10-13 00:46:29,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:29,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572028130] [2021-10-13 00:46:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:29,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:29,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:29,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572028130] [2021-10-13 00:46:29,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572028130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:29,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:29,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:29,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633209858] [2021-10-13 00:46:29,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:29,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:29,619 INFO L87 Difference]: Start difference. First operand 3829 states and 5949 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:30,180 INFO L93 Difference]: Finished difference Result 9203 states and 14417 transitions. [2021-10-13 00:46:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:30,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-13 00:46:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:30,217 INFO L225 Difference]: With dead ends: 9203 [2021-10-13 00:46:30,217 INFO L226 Difference]: Without dead ends: 5397 [2021-10-13 00:46:30,225 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2021-10-13 00:46:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 4635. [2021-10-13 00:46:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4635 states, 4630 states have (on average 1.498488120950324) internal successors, (6938), 4634 states have internal predecessors, (6938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 6938 transitions. [2021-10-13 00:46:30,537 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 6938 transitions. Word has length 58 [2021-10-13 00:46:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:30,538 INFO L470 AbstractCegarLoop]: Abstraction has 4635 states and 6938 transitions. [2021-10-13 00:46:30,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 6938 transitions. [2021-10-13 00:46:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 00:46:30,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:30,542 INFO L512 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-10-13 00:46:30,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:46:30,543 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2021-10-13 00:46:30,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:30,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498300696] [2021-10-13 00:46:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:30,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:30,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:30,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498300696] [2021-10-13 00:46:30,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498300696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:30,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:30,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:30,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582554235] [2021-10-13 00:46:30,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:30,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:30,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:30,594 INFO L87 Difference]: Start difference. First operand 4635 states and 6938 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:30,902 INFO L93 Difference]: Finished difference Result 9113 states and 13653 transitions. [2021-10-13 00:46:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:30,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-13 00:46:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:30,933 INFO L225 Difference]: With dead ends: 9113 [2021-10-13 00:46:30,934 INFO L226 Difference]: Without dead ends: 4501 [2021-10-13 00:46:30,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-10-13 00:46:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4501. [2021-10-13 00:46:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4501 states, 4496 states have (on average 1.4762010676156583) internal successors, (6637), 4500 states have internal predecessors, (6637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6637 transitions. [2021-10-13 00:46:31,187 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6637 transitions. Word has length 60 [2021-10-13 00:46:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:31,188 INFO L470 AbstractCegarLoop]: Abstraction has 4501 states and 6637 transitions. [2021-10-13 00:46:31,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6637 transitions. [2021-10-13 00:46:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 00:46:31,192 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:31,192 INFO L512 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-10-13 00:46:31,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:46:31,192 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash -468089154, now seen corresponding path program 1 times [2021-10-13 00:46:31,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:31,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672543608] [2021-10-13 00:46:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:31,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:31,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:31,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672543608] [2021-10-13 00:46:31,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672543608] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:31,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:31,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:31,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875784195] [2021-10-13 00:46:31,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:31,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:31,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:31,233 INFO L87 Difference]: Start difference. First operand 4501 states and 6637 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:31,540 INFO L93 Difference]: Finished difference Result 9649 states and 14392 transitions. [2021-10-13 00:46:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:31,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 00:46:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:31,575 INFO L225 Difference]: With dead ends: 9649 [2021-10-13 00:46:31,575 INFO L226 Difference]: Without dead ends: 5171 [2021-10-13 00:46:31,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5171 states. [2021-10-13 00:46:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5171 to 3471. [2021-10-13 00:46:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3466 states have (on average 1.493075591459896) internal successors, (5175), 3470 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5175 transitions. [2021-10-13 00:46:31,853 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 5175 transitions. Word has length 61 [2021-10-13 00:46:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:31,854 INFO L470 AbstractCegarLoop]: Abstraction has 3471 states and 5175 transitions. [2021-10-13 00:46:31,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 5175 transitions. [2021-10-13 00:46:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 00:46:31,856 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:31,857 INFO L512 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-10-13 00:46:31,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:46:31,857 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2021-10-13 00:46:31,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:31,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936687063] [2021-10-13 00:46:31,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:31,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:31,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:31,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936687063] [2021-10-13 00:46:31,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936687063] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:31,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:31,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:46:31,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104980951] [2021-10-13 00:46:31,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:46:31,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:31,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:46:31,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:31,924 INFO L87 Difference]: Start difference. First operand 3471 states and 5175 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:33,360 INFO L93 Difference]: Finished difference Result 16445 states and 24335 transitions. [2021-10-13 00:46:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:46:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-13 00:46:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:33,426 INFO L225 Difference]: With dead ends: 16445 [2021-10-13 00:46:33,426 INFO L226 Difference]: Without dead ends: 13193 [2021-10-13 00:46:33,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 97.8ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-13 00:46:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13193 states. [2021-10-13 00:46:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13193 to 4337. [2021-10-13 00:46:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 4332 states have (on average 1.4849953831948293) internal successors, (6433), 4336 states have internal predecessors, (6433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 6433 transitions. [2021-10-13 00:46:33,883 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 6433 transitions. Word has length 63 [2021-10-13 00:46:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:33,883 INFO L470 AbstractCegarLoop]: Abstraction has 4337 states and 6433 transitions. [2021-10-13 00:46:33,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 6433 transitions. [2021-10-13 00:46:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 00:46:33,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:33,886 INFO L512 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-10-13 00:46:33,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:46:33,887 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2021-10-13 00:46:33,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:33,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060060395] [2021-10-13 00:46:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:33,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:33,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:33,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060060395] [2021-10-13 00:46:33,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060060395] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:33,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:33,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:46:33,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399718192] [2021-10-13 00:46:33,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:46:33,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:46:34,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:46:34,000 INFO L87 Difference]: Start difference. First operand 4337 states and 6433 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:36,246 INFO L93 Difference]: Finished difference Result 29901 states and 44086 transitions. [2021-10-13 00:46:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-13 00:46:36,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-13 00:46:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:36,339 INFO L225 Difference]: With dead ends: 29901 [2021-10-13 00:46:36,339 INFO L226 Difference]: Without dead ends: 25783 [2021-10-13 00:46:36,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 202.1ms TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-10-13 00:46:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25783 states. [2021-10-13 00:46:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25783 to 4645. [2021-10-13 00:46:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4645 states, 4640 states have (on average 1.4747844827586207) internal successors, (6843), 4644 states have internal predecessors, (6843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 6843 transitions. [2021-10-13 00:46:36,984 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 6843 transitions. Word has length 64 [2021-10-13 00:46:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:36,985 INFO L470 AbstractCegarLoop]: Abstraction has 4645 states and 6843 transitions. [2021-10-13 00:46:36,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 6843 transitions. [2021-10-13 00:46:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-13 00:46:36,995 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:36,995 INFO L512 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-10-13 00:46:36,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:46:36,996 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -642302294, now seen corresponding path program 1 times [2021-10-13 00:46:36,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:36,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132021372] [2021-10-13 00:46:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:36,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:37,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:37,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132021372] [2021-10-13 00:46:37,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132021372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:37,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:37,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:37,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557857877] [2021-10-13 00:46:37,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:37,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:37,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:37,040 INFO L87 Difference]: Start difference. First operand 4645 states and 6843 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:37,409 INFO L93 Difference]: Finished difference Result 9788 states and 14388 transitions. [2021-10-13 00:46:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-10-13 00:46:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:37,424 INFO L225 Difference]: With dead ends: 9788 [2021-10-13 00:46:37,424 INFO L226 Difference]: Without dead ends: 5164 [2021-10-13 00:46:37,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2021-10-13 00:46:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5090. [2021-10-13 00:46:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5090 states, 5085 states have (on average 1.4694198623402164) internal successors, (7472), 5089 states have internal predecessors, (7472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 7472 transitions. [2021-10-13 00:46:37,873 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 7472 transitions. Word has length 77 [2021-10-13 00:46:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:37,873 INFO L470 AbstractCegarLoop]: Abstraction has 5090 states and 7472 transitions. [2021-10-13 00:46:37,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 7472 transitions. [2021-10-13 00:46:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 00:46:37,877 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:37,877 INFO L512 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-10-13 00:46:37,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:46:37,878 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:37,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2021-10-13 00:46:37,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:37,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205602389] [2021-10-13 00:46:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:37,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:37,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:37,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205602389] [2021-10-13 00:46:37,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205602389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:37,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:37,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:46:37,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64359287] [2021-10-13 00:46:37,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:46:37,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:46:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:37,923 INFO L87 Difference]: Start difference. First operand 5090 states and 7472 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:38,738 INFO L93 Difference]: Finished difference Result 13614 states and 19820 transitions. [2021-10-13 00:46:38,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:46:38,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-13 00:46:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:38,759 INFO L225 Difference]: With dead ends: 13614 [2021-10-13 00:46:38,759 INFO L226 Difference]: Without dead ends: 8424 [2021-10-13 00:46:38,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2021-10-13 00:46:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 7525. [2021-10-13 00:46:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7525 states, 7520 states have (on average 1.4404255319148935) internal successors, (10832), 7524 states have internal predecessors, (10832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 10832 transitions. [2021-10-13 00:46:39,243 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 10832 transitions. Word has length 88 [2021-10-13 00:46:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:39,244 INFO L470 AbstractCegarLoop]: Abstraction has 7525 states and 10832 transitions. [2021-10-13 00:46:39,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 10832 transitions. [2021-10-13 00:46:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 00:46:39,248 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:39,248 INFO L512 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-10-13 00:46:39,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:46:39,249 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:39,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:39,249 INFO L82 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2021-10-13 00:46:39,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:39,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702612868] [2021-10-13 00:46:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:39,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:39,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:39,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702612868] [2021-10-13 00:46:39,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702612868] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:39,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:39,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:39,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681630604] [2021-10-13 00:46:39,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:39,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:39,297 INFO L87 Difference]: Start difference. First operand 7525 states and 10832 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:39,667 INFO L93 Difference]: Finished difference Result 10856 states and 15661 transitions. [2021-10-13 00:46:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-13 00:46:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:39,677 INFO L225 Difference]: With dead ends: 10856 [2021-10-13 00:46:39,677 INFO L226 Difference]: Without dead ends: 3339 [2021-10-13 00:46:39,686 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-10-13 00:46:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3286. [2021-10-13 00:46:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 3281 states have (on average 1.3511124657116733) internal successors, (4433), 3285 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4433 transitions. [2021-10-13 00:46:40,009 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4433 transitions. Word has length 95 [2021-10-13 00:46:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:40,010 INFO L470 AbstractCegarLoop]: Abstraction has 3286 states and 4433 transitions. [2021-10-13 00:46:40,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4433 transitions. [2021-10-13 00:46:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-10-13 00:46:40,012 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:40,013 INFO L512 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-10-13 00:46:40,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:46:40,013 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:40,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1416682179, now seen corresponding path program 1 times [2021-10-13 00:46:40,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:40,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164568053] [2021-10-13 00:46:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:40,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:40,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:40,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164568053] [2021-10-13 00:46:40,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164568053] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:40,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:40,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:46:40,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276762599] [2021-10-13 00:46:40,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:46:40,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:46:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:40,079 INFO L87 Difference]: Start difference. First operand 3286 states and 4433 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:40,958 INFO L93 Difference]: Finished difference Result 12537 states and 16915 transitions. [2021-10-13 00:46:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:46:40,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-10-13 00:46:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:40,982 INFO L225 Difference]: With dead ends: 12537 [2021-10-13 00:46:40,982 INFO L226 Difference]: Without dead ends: 9425 [2021-10-13 00:46:40,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:46:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9425 states. [2021-10-13 00:46:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9425 to 3288. [2021-10-13 00:46:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3283 states have (on average 1.349070971672251) internal successors, (4429), 3287 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4429 transitions. [2021-10-13 00:46:41,394 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4429 transitions. Word has length 98 [2021-10-13 00:46:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:41,394 INFO L470 AbstractCegarLoop]: Abstraction has 3288 states and 4429 transitions. [2021-10-13 00:46:41,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4429 transitions. [2021-10-13 00:46:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:46:41,397 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:41,397 INFO L512 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-10-13 00:46:41,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:46:41,398 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1620290344, now seen corresponding path program 1 times [2021-10-13 00:46:41,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:41,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657856070] [2021-10-13 00:46:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:41,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:41,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:41,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657856070] [2021-10-13 00:46:41,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657856070] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:41,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243005762] [2021-10-13 00:46:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:41,463 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:41,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:46:41,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:46:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:41,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:46:41,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:46:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:46:42,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243005762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:42,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:46:42,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-10-13 00:46:42,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749845476] [2021-10-13 00:46:42,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:42,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:42,046 INFO L87 Difference]: Start difference. First operand 3288 states and 4429 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:42,381 INFO L93 Difference]: Finished difference Result 3923 states and 5276 transitions. [2021-10-13 00:46:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 00:46:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:42,388 INFO L225 Difference]: With dead ends: 3923 [2021-10-13 00:46:42,388 INFO L226 Difference]: Without dead ends: 3919 [2021-10-13 00:46:42,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2021-10-13 00:46:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3869. [2021-10-13 00:46:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3869 states, 3864 states have (on average 1.3457556935817805) internal successors, (5200), 3868 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 5200 transitions. [2021-10-13 00:46:42,732 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 5200 transitions. Word has length 100 [2021-10-13 00:46:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:42,732 INFO L470 AbstractCegarLoop]: Abstraction has 3869 states and 5200 transitions. [2021-10-13 00:46:42,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 5200 transitions. [2021-10-13 00:46:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-10-13 00:46:42,737 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:42,737 INFO L512 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-10-13 00:46:42,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:46:42,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:42,965 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:42,965 INFO L82 PathProgramCache]: Analyzing trace with hash -576078609, now seen corresponding path program 1 times [2021-10-13 00:46:42,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:42,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551168465] [2021-10-13 00:46:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:42,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:46:43,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:43,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551168465] [2021-10-13 00:46:43,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551168465] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:43,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402673506] [2021-10-13 00:46:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:43,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:43,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:43,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:46:43,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:46:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:43,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:46:43,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:46:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:46:43,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402673506] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:43,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:46:43,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-10-13 00:46:43,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678426747] [2021-10-13 00:46:43,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:43,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:43,769 INFO L87 Difference]: Start difference. First operand 3869 states and 5200 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:44,102 INFO L93 Difference]: Finished difference Result 6887 states and 9305 transitions. [2021-10-13 00:46:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:44,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-10-13 00:46:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:44,108 INFO L225 Difference]: With dead ends: 6887 [2021-10-13 00:46:44,108 INFO L226 Difference]: Without dead ends: 3027 [2021-10-13 00:46:44,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2021-10-13 00:46:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2806. [2021-10-13 00:46:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2801 states have (on average 1.3252409853623706) internal successors, (3712), 2805 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3712 transitions. [2021-10-13 00:46:44,388 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3712 transitions. Word has length 154 [2021-10-13 00:46:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:44,389 INFO L470 AbstractCegarLoop]: Abstraction has 2806 states and 3712 transitions. [2021-10-13 00:46:44,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3712 transitions. [2021-10-13 00:46:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-13 00:46:44,393 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:44,393 INFO L512 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-10-13 00:46:44,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:46:44,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 00:46:44,609 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1529302704, now seen corresponding path program 1 times [2021-10-13 00:46:44,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:44,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974574709] [2021-10-13 00:46:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:44,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:46:44,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:44,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974574709] [2021-10-13 00:46:44,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974574709] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:44,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057202286] [2021-10-13 00:46:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:44,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:44,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:46:44,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:46:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:44,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:46:45,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:46:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 00:46:45,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057202286] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:45,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:46:45,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-10-13 00:46:45,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238468965] [2021-10-13 00:46:45,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:45,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:45,465 INFO L87 Difference]: Start difference. First operand 2806 states and 3712 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:45,769 INFO L93 Difference]: Finished difference Result 5443 states and 7240 transitions. [2021-10-13 00:46:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-10-13 00:46:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:45,778 INFO L225 Difference]: With dead ends: 5443 [2021-10-13 00:46:45,778 INFO L226 Difference]: Without dead ends: 2806 [2021-10-13 00:46:45,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-10-13 00:46:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2806. [2021-10-13 00:46:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2801 states have (on average 1.2909675116029988) internal successors, (3616), 2805 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3616 transitions. [2021-10-13 00:46:46,051 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3616 transitions. Word has length 157 [2021-10-13 00:46:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:46,052 INFO L470 AbstractCegarLoop]: Abstraction has 2806 states and 3616 transitions. [2021-10-13 00:46:46,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3616 transitions. [2021-10-13 00:46:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-13 00:46:46,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:46,056 INFO L512 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-10-13 00:46:46,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:46:46,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 00:46:46,269 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:46,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1270598443, now seen corresponding path program 1 times [2021-10-13 00:46:46,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:46,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983933531] [2021-10-13 00:46:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:46,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:46:46,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:46,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983933531] [2021-10-13 00:46:46,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983933531] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:46,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696676600] [2021-10-13 00:46:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:46,337 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:46,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:46,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:46:46,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 00:46:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:46,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:46:46,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:46:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 00:46:47,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696676600] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:47,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:46:47,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-10-13 00:46:47,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300406388] [2021-10-13 00:46:47,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:47,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:47,115 INFO L87 Difference]: Start difference. First operand 2806 states and 3616 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:47,669 INFO L93 Difference]: Finished difference Result 6342 states and 8333 transitions. [2021-10-13 00:46:47,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2021-10-13 00:46:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:47,675 INFO L225 Difference]: With dead ends: 6342 [2021-10-13 00:46:47,675 INFO L226 Difference]: Without dead ends: 3705 [2021-10-13 00:46:47,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2021-10-13 00:46:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3614. [2021-10-13 00:46:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3609 states have (on average 1.259351620947631) internal successors, (4545), 3613 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4545 transitions. [2021-10-13 00:46:48,027 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4545 transitions. Word has length 158 [2021-10-13 00:46:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:48,028 INFO L470 AbstractCegarLoop]: Abstraction has 3614 states and 4545 transitions. [2021-10-13 00:46:48,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4545 transitions. [2021-10-13 00:46:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-13 00:46:48,032 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:48,032 INFO L512 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-10-13 00:46:48,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:46:48,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:48,257 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2021-10-13 00:46:48,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:48,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997298864] [2021-10-13 00:46:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:48,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:46:48,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:48,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997298864] [2021-10-13 00:46:48,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997298864] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:48,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535795712] [2021-10-13 00:46:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:48,483 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:48,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:46:48,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 00:46:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:48,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 00:46:48,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:46:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:46:49,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535795712] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:49,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:46:49,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-10-13 00:46:49,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975752701] [2021-10-13 00:46:49,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:46:49,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:46:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:46:49,481 INFO L87 Difference]: Start difference. First operand 3614 states and 4545 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:51,513 INFO L93 Difference]: Finished difference Result 18152 states and 22925 transitions. [2021-10-13 00:46:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-13 00:46:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-10-13 00:46:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:51,534 INFO L225 Difference]: With dead ends: 18152 [2021-10-13 00:46:51,534 INFO L226 Difference]: Without dead ends: 14707 [2021-10-13 00:46:51,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 265.5ms TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 00:46:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14707 states. [2021-10-13 00:46:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14707 to 5121. [2021-10-13 00:46:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5121 states, 5116 states have (on average 1.2642689601250978) internal successors, (6468), 5120 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 6468 transitions. [2021-10-13 00:46:52,371 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 6468 transitions. Word has length 160 [2021-10-13 00:46:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:52,372 INFO L470 AbstractCegarLoop]: Abstraction has 5121 states and 6468 transitions. [2021-10-13 00:46:52,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 6468 transitions. [2021-10-13 00:46:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-10-13 00:46:52,381 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:52,382 INFO L512 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-10-13 00:46:52,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:46:52,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:52,597 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2021-10-13 00:46:52,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:52,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450412148] [2021-10-13 00:46:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:52,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 189 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 00:46:52,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:52,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450412148] [2021-10-13 00:46:52,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450412148] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:52,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529961626] [2021-10-13 00:46:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:52,890 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:46:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:52,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:46:52,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 00:46:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:53,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-13 00:46:53,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:46:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 00:46:54,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529961626] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:46:54,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:46:54,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2021-10-13 00:46:54,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639862257] [2021-10-13 00:46:54,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 00:46:54,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 00:46:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:46:54,465 INFO L87 Difference]: Start difference. First operand 5121 states and 6468 transitions. Second operand has 14 states, 14 states have (on average 25.142857142857142) internal successors, (352), 14 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:57,514 INFO L93 Difference]: Finished difference Result 24658 states and 31106 transitions. [2021-10-13 00:46:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-10-13 00:46:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 25.142857142857142) internal successors, (352), 14 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2021-10-13 00:46:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:57,547 INFO L225 Difference]: With dead ends: 24658 [2021-10-13 00:46:57,547 INFO L226 Difference]: Without dead ends: 19706 [2021-10-13 00:46:57,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 662.5ms TimeCoverageRelationStatistics Valid=551, Invalid=2989, Unknown=0, NotChecked=0, Total=3540 [2021-10-13 00:46:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19706 states. [2021-10-13 00:46:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19706 to 6345. [2021-10-13 00:46:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 6340 states have (on average 1.2675078864353313) internal successors, (8036), 6344 states have internal predecessors, (8036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 8036 transitions. [2021-10-13 00:46:58,256 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 8036 transitions. Word has length 258 [2021-10-13 00:46:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:58,257 INFO L470 AbstractCegarLoop]: Abstraction has 6345 states and 8036 transitions. [2021-10-13 00:46:58,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.142857142857142) internal successors, (352), 14 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 8036 transitions. [2021-10-13 00:46:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-10-13 00:46:58,266 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:58,267 INFO L512 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-10-13 00:46:58,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 00:46:58,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-10-13 00:46:58,481 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1050472350, now seen corresponding path program 1 times [2021-10-13 00:46:58,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:58,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103043734] [2021-10-13 00:46:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:58,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 00:46:58,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:58,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103043734] [2021-10-13 00:46:58,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103043734] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:58,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:58,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:58,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082949292] [2021-10-13 00:46:58,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:58,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:58,595 INFO L87 Difference]: Start difference. First operand 6345 states and 8036 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:58,867 INFO L93 Difference]: Finished difference Result 7580 states and 9437 transitions. [2021-10-13 00:46:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:58,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2021-10-13 00:46:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:58,870 INFO L225 Difference]: With dead ends: 7580 [2021-10-13 00:46:58,870 INFO L226 Difference]: Without dead ends: 1293 [2021-10-13 00:46:58,873 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2021-10-13 00:46:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 914. [2021-10-13 00:46:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 911 states have (on average 1.0757409440175631) internal successors, (980), 913 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 980 transitions. [2021-10-13 00:46:58,964 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 980 transitions. Word has length 358 [2021-10-13 00:46:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:58,965 INFO L470 AbstractCegarLoop]: Abstraction has 914 states and 980 transitions. [2021-10-13 00:46:58,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 980 transitions. [2021-10-13 00:46:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-10-13 00:46:58,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:58,970 INFO L512 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-10-13 00:46:58,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:46:58,970 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:58,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2021-10-13 00:46:58,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:58,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825131899] [2021-10-13 00:46:58,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:58,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 00:46:59,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:59,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825131899] [2021-10-13 00:46:59,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825131899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:59,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:59,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:46:59,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686703097] [2021-10-13 00:46:59,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:46:59,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:59,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:46:59,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:46:59,093 INFO L87 Difference]: Start difference. First operand 914 states and 980 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:59,471 INFO L93 Difference]: Finished difference Result 2047 states and 2228 transitions. [2021-10-13 00:46:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:46:59,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2021-10-13 00:46:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:59,474 INFO L225 Difference]: With dead ends: 2047 [2021-10-13 00:46:59,474 INFO L226 Difference]: Without dead ends: 1846 [2021-10-13 00:46:59,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:46:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2021-10-13 00:46:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 980. [2021-10-13 00:46:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 977 states have (on average 1.0777891504605936) internal successors, (1053), 979 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1053 transitions. [2021-10-13 00:46:59,582 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1053 transitions. Word has length 359 [2021-10-13 00:46:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:59,583 INFO L470 AbstractCegarLoop]: Abstraction has 980 states and 1053 transitions. [2021-10-13 00:46:59,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1053 transitions. [2021-10-13 00:46:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-10-13 00:46:59,586 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:59,587 INFO L512 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-10-13 00:46:59,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:46:59,587 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2021-10-13 00:46:59,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:59,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409060345] [2021-10-13 00:46:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:59,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 00:46:59,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:59,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409060345] [2021-10-13 00:46:59,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409060345] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:59,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:59,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:46:59,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146079695] [2021-10-13 00:46:59,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:46:59,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:46:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:59,687 INFO L87 Difference]: Start difference. First operand 980 states and 1053 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:59,864 INFO L93 Difference]: Finished difference Result 1347 states and 1459 transitions. [2021-10-13 00:46:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:46:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2021-10-13 00:46:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:59,866 INFO L225 Difference]: With dead ends: 1347 [2021-10-13 00:46:59,866 INFO L226 Difference]: Without dead ends: 1146 [2021-10-13 00:46:59,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:46:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-13 00:46:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 968. [2021-10-13 00:46:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 966 states have (on average 1.0662525879917184) internal successors, (1030), 967 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1030 transitions. [2021-10-13 00:46:59,964 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1030 transitions. Word has length 360 [2021-10-13 00:46:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:59,964 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1030 transitions. [2021-10-13 00:46:59,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:46:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1030 transitions. [2021-10-13 00:46:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-10-13 00:46:59,968 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:59,968 INFO L512 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-10-13 00:46:59,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:46:59,968 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:46:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2021-10-13 00:46:59,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:59,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201898242] [2021-10-13 00:46:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:59,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2021-10-13 00:47:00,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:00,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201898242] [2021-10-13 00:47:00,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201898242] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:47:00,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:47:00,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:47:00,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520907975] [2021-10-13 00:47:00,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:47:00,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:47:00,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:47:00,083 INFO L87 Difference]: Start difference. First operand 968 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:00,238 INFO L93 Difference]: Finished difference Result 1553 states and 1651 transitions. [2021-10-13 00:47:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:47:00,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 417 [2021-10-13 00:47:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:00,240 INFO L225 Difference]: With dead ends: 1553 [2021-10-13 00:47:00,240 INFO L226 Difference]: Without dead ends: 843 [2021-10-13 00:47:00,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:47:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-10-13 00:47:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 673. [2021-10-13 00:47:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 671 states have (on average 1.0700447093889718) internal successors, (718), 672 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 718 transitions. [2021-10-13 00:47:00,307 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 718 transitions. Word has length 417 [2021-10-13 00:47:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:00,307 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 718 transitions. [2021-10-13 00:47:00,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 718 transitions. [2021-10-13 00:47:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-10-13 00:47:00,310 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:47:00,311 INFO L512 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-10-13 00:47:00,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:47:00,311 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:47:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:47:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2021-10-13 00:47:00,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:47:00,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290061896] [2021-10-13 00:47:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:00,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 00:47:00,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:00,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290061896] [2021-10-13 00:47:00,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290061896] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:00,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821078519] [2021-10-13 00:47:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:00,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:00,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:47:00,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:47:00,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 00:47:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:01,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 33 conjunts are in the unsatisfiable core [2021-10-13 00:47:01,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:47:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 00:47:04,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821078519] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:04,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:47:04,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2021-10-13 00:47:04,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227398828] [2021-10-13 00:47:04,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 00:47:04,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 00:47:04,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:47:04,369 INFO L87 Difference]: Start difference. First operand 673 states and 718 transitions. Second operand has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:05,257 INFO L93 Difference]: Finished difference Result 918 states and 981 transitions. [2021-10-13 00:47:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-13 00:47:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 417 [2021-10-13 00:47:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:05,259 INFO L225 Difference]: With dead ends: 918 [2021-10-13 00:47:05,259 INFO L226 Difference]: Without dead ends: 916 [2021-10-13 00:47:05,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 625.9ms TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2021-10-13 00:47:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-10-13 00:47:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 734. [2021-10-13 00:47:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 732 states have (on average 1.0655737704918034) internal successors, (780), 733 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 780 transitions. [2021-10-13 00:47:05,349 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 780 transitions. Word has length 417 [2021-10-13 00:47:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:05,350 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 780 transitions. [2021-10-13 00:47:05,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 780 transitions. [2021-10-13 00:47:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2021-10-13 00:47:05,355 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:47:05,355 INFO L512 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-10-13 00:47:05,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 00:47:05,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:05,581 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:47:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:47:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2021-10-13 00:47:05,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:47:05,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119789872] [2021-10-13 00:47:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:05,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 00:47:05,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:05,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119789872] [2021-10-13 00:47:05,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119789872] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:05,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544154439] [2021-10-13 00:47:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:05,850 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:47:05,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:47:05,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-13 00:47:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:06,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 00:47:06,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:47:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 00:47:07,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544154439] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:07,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:47:07,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-10-13 00:47:07,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471728819] [2021-10-13 00:47:07,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:47:07,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:07,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:47:07,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:47:07,710 INFO L87 Difference]: Start difference. First operand 734 states and 780 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:08,087 INFO L93 Difference]: Finished difference Result 1281 states and 1368 transitions. [2021-10-13 00:47:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:47:08,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 464 [2021-10-13 00:47:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:08,090 INFO L225 Difference]: With dead ends: 1281 [2021-10-13 00:47:08,091 INFO L226 Difference]: Without dead ends: 1151 [2021-10-13 00:47:08,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 90.1ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:47:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-10-13 00:47:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 798. [2021-10-13 00:47:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 796 states have (on average 1.0665829145728642) internal successors, (849), 797 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 849 transitions. [2021-10-13 00:47:08,246 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 849 transitions. Word has length 464 [2021-10-13 00:47:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:08,246 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 849 transitions. [2021-10-13 00:47:08,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 849 transitions. [2021-10-13 00:47:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2021-10-13 00:47:08,251 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:47:08,253 INFO L512 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-10-13 00:47:08,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-13 00:47:08,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-13 00:47:08,469 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:47:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:47:08,469 INFO L82 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2021-10-13 00:47:08,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:47:08,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773682852] [2021-10-13 00:47:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:08,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 137 proven. 527 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 00:47:09,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:09,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773682852] [2021-10-13 00:47:09,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773682852] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:09,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272175272] [2021-10-13 00:47:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:09,050 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:47:09,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:47:09,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 00:47:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:10,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 45 conjunts are in the unsatisfiable core [2021-10-13 00:47:10,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:47:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 00:47:13,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272175272] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:13,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:47:13,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2021-10-13 00:47:13,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061282858] [2021-10-13 00:47:13,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-13 00:47:13,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-13 00:47:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2021-10-13 00:47:13,787 INFO L87 Difference]: Start difference. First operand 798 states and 849 transitions. Second operand has 30 states, 30 states have (on average 18.966666666666665) internal successors, (569), 30 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:15,090 INFO L93 Difference]: Finished difference Result 1063 states and 1132 transitions. [2021-10-13 00:47:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-13 00:47:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 18.966666666666665) internal successors, (569), 30 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 523 [2021-10-13 00:47:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:15,092 INFO L225 Difference]: With dead ends: 1063 [2021-10-13 00:47:15,092 INFO L226 Difference]: Without dead ends: 1061 [2021-10-13 00:47:15,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1052.6ms TimeCoverageRelationStatistics Valid=419, Invalid=3121, Unknown=0, NotChecked=0, Total=3540 [2021-10-13 00:47:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-10-13 00:47:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 859. [2021-10-13 00:47:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 857 states have (on average 1.0630105017502918) internal successors, (911), 858 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 911 transitions. [2021-10-13 00:47:15,230 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 911 transitions. Word has length 523 [2021-10-13 00:47:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:15,230 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 911 transitions. [2021-10-13 00:47:15,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 18.966666666666665) internal successors, (569), 30 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 911 transitions. [2021-10-13 00:47:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2021-10-13 00:47:15,235 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:47:15,235 INFO L512 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-10-13 00:47:15,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 00:47:15,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-10-13 00:47:15,436 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:47:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:47:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2021-10-13 00:47:15,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:47:15,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043655776] [2021-10-13 00:47:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:15,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 25 proven. 725 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-10-13 00:47:16,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:16,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043655776] [2021-10-13 00:47:16,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043655776] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:16,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184234661] [2021-10-13 00:47:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:16,050 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:47:16,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:47:16,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 00:47:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:17,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-13 00:47:17,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:47:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-10-13 00:47:19,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184234661] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:19,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:47:19,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 26 [2021-10-13 00:47:19,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29252003] [2021-10-13 00:47:19,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-13 00:47:19,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-13 00:47:19,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2021-10-13 00:47:19,180 INFO L87 Difference]: Start difference. First operand 859 states and 911 transitions. Second operand has 26 states, 26 states have (on average 29.115384615384617) internal successors, (757), 26 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:23,723 INFO L93 Difference]: Finished difference Result 2557 states and 2721 transitions. [2021-10-13 00:47:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-10-13 00:47:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 29.115384615384617) internal successors, (757), 26 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 570 [2021-10-13 00:47:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:23,728 INFO L225 Difference]: With dead ends: 2557 [2021-10-13 00:47:23,728 INFO L226 Difference]: Without dead ends: 2427 [2021-10-13 00:47:23,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 626 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6574 ImplicationChecksByTransitivity, 3479.1ms TimeCoverageRelationStatistics Valid=2073, Invalid=17109, Unknown=0, NotChecked=0, Total=19182 [2021-10-13 00:47:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2021-10-13 00:47:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 985. [2021-10-13 00:47:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 983 states have (on average 1.0620549338758902) internal successors, (1044), 984 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1044 transitions. [2021-10-13 00:47:23,906 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1044 transitions. Word has length 570 [2021-10-13 00:47:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:23,907 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1044 transitions. [2021-10-13 00:47:23,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 29.115384615384617) internal successors, (757), 26 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1044 transitions. [2021-10-13 00:47:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2021-10-13 00:47:23,912 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:47:23,912 INFO L512 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-10-13 00:47:23,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 00:47:24,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-10-13 00:47:24,113 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:47:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:47:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2021-10-13 00:47:24,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:47:24,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204671976] [2021-10-13 00:47:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:24,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 96 proven. 990 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 00:47:25,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:25,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204671976] [2021-10-13 00:47:25,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204671976] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:25,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830645626] [2021-10-13 00:47:25,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:25,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:47:25,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:47:25,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 00:47:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:26,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 57 conjunts are in the unsatisfiable core [2021-10-13 00:47:26,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:47:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 00:47:31,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830645626] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:31,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:47:31,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2021-10-13 00:47:31,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429688092] [2021-10-13 00:47:31,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-13 00:47:31,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-13 00:47:31,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 00:47:31,377 INFO L87 Difference]: Start difference. First operand 985 states and 1044 transitions. Second operand has 36 states, 36 states have (on average 23.11111111111111) internal successors, (832), 36 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:33,907 INFO L93 Difference]: Finished difference Result 2034 states and 2156 transitions. [2021-10-13 00:47:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-10-13 00:47:33,908 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 23.11111111111111) internal successors, (832), 36 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 630 [2021-10-13 00:47:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:33,910 INFO L225 Difference]: With dead ends: 2034 [2021-10-13 00:47:33,910 INFO L226 Difference]: Without dead ends: 2032 [2021-10-13 00:47:33,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 642 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 1924.7ms TimeCoverageRelationStatistics Valid=652, Invalid=6154, Unknown=0, NotChecked=0, Total=6806 [2021-10-13 00:47:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2021-10-13 00:47:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1475. [2021-10-13 00:47:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1473 states have (on average 1.0583842498302782) internal successors, (1559), 1474 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1559 transitions. [2021-10-13 00:47:34,233 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1559 transitions. Word has length 630 [2021-10-13 00:47:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:34,233 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 1559 transitions. [2021-10-13 00:47:34,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 23.11111111111111) internal successors, (832), 36 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1559 transitions. [2021-10-13 00:47:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2021-10-13 00:47:34,241 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:47:34,241 INFO L512 BasicCegarLoop]: trace histogram [13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 00:47:34,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-13 00:47:34,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:34,449 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 00:47:34,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:47:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -16317840, now seen corresponding path program 1 times [2021-10-13 00:47:34,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:47:34,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125806240] [2021-10-13 00:47:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:34,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:47:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 235 proven. 895 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-10-13 00:47:34,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:47:34,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125806240] [2021-10-13 00:47:34,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125806240] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:47:34,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987329675] [2021-10-13 00:47:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:47:34,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:47:34,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:47:34,939 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:47:34,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-13 00:47:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:47:37,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 00:47:37,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:47:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-10-13 00:47:38,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987329675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:47:38,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:47:38,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 24 [2021-10-13 00:47:38,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38336082] [2021-10-13 00:47:38,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:47:38,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:47:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:47:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:47:38,567 INFO L87 Difference]: Start difference. First operand 1475 states and 1559 transitions. Second operand has 9 states, 9 states have (on average 53.55555555555556) internal successors, (482), 9 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:47:38,855 INFO L93 Difference]: Finished difference Result 1493 states and 1577 transitions. [2021-10-13 00:47:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:47:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 53.55555555555556) internal successors, (482), 9 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 677 [2021-10-13 00:47:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:47:38,856 INFO L225 Difference]: With dead ends: 1493 [2021-10-13 00:47:38,856 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:47:38,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 313.7ms TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2021-10-13 00:47:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:47:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:47:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:47:38,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 677 [2021-10-13 00:47:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:47:38,858 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:47:38,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 53.55555555555556) internal successors, (482), 9 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:47:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:47:38,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:47:38,861 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:47:38,862 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:47:38,862 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:47:38,862 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:47:38,862 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:47:38,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-13 00:47:39,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-10-13 00:47:39,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 00:47:39,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:39,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:39,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:40,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:40,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:40,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:41,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:41,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:41,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:41,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:42,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:43,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:43,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:46,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:47,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:47,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:47,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:48,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:49,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:49,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:49,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:49,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:50,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:50,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:50,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:50,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:50,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:50,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:51,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:52,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:52,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:52,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:55,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:55,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:55,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:55,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:55,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:56,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:56,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:56,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:56,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:57,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:57,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:57,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:57,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:57,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:57,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:58,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:59,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:47:59,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:00,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:00,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:00,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:00,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:01,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:02,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:02,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:03,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:03,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:03,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:03,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:05,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:05,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:05,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:05,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:06,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:48:24,899 WARN L207 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 957 DAG size of output: 219 [2021-10-13 00:48:57,953 WARN L207 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 951 DAG size of output: 219 [2021-10-13 00:49:38,823 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,823 INFO L857 garLoopResultBuilder]: For program point L498(lines 497 525) no Hoare annotation was computed. [2021-10-13 00:49:38,823 INFO L857 garLoopResultBuilder]: For program point L366(lines 136 482) no Hoare annotation was computed. [2021-10-13 00:49:38,823 INFO L857 garLoopResultBuilder]: For program point L1225(lines 1225 1229) no Hoare annotation was computed. [2021-10-13 00:49:38,823 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2021-10-13 00:49:38,823 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 437) no Hoare annotation was computed. [2021-10-13 00:49:38,824 INFO L857 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2021-10-13 00:49:38,824 INFO L853 garLoopResultBuilder]: At program point L1028(lines 1002 1029) the Hoare annotation is: (let ((.cse31 (+ 51 ~req_tt_a~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse22 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0))) (let ((.cse20 (<= 51 ~s_memory1~0)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 1)) (.cse27 (= ~a_t~0 1)) (.cse4 (<= 50 ~c_req_d~0)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= ~c_req_d~0 50)) (.cse11 (= ~m_run_pc~0 3)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse28 (= ~c_req_type~0 0)) (.cse17 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse29 (let ((.cse33 (= ~m_run_pc~0 6))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse22 .cse7 .cse10 .cse23 .cse33 .cse14) (and .cse0 .cse1 .cse3 .cse22 .cse7 .cse10 .cse23 .cse33 .cse12 .cse14)))) (.cse2 (<= 50 ~s_memory0~0)) (.cse18 (<= ~s_memory1~0 51)) (.cse30 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (<= 52 ~s_memory2~0)) (.cse21 (<= ~s_memory2~0 52)) (.cse32 (<= .cse31 (+ ~s_memory1~0 ~a_t~0))) (.cse9 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~req_type~1 1) .cse15) (and .cse16 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse18 .cse19 .cse20 .cse21 .cse22 .cse7 .cse9 .cse10 .cse23 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse24 (<= ~c_req_d~0 52) .cse14 .cse25) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse18 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse20 .cse26 (<= ~c_req_d~0 51) .cse22 .cse27 .cse7 .cse9 .cse10 .cse23 .cse11 .cse14 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse16 .cse28 .cse17 .cse29 .cse2 .cse18 .cse30 .cse19 .cse20 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse21 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse24 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse25) (and .cse16 .cse28 .cse17 .cse29 .cse2 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse30 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse19 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse26 .cse21 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse27 .cse32 (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse9 (<= 51 |ULTIMATE.start_s_memory_read_#res|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse28 .cse17 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse29 .cse2 .cse18 .cse30 (= ~req_tt_a~0 0) .cse19 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse32 .cse9 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50))))) [2021-10-13 00:49:38,824 INFO L857 garLoopResultBuilder]: For program point L566(lines 566 619) no Hoare annotation was computed. [2021-10-13 00:49:38,825 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 132) no Hoare annotation was computed. [2021-10-13 00:49:38,825 INFO L857 garLoopResultBuilder]: For program point L831(lines 831 837) no Hoare annotation was computed. [2021-10-13 00:49:38,825 INFO L853 garLoopResultBuilder]: At program point L831-1(lines 831 837) the Hoare annotation is: (let ((.cse8 (+ 51 ~req_tt_a~0)) (.cse17 (= ~a_t~0 0)) (.cse16 (+ 51 ULTIMATE.start_m_run_~req_a___0~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse9 (<= 52 ~s_memory2~0)) (.cse11 (<= ~s_memory2~0 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= .cse16 (+ ~s_memory1~0 ULTIMATE.start_m_run_~a~0))) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (< ULTIMATE.start_m_run_~rsp_d___0~0 .cse16)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (<= 51 ~s_memory1~0)) (.cse12 (<= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse13 (let ((.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (not (= ~s_run_st~0 0))) (.cse20 (not (= ~c_m_lock~0 1))) (.cse21 (= 2 ~s_run_pc~0)) (.cse22 (= ~c_empty_req~0 1)) (.cse23 (= 2 ~c_write_rsp_ev~0)) (.cse24 (= ~c_empty_rsp~0 1)) (.cse25 (= ~m_run_pc~0 6)) (.cse26 (<= 2 ~c_m_ev~0))) (or (and .cse18 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse18 .cse19 (= ULTIMATE.start_m_run_~a~0 0) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse17 .cse26)))) (.cse14 (<= .cse8 (+ ~s_memory1~0 ~a_t~0))) (.cse15 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse9 .cse10 (<= .cse8 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 (= ~a_t~0 1) .cse13 .cse14 (<= .cse8 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse15 (<= .cse16 (+ ULTIMATE.start_m_run_~a~0 ~c_rsp_d~0)) (<= .cse8 (+ ~a_t~0 ~c_rsp_d~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse13 .cse14 .cse15 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,826 INFO L853 garLoopResultBuilder]: At program point L765(lines 758 811) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (<= 6 ~m_run_pc~0)) (.cse16 (not (= ~c_m_lock~0 1))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6))) (or (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) .cse11 (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse11)))) [2021-10-13 00:49:38,826 INFO L853 garLoopResultBuilder]: At program point L699(lines 692 727) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse8 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse8 (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse12 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse8 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,826 INFO L857 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-10-13 00:49:38,827 INFO L853 garLoopResultBuilder]: At program point L1096(lines 1089 1106) the Hoare annotation is: (let ((.cse19 (+ 51 ~req_tt_a~0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse22 (= ~m_run_st~0 0)) (.cse23 (= 2 ~s_run_pc~0)) (.cse24 (= ~c_empty_req~0 1))) (let ((.cse6 (let ((.cse26 (= ~m_run_pc~0 3))) (or (and (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse22 .cse24 .cse26) (and .cse22 .cse23 .cse24 .cse26)))) (.cse15 (= ULTIMATE.start_m_run_~a~0 1)) (.cse16 (= ~a_t~0 1)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse2 (<= 50 ~s_memory0~0)) (.cse11 (<= ~s_memory1~0 51)) (.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse12 (<= 52 ~s_memory2~0)) (.cse13 (<= 51 ~s_memory1~0)) (.cse14 (<= ~s_memory2~0 52)) (.cse20 (let ((.cse25 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse3 .cse22 .cse23 .cse24 .cse25 .cse7 .cse8) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse22 .cse23 .cse24 .cse25 .cse8)))) (.cse21 (<= .cse19 (+ ~s_memory1~0 ~a_t~0))) (.cse5 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_memory_write_~v 50) .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse9 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse11 .cse4 .cse12 .cse13 .cse14 .cse5 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse8 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse11 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse13 .cse15 (<= ~c_req_d~0 51) .cse16 .cse5 .cse6 .cse8 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse9 .cse17 .cse10 .cse2 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse4 .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse15 .cse14 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse16 .cse20 .cse21 (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse5 (<= .cse19 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse17 .cse10 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse11 .cse18 .cse4 (= ~req_tt_a~0 0) .cse12 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse20 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse21 .cse5 (<= ~c_rsp_d~0 50) .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse17 (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ~s_memory1~0 ULTIMATE.start_m_run_~a~0)) .cse10 .cse2 .cse11 .cse18 .cse4 .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse14 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse20 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse21 .cse5 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52))))) [2021-10-13 00:49:38,827 INFO L853 garLoopResultBuilder]: At program point L1163(lines 1115 1168) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse11 .cse15 .cse0 .cse1 .cse3 .cse4 .cse13))) .cse16) (and .cse10 .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse13) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse9))) [2021-10-13 00:49:38,827 INFO L857 garLoopResultBuilder]: For program point L1097(lines 1089 1106) no Hoare annotation was computed. [2021-10-13 00:49:38,828 INFO L857 garLoopResultBuilder]: For program point L767(lines 767 771) no Hoare annotation was computed. [2021-10-13 00:49:38,828 INFO L857 garLoopResultBuilder]: For program point L701(lines 701 705) no Hoare annotation was computed. [2021-10-13 00:49:38,828 INFO L853 garLoopResultBuilder]: At program point L1296(lines 1289 1315) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse11 .cse15 .cse0 .cse1 .cse3 .cse4 .cse13))) .cse16) (and .cse10 .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse13) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse9))) [2021-10-13 00:49:38,828 INFO L853 garLoopResultBuilder]: At program point L239(lines 232 267) the Hoare annotation is: (let ((.cse22 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse21 (= ~m_run_pc~0 0)) (.cse20 (= ~c_empty_rsp~0 1))) (let ((.cse2 (<= 50 ~s_memory0~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (<= ~s_memory0~0 50)) (.cse8 (or (and .cse20 .cse21) (and .cse20 (= ~m_run_pc~0 3)))) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_req_type~0 0))) (.cse11 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse19 (= ~s_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= .cse22 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 .cse22)) (.cse15 (<= ~c_req_d~0 .cse22)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse17 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse18 (<= .cse22 ~c_req_d~0))) (or (and (<= 2 ~c_req_a~0) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse2 (<= ~s_memory1~0 51) .cse3 (<= 51 ~s_memory1~0) .cse4 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse5 .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) .cse8 (<= ~c_req_a~0 2) (<= ~c_req_d~0 52) .cse9 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse10 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse11 .cse0 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse7 .cse16 .cse8 .cse17 .cse9 .cse10 .cse18) (and .cse0 .cse1 .cse2 (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse3 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 .cse6 .cse7 .cse8 .cse17 (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse11 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse3 .cse19 .cse12 .cse7 .cse20 .cse16 .cse21 .cse10) (and .cse11 .cse0 .cse1 .cse19 .cse12 .cse13 .cse14 .cse15 .cse5 .cse7 .cse20 .cse16 .cse17 .cse9 .cse21 .cse18)))) [2021-10-13 00:49:38,829 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 131) no Hoare annotation was computed. [2021-10-13 00:49:38,829 INFO L857 garLoopResultBuilder]: For program point L1098(lines 1098 1102) no Hoare annotation was computed. [2021-10-13 00:49:38,829 INFO L853 garLoopResultBuilder]: At program point L108(lines 103 845) the Hoare annotation is: false [2021-10-13 00:49:38,829 INFO L853 garLoopResultBuilder]: At program point L439(lines 432 458) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,829 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1302) no Hoare annotation was computed. [2021-10-13 00:49:38,830 INFO L857 garLoopResultBuilder]: For program point L241(lines 241 245) no Hoare annotation was computed. [2021-10-13 00:49:38,830 INFO L857 garLoopResultBuilder]: For program point L968(lines 968 972) no Hoare annotation was computed. [2021-10-13 00:49:38,830 INFO L853 garLoopResultBuilder]: At program point L176(lines 146 177) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse3 (= ~s_run_pc~0 0)) (.cse17 (<= 50 ~s_memory0~0)) (.cse19 (<= ~s_memory0~0 50)) (.cse20 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (not (= ~c_m_lock~0 1))) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse18 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse16 .cse3 .cse4 .cse6 .cse8 .cse10 .cse11 .cse12 .cse15) (and .cse1 .cse17 (= ULTIMATE.start_m_run_~req_a~0 1) .cse16 (<= 50 ~c_req_d~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 (<= ~c_req_d~0 50) .cse19 .cse10 .cse11 .cse20 .cse13 (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse1 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse17 (<= ~s_memory1~0 51) .cse16 (<= 51 ~s_memory1~0) .cse6 .cse18 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse8 .cse9 .cse19 .cse10 .cse11 .cse20 (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2021-10-13 00:49:38,830 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 130) no Hoare annotation was computed. [2021-10-13 00:49:38,830 INFO L857 garLoopResultBuilder]: For program point L1035(lines 1035 1088) no Hoare annotation was computed. [2021-10-13 00:49:38,831 INFO L853 garLoopResultBuilder]: At program point L573(lines 566 619) the Hoare annotation is: (let ((.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse14 (= ~a_t~0 0)) (.cse20 (<= 2 ~c_m_ev~0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse13 (let ((.cse21 (= ~m_run_pc~0 6))) (or (and .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse21 (<= 2 ULTIMATE.start_m_run_~a~0) .cse20 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse15 .cse16 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse18 .cse19 .cse21 .cse14 .cse20)))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 2 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= .cse6 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 (= ~a_t~0 1) .cse10 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_a~0 2) (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_a~0 1) .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13) (and .cse0 .cse1 (= ~c_req_a~0 0) .cse15 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse18 .cse19 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse20 .cse12 (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,831 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-10-13 00:49:38,831 INFO L853 garLoopResultBuilder]: At program point L111(lines 103 845) the Hoare annotation is: false [2021-10-13 00:49:38,831 INFO L857 garLoopResultBuilder]: For program point L1036(lines 1036 1040) no Hoare annotation was computed. [2021-10-13 00:49:38,832 INFO L853 garLoopResultBuilder]: At program point L640-2(lines 640 668) the Hoare annotation is: (let ((.cse38 (+ 51 ~req_tt_a~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse34 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 1 ~a_t~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse35 (= ~m_run_pc~0 6)) (.cse8 (<= 2 ~c_m_ev~0))) (let ((.cse32 (= ~req_tt_a~0 2)) (.cse15 (<= 51 ~s_memory1~0)) (.cse23 (or (and .cse0 .cse1 .cse12 .cse5 .cse6 .cse7 .cse35 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8) (and .cse0 .cse33 .cse1 .cse2 .cse5 .cse6 .cse7 .cse35 .cse8))) (.cse30 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse31 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse21 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse25 (= ~req_tt_a~0 1)) (.cse13 (= ~a_t~0 1)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~c_req_type~0 0)) (.cse29 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse34 .cse6 .cse35 .cse16 .cse8) (and .cse0 .cse33 .cse1 .cse2 .cse3 .cse5 .cse34 .cse6 .cse35 .cse8))) (.cse10 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse18 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse22 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse26 (<= 52 ~s_memory2~0)) (.cse27 (<= ~s_memory2~0 52)) (.cse28 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse14 (<= .cse38 (+ ~s_memory1~0 ~a_t~0))) (.cse24 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (let ((.cse11 (let ((.cse19 (= ~c_req_a~0 1))) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse23 .cse24))))) (or (and .cse11 .cse12 .cse13 .cse14) (and .cse11 .cse15 .cse12 .cse14 .cse16))) .cse26 .cse27) (and .cse9 .cse17 (= ~c_req_a~0 0) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 .cse20 .cse4 .cse26 .cse15 .cse23 .cse27 .cse28 .cse24 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse17 .cse29 .cse10 .cse18 .cse20 .cse22 .cse26 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse27 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse24 .cse30 .cse31 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) .cse32 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 .cse33 .cse2 .cse3 .cse5 .cse34 .cse6 .cse7 .cse35 .cse8) (and (let ((.cse36 (<= 2 ~c_req_a~0)) (.cse37 (<= ~c_req_a~0 2))) (or (and .cse9 .cse36 .cse17 .cse10 .cse18 .cse20 .cse22 .cse26 .cse15 .cse23 .cse27 .cse14 .cse24 .cse30 .cse37 .cse32) (and .cse9 .cse36 .cse17 .cse10 .cse18 .cse20 .cse22 (= ULTIMATE.start_m_run_~a~0 2) .cse26 .cse15 .cse23 .cse27 .cse13 .cse14 .cse24 .cse30 .cse37))) .cse31) (and .cse9 .cse17 .cse29 .cse10 .cse18 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse25 (<= .cse38 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse26 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse12 .cse27 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse13 .cse14 (<= .cse38 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse24 (<= .cse38 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8) (and .cse0 .cse33 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse17 .cse29 .cse10 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse18 .cse20 .cse22 (= ~req_tt_a~0 0) .cse26 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse27 .cse28 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse14 .cse24 (<= ~c_rsp_d~0 50) .cse16 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse3 .cse12 .cse5 .cse6 .cse7 .cse16 .cse8)))) [2021-10-13 00:49:38,832 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,832 INFO L853 garLoopResultBuilder]: At program point L773(lines 766 810) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (<= 6 ~m_run_pc~0)) (.cse16 (not (= ~c_m_lock~0 1))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6))) (or (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) .cse11 (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse11)))) [2021-10-13 00:49:38,833 INFO L853 garLoopResultBuilder]: At program point L707(lines 700 726) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse8 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse8 (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse12 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse8 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,833 INFO L857 garLoopResultBuilder]: For program point L641(lines 640 668) no Hoare annotation was computed. [2021-10-13 00:49:38,833 INFO L857 garLoopResultBuilder]: For program point L575(lines 575 579) no Hoare annotation was computed. [2021-10-13 00:49:38,833 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 129) no Hoare annotation was computed. [2021-10-13 00:49:38,834 INFO L853 garLoopResultBuilder]: At program point L906(lines 880 907) the Hoare annotation is: (let ((.cse17 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= 2 ~s_run_pc~0)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0))) (let ((.cse15 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse29 (= ~c_req_a~0 1)) (.cse21 (<= 52 ~s_memory2~0)) (.cse30 (= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= ~s_memory2~0 52)) (.cse31 (= ~a_t~0 1)) (.cse32 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse25 (let ((.cse33 (= ~m_run_pc~0 6))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse4 .cse7 .cse9 .cse10 .cse33 .cse13) (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse33 .cse12 .cse13)))) (.cse1 (= ~c_req_a~0 0)) (.cse6 (<= 50 ~c_req_d~0)) (.cse8 (<= ~c_req_d~0 50)) (.cse16 (<= 2 ~c_req_a~0)) (.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse22 (<= 51 ~s_memory1~0)) (.cse24 (<= ~s_memory0~0 50)) (.cse11 (= ~m_run_pc~0 3)) (.cse26 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= ~c_req_a~0 2)) (.cse14 (not .cse17)) (.cse28 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse26 .cse27 (= ~req_tt_a~0 2) .cse28) (and .cse0 .cse2 .cse3 .cse19 .cse29 .cse4 (<= 51 ~c_req_d~0) .cse30 (<= ~c_req_d~0 51) .cse7 .cse31 .cse24 .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse14) (and .cse15 .cse17 .cse1 .cse18 .cse19 .cse20 (= ~req_tt_a~0 0) .cse21 .cse23 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse32 .cse24 .cse25 .cse12) (and .cse15 .cse17 .cse18 .cse19 .cse29 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ~req_tt_a~0 1) .cse21 .cse30 .cse23 .cse31 .cse32 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse16 (<= 52 ~c_req_d~0) .cse0 .cse2 .cse3 .cse19 .cse20 .cse4 .cse22 .cse7 .cse24 .cse9 .cse10 .cse11 .cse26 .cse27 (<= ~c_req_d~0 52) .cse13 .cse14 .cse28)))) [2021-10-13 00:49:38,834 INFO L857 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2021-10-13 00:49:38,834 INFO L853 garLoopResultBuilder]: At program point L114(lines 103 845) the Hoare annotation is: (let ((.cse4 (<= 51 ~c_req_d~0)) (.cse6 (<= ~c_req_d~0 51)) (.cse8 (= ~a_t~0 1)) (.cse18 (<= 52 ~c_req_d~0)) (.cse19 (<= ~s_memory1~0 51)) (.cse20 (<= 51 ~s_memory1~0)) (.cse21 (<= ~c_req_d~0 52)) (.cse22 (<= 2 ~a_t~0)) (.cse3 (<= 50 ~s_memory0~0)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse29 (= ~c_empty_req~0 1)) (.cse10 (<= ~s_memory0~0 50)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse25 (<= 50 ~c_req_d~0)) (.cse7 (= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse27 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~c_req_a~0 0)) (.cse28 (not (= ~s_run_st~0 0))) (.cse24 (= ~s_run_pc~0 0)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 3)) (.cse17 (not (= ~c_req_type~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= 2 ~c_req_a~0) .cse18 .cse0 .cse1 .cse2 .cse3 .cse19 .cse20 .cse7 .cse10 .cse11 .cse12 .cse13 (<= ~c_req_a~0 2) .cse21 .cse15 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse24 .cse25 .cse26 .cse11 .cse12 .cse13 .cse27 .cse15) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse3 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse19 .cse28 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 .cse20 .cse6 .cse7 .cse8 .cse29 .cse10 .cse11 .cse13 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and (<= ULTIMATE.start_s_memory_write_~v 52) .cse18 .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse19 .cse28 (<= 52 ~s_memory2~0) .cse20 (<= ~s_memory2~0 52) .cse7 .cse29 .cse10 .cse11 .cse13 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse15 .cse22) (and .cse7 .cse29 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse28 .cse25 .cse5 .cse7 .cse9 .cse29 .cse26 .cse10 .cse11 .cse13 .cse27 .cse14 .cse15 .cse16) (and .cse0 .cse28 .cse7 .cse11 .cse12 .cse13) (and .cse0 .cse23 .cse1 .cse2 .cse25 .cse7 .cse26 .cse11 .cse12 .cse13 .cse27 .cse15 .cse17) (and .cse23 .cse28 .cse24 .cse11 .cse12 .cse13 .cse17))) [2021-10-13 00:49:38,835 INFO L853 garLoopResultBuilder]: At program point L180-2(lines 180 208) the Hoare annotation is: (let ((.cse8 (= 2 ~s_run_pc~0)) (.cse23 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse17 (<= 50 ~s_memory0~0)) (.cse18 (<= ~s_memory0~0 50)) (.cse19 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse6 (<= .cse23 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse23)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse20 (not .cse8)) (.cse21 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse4 (not (= ~s_run_st~0 0))) (.cse22 (= ~s_run_pc~0 0)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse3 .cse17 (= ULTIMATE.start_m_run_~req_a~0 1) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse10 (<= ~c_req_d~0 50) .cse18 .cse11 .cse12 .cse19 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse1 .cse3 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse17 (<= ~s_memory1~0 51) .cse4 (<= 51 ~s_memory1~0) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse9 .cse10 .cse18 .cse11 .cse12 .cse19 (<= 2 ULTIMATE.start_m_run_~a~0) .cse15 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse21 .cse22 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse20 .cse21 .cse4 .cse22 .cse5 .cse9 .cse11 .cse12 .cse13 .cse16)))) [2021-10-13 00:49:38,835 INFO L857 garLoopResultBuilder]: For program point L775(lines 775 779) no Hoare annotation was computed. [2021-10-13 00:49:38,835 INFO L857 garLoopResultBuilder]: For program point L709(lines 709 713) no Hoare annotation was computed. [2021-10-13 00:49:38,835 INFO L853 garLoopResultBuilder]: At program point L1304(lines 1297 1314) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse11 .cse15 .cse0 .cse1 .cse3 .cse4 .cse13))) .cse16) (and .cse10 .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse13) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse9))) [2021-10-13 00:49:38,836 INFO L853 garLoopResultBuilder]: At program point L247(lines 240 266) the Hoare annotation is: (let ((.cse22 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse21 (= ~m_run_pc~0 0)) (.cse20 (= ~c_empty_rsp~0 1))) (let ((.cse2 (<= 50 ~s_memory0~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (<= ~s_memory0~0 50)) (.cse8 (or (and .cse20 .cse21) (and .cse20 (= ~m_run_pc~0 3)))) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_req_type~0 0))) (.cse11 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse19 (= ~s_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= .cse22 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 .cse22)) (.cse15 (<= ~c_req_d~0 .cse22)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse17 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse18 (<= .cse22 ~c_req_d~0))) (or (and (<= 2 ~c_req_a~0) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse2 (<= ~s_memory1~0 51) .cse3 (<= 51 ~s_memory1~0) .cse4 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse5 .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) .cse8 (<= ~c_req_a~0 2) (<= ~c_req_d~0 52) .cse9 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse10 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse11 .cse0 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse7 .cse16 .cse8 .cse17 .cse9 .cse10 .cse18) (and .cse0 .cse1 .cse2 (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse3 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 .cse6 .cse7 .cse8 .cse17 (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse11 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse3 .cse19 .cse12 .cse7 .cse20 .cse16 .cse21 .cse10) (and .cse11 .cse0 .cse1 .cse19 .cse12 .cse13 .cse14 .cse15 .cse5 .cse7 .cse20 .cse16 .cse17 .cse9 .cse21 .cse18)))) [2021-10-13 00:49:38,836 INFO L857 garLoopResultBuilder]: For program point L181(lines 180 208) no Hoare annotation was computed. [2021-10-13 00:49:38,836 INFO L853 garLoopResultBuilder]: At program point L974(lines 967 984) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (= ~a_t~0 1)) (.cse25 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse26 (= ~c_req_a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse34 (<= 2 ~c_req_a~0)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (<= 52 ~s_memory2~0)) (.cse35 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse24 (let ((.cse41 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse41 .cse33 .cse15) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse8 .cse10 .cse12 .cse13 .cse41 .cse15)))) (.cse36 (< 1 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse11 (<= ~s_memory0~0 50)) (.cse38 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse40 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse17 .cse18 .cse19 .cse3 .cse4 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse21 (= ~req_tt_a~0 1) .cse22 .cse7 .cse23 .cse24 .cse9 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse2 .cse6 .cse27 .cse28 .cse29 .cse8 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse17 .cse18 .cse26 .cse19 .cse3 .cse20 .cse21 (= ~req_tt_a~0 0) .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse11 .cse32 .cse33) (and .cse0 .cse26 .cse1 .cse2 .cse6 (= ~s_run_pc~0 0) .cse27 .cse28 .cse29 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse34 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse20 .cse6 .cse35 .cse8 .cse36 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse39 (<= ~c_req_d~0 52) .cse15 .cse16 .cse40) (and .cse17 .cse34 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse35 .cse23 .cse24 .cse36 .cse37 .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse38 .cse39 (= ~req_tt_a~0 2) .cse40)))) [2021-10-13 00:49:38,836 INFO L857 garLoopResultBuilder]: For program point L1305(lines 1257 1346) no Hoare annotation was computed. [2021-10-13 00:49:38,837 INFO L857 garLoopResultBuilder]: For program point L1239(lines 1239 1243) no Hoare annotation was computed. [2021-10-13 00:49:38,837 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 186) no Hoare annotation was computed. [2021-10-13 00:49:38,837 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 128) no Hoare annotation was computed. [2021-10-13 00:49:38,837 INFO L857 garLoopResultBuilder]: For program point L975(lines 967 984) no Hoare annotation was computed. [2021-10-13 00:49:38,837 INFO L853 garLoopResultBuilder]: At program point L447(lines 440 457) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,837 INFO L857 garLoopResultBuilder]: For program point L381(lines 381 385) no Hoare annotation was computed. [2021-10-13 00:49:38,838 INFO L857 garLoopResultBuilder]: For program point L1306(lines 1306 1310) no Hoare annotation was computed. [2021-10-13 00:49:38,838 INFO L857 garLoopResultBuilder]: For program point L249(lines 249 253) no Hoare annotation was computed. [2021-10-13 00:49:38,838 INFO L857 garLoopResultBuilder]: For program point L1174(lines 1174 1178) no Hoare annotation was computed. [2021-10-13 00:49:38,838 INFO L853 garLoopResultBuilder]: At program point L117(lines 103 845) the Hoare annotation is: false [2021-10-13 00:49:38,838 INFO L857 garLoopResultBuilder]: For program point L1174-2(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 00:49:38,839 INFO L853 garLoopResultBuilder]: At program point L1042(lines 1035 1088) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse31 (+ 51 ~req_tt_a~0))) (let ((.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= ~c_req_d~0 50)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse11 (= ~m_run_pc~0 3)) (.cse29 (= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (= ~a_t~0 1)) (.cse24 (<= .cse31 (+ ~s_memory1~0 ~a_t~0))) (.cse16 (let ((.cse32 (= ~m_run_pc~0 6))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse25 .cse8 .cse32 .cse14) (and .cse0 .cse1 .cse3 .cse25 .cse8 .cse32 .cse12 .cse14)))) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse2 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse22 (<= 52 ~s_memory2~0)) (.cse26 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse10 (<= ~s_memory0~0 50)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~req_type~1 1) .cse15) (and .cse16 .cse17 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse18 .cse19 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse20 .cse21 .cse4 (= ~req_tt_a~0 0) .cse22 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse23 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse24 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse20 .cse4 .cse22 .cse26 .cse23 .cse25 .cse8 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse27 (<= ~c_req_d~0 52) .cse14 .cse28) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse20 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse26 .cse29 (<= ~c_req_d~0 51) .cse25 .cse30 .cse8 .cse10 .cse11 .cse14 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse16 .cse17 .cse18 .cse19 .cse2 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse21 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse4 .cse22 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= .cse31 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse29 .cse23 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse30 .cse24 (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse31 (+ ~a_t~0 ~c_rsp_d~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse16 .cse17 .cse18 .cse19 .cse2 .cse20 .cse21 .cse4 .cse22 .cse26 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse23 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse27 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse28)))) [2021-10-13 00:49:38,839 INFO L857 garLoopResultBuilder]: For program point L976(lines 976 980) no Hoare annotation was computed. [2021-10-13 00:49:38,839 INFO L857 garLoopResultBuilder]: For program point L448(lines 136 482) no Hoare annotation was computed. [2021-10-13 00:49:38,839 INFO L853 garLoopResultBuilder]: At program point L581(lines 574 618) the Hoare annotation is: (let ((.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse14 (= ~a_t~0 0)) (.cse20 (<= 2 ~c_m_ev~0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse13 (let ((.cse21 (= ~m_run_pc~0 6))) (or (and .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse21 (<= 2 ULTIMATE.start_m_run_~a~0) .cse20 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse15 .cse16 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse18 .cse19 .cse21 .cse14 .cse20)))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 2 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= .cse6 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 (= ~a_t~0 1) .cse10 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_a~0 2) (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_a~0 1) .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13) (and .cse0 .cse1 (= ~c_req_a~0 0) .cse15 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse18 .cse19 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse20 .cse12 (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,840 INFO L857 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-10-13 00:49:38,840 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 127) no Hoare annotation was computed. [2021-10-13 00:49:38,840 INFO L857 garLoopResultBuilder]: For program point L1044(lines 1044 1048) no Hoare annotation was computed. [2021-10-13 00:49:38,840 INFO L853 garLoopResultBuilder]: At program point L120(lines 103 845) the Hoare annotation is: false [2021-10-13 00:49:38,840 INFO L857 garLoopResultBuilder]: For program point L913(lines 913 966) no Hoare annotation was computed. [2021-10-13 00:49:38,841 INFO L853 garLoopResultBuilder]: At program point L781(lines 774 809) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (<= 6 ~m_run_pc~0)) (.cse16 (not (= ~c_m_lock~0 1))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6))) (or (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) .cse11 (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse11)))) [2021-10-13 00:49:38,841 INFO L853 garLoopResultBuilder]: At program point L715(lines 708 725) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse8 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse8 (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse12 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse8 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,841 INFO L857 garLoopResultBuilder]: For program point L583(lines 583 587) no Hoare annotation was computed. [2021-10-13 00:49:38,841 INFO L860 garLoopResultBuilder]: At program point L1376(lines 1353 1378) the Hoare annotation is: true [2021-10-13 00:49:38,842 INFO L853 garLoopResultBuilder]: At program point L319(lines 289 320) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse10 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse11 (<= 51 ~s_memory1~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse10 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse11 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse4 (= ~a_t~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse10 .cse3 (<= 52 ~s_memory2~0) .cse11 (<= ~s_memory2~0 52) .cse4 .cse5 .cse6 .cse7 .cse8 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse9 (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,842 INFO L857 garLoopResultBuilder]: For program point L914(lines 914 918) no Hoare annotation was computed. [2021-10-13 00:49:38,842 INFO L857 garLoopResultBuilder]: For program point L716(lines 487 839) no Hoare annotation was computed. [2021-10-13 00:49:38,842 INFO L853 garLoopResultBuilder]: At program point L1245(lines 1238 1255) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 00:49:38,842 INFO L857 garLoopResultBuilder]: For program point L1179-1(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 00:49:38,842 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 126) no Hoare annotation was computed. [2021-10-13 00:49:38,843 INFO L857 garLoopResultBuilder]: For program point L783(lines 783 787) no Hoare annotation was computed. [2021-10-13 00:49:38,843 INFO L857 garLoopResultBuilder]: For program point L717(lines 717 721) no Hoare annotation was computed. [2021-10-13 00:49:38,843 INFO L853 garLoopResultBuilder]: At program point L387(lines 380 397) the Hoare annotation is: (let ((.cse3 (<= ~s_memory1~0 51)) (.cse5 (<= 51 ~s_memory1~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 .cse4 (<= 52 ~s_memory2~0) .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 00:49:38,843 INFO L853 garLoopResultBuilder]: At program point L255(lines 248 265) the Hoare annotation is: (let ((.cse22 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse21 (= ~m_run_pc~0 0)) (.cse20 (= ~c_empty_rsp~0 1))) (let ((.cse2 (<= 50 ~s_memory0~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (<= ~s_memory0~0 50)) (.cse8 (or (and .cse20 .cse21) (and .cse20 (= ~m_run_pc~0 3)))) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_req_type~0 0))) (.cse11 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse19 (= ~s_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= .cse22 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 .cse22)) (.cse15 (<= ~c_req_d~0 .cse22)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse17 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse18 (<= .cse22 ~c_req_d~0))) (or (and (<= 2 ~c_req_a~0) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse2 (<= ~s_memory1~0 51) .cse3 (<= 51 ~s_memory1~0) .cse4 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse5 .cse6 .cse7 (<= 2 ULTIMATE.start_m_run_~a~0) .cse8 (<= ~c_req_a~0 2) (<= ~c_req_d~0 52) .cse9 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse10 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse11 .cse0 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse7 .cse16 .cse8 .cse17 .cse9 .cse10 .cse18) (and .cse0 .cse1 .cse2 (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse3 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 .cse6 .cse7 .cse8 .cse17 (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse11 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse3 .cse19 .cse12 .cse7 .cse20 .cse16 .cse21 .cse10) (and .cse11 .cse0 .cse1 .cse19 .cse12 .cse13 .cse14 .cse15 .cse5 .cse7 .cse20 .cse16 .cse17 .cse9 .cse21 .cse18)))) [2021-10-13 00:49:38,844 INFO L853 garLoopResultBuilder]: At program point L123(lines 103 845) the Hoare annotation is: (let ((.cse29 (+ 51 ~req_tt_a~0)) (.cse25 (= ~c_empty_rsp~0 1)) (.cse16 (= ~a_t~0 0)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse28 (<= 1 ~c_m_lock~0)) (.cse20 (<= 1 ~a_t~0)) (.cse21 (not (= ~s_run_st~0 0))) (.cse22 (= 2 ~s_run_pc~0)) (.cse23 (= ~c_empty_req~0 1)) (.cse24 (= 2 ~c_write_rsp_ev~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse27 (<= 2 ~c_m_ev~0))) (let ((.cse8 (<= 51 ~s_memory1~0)) (.cse11 (= ~req_tt_a~0 2)) (.cse12 (<= 2 ~a_t~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= ~req_tt_a~0 1)) (.cse14 (or (and .cse19 .cse28 .cse21 .cse22 .cse23 .cse24 .cse26 .cse16 .cse27) (and .cse19 .cse28 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27))) (.cse18 (= ~a_t~0 1)) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (or (and .cse19 .cse28 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27) (and .cse19 .cse28 .cse22 .cse24 .cse25 .cse26 .cse16 .cse27))) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse13 (= ~req_tt_a~0 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse15 (<= .cse29 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= 2 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_req_a~0 2) .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse13 .cse14 .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse10 (<= ~c_rsp_d~0 50) .cse16 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_req_a~0 1) .cse5 .cse6 .cse17 .cse7 .cse9 .cse18 .cse15 .cse10) (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse12) (and .cse26 (or (and .cse19 .cse28 .cse20 .cse21 .cse22 .cse24 .cse25 .cse27) (and .cse19 .cse28 .cse21 .cse22 .cse24 .cse25 .cse16 .cse27))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse17 (<= .cse29 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse14 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse18 .cse15 (<= .cse29 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse29 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse4 .cse5 .cse13 .cse7 .cse9 .cse15 .cse10 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse16)))) [2021-10-13 00:49:38,844 INFO L857 garLoopResultBuilder]: For program point L388(lines 380 397) no Hoare annotation was computed. [2021-10-13 00:49:38,844 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 00:49:38,844 INFO L857 garLoopResultBuilder]: For program point L256(lines 136 482) no Hoare annotation was computed. [2021-10-13 00:49:38,844 INFO L857 garLoopResultBuilder]: For program point L1247(lines 1247 1251) no Hoare annotation was computed. [2021-10-13 00:49:38,845 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 393) no Hoare annotation was computed. [2021-10-13 00:49:38,845 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 261) no Hoare annotation was computed. [2021-10-13 00:49:38,845 INFO L853 garLoopResultBuilder]: At program point L1050(lines 1043 1087) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse31 (+ 51 ~req_tt_a~0))) (let ((.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= ~c_req_d~0 50)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse11 (= ~m_run_pc~0 3)) (.cse29 (= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (= ~a_t~0 1)) (.cse24 (<= .cse31 (+ ~s_memory1~0 ~a_t~0))) (.cse16 (let ((.cse32 (= ~m_run_pc~0 6))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse25 .cse8 .cse32 .cse14) (and .cse0 .cse1 .cse3 .cse25 .cse8 .cse32 .cse12 .cse14)))) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse2 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse22 (<= 52 ~s_memory2~0)) (.cse26 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse10 (<= ~s_memory0~0 50)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~req_type~1 1) .cse15) (and .cse16 .cse17 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse18 .cse19 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse20 .cse21 .cse4 (= ~req_tt_a~0 0) .cse22 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse23 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse24 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse20 .cse4 .cse22 .cse26 .cse23 .cse25 .cse8 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse27 (<= ~c_req_d~0 52) .cse14 .cse28) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse20 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse26 .cse29 (<= ~c_req_d~0 51) .cse25 .cse30 .cse8 .cse10 .cse11 .cse14 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse16 .cse17 .cse18 .cse19 .cse2 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse21 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse4 .cse22 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= .cse31 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse29 .cse23 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse30 .cse24 (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse31 (+ ~a_t~0 ~c_rsp_d~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse16 .cse17 .cse18 .cse19 .cse2 .cse20 .cse21 .cse4 .cse22 .cse26 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse23 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse27 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse28)))) [2021-10-13 00:49:38,845 INFO L857 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2021-10-13 00:49:38,846 INFO L853 garLoopResultBuilder]: At program point L589(lines 582 617) the Hoare annotation is: (let ((.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse14 (= ~a_t~0 0)) (.cse20 (<= 2 ~c_m_ev~0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse13 (let ((.cse21 (= ~m_run_pc~0 6))) (or (and .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse21 (<= 2 ULTIMATE.start_m_run_~a~0) .cse20 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse15 .cse16 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse18 .cse19 .cse21 .cse14 .cse20)))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 2 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= .cse6 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 (= ~a_t~0 1) .cse10 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_a~0 2) (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_a~0 1) .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13) (and .cse0 .cse1 (= ~c_req_a~0 0) .cse15 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse18 (<= 52 ULTIMATE.start_s_run_~req_d~1) (or (and .cse19 (= ~m_run_pc~0 0)) (and .cse19 (= ~m_run_pc~0 3))) .cse20 .cse12 (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,846 INFO L857 garLoopResultBuilder]: For program point L1052(lines 1052 1056) no Hoare annotation was computed. [2021-10-13 00:49:38,846 INFO L853 garLoopResultBuilder]: At program point L920(lines 913 966) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (= ~a_t~0 1)) (.cse25 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse26 (= ~c_req_a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse34 (<= 2 ~c_req_a~0)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (<= 52 ~s_memory2~0)) (.cse35 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse24 (let ((.cse41 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse41 .cse33 .cse15) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse8 .cse10 .cse12 .cse13 .cse41 .cse15)))) (.cse36 (< 1 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse11 (<= ~s_memory0~0 50)) (.cse38 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse40 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse17 .cse18 .cse19 .cse3 .cse4 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse21 (= ~req_tt_a~0 1) .cse22 .cse7 .cse23 .cse24 .cse9 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse2 .cse6 .cse27 .cse28 .cse29 .cse8 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse17 .cse18 .cse26 .cse19 .cse3 .cse20 .cse21 (= ~req_tt_a~0 0) .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse11 .cse32 .cse33) (and .cse0 .cse26 .cse1 .cse2 .cse6 (= ~s_run_pc~0 0) .cse27 .cse28 .cse29 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse34 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse20 .cse6 .cse35 .cse8 .cse36 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse39 (<= ~c_req_d~0 52) .cse15 .cse16 .cse40) (and .cse17 .cse34 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse35 .cse23 .cse24 .cse36 .cse37 .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse38 .cse39 (= ~req_tt_a~0 2) .cse40)))) [2021-10-13 00:49:38,846 INFO L857 garLoopResultBuilder]: For program point L326(lines 326 379) no Hoare annotation was computed. [2021-10-13 00:49:38,847 INFO L857 garLoopResultBuilder]: For program point L1185(lines 1185 1189) no Hoare annotation was computed. [2021-10-13 00:49:38,847 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2021-10-13 00:49:38,847 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 1001) no Hoare annotation was computed. [2021-10-13 00:49:38,847 INFO L853 garLoopResultBuilder]: At program point L789(lines 782 808) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (<= 6 ~m_run_pc~0)) (.cse16 (not (= ~c_m_lock~0 1))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6))) (or (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) .cse11 (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse11)))) [2021-10-13 00:49:38,847 INFO L857 garLoopResultBuilder]: For program point L591(lines 591 595) no Hoare annotation was computed. [2021-10-13 00:49:38,848 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-10-13 00:49:38,848 INFO L857 garLoopResultBuilder]: For program point L922(lines 922 926) no Hoare annotation was computed. [2021-10-13 00:49:38,848 INFO L853 garLoopResultBuilder]: At program point L526(lines 496 527) the Hoare annotation is: (let ((.cse22 (+ 51 ~req_tt_a~0)) (.cse21 (= ~a_t~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= 51 ~s_memory1~0)) (.cse19 (let ((.cse23 (<= 6 ~m_run_pc~0)) (.cse24 (= ~m_run_pc~0 6))) (or (and .cse1 .cse5 .cse23 .cse8 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse11 .cse13 .cse14 .cse24 .cse21 .cse15) (and .cse1 (<= 1 ~a_t~0) .cse5 .cse23 .cse8 .cse10 .cse11 .cse13 .cse14 .cse24 (<= 2 ULTIMATE.start_m_run_~a~0) .cse15 (<= ULTIMATE.start_m_run_~a~0 2))))) (.cse9 (<= ~s_memory2~0 52)) (.cse20 (<= .cse22 (+ ~s_memory1~0 ~a_t~0))) (.cse12 (<= ~s_memory0~0 50)) (.cse16 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 52 ~c_req_d~0) .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13 .cse14 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse15 .cse16 (<= 2 ~a_t~0)) (and .cse0 .cse17 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse18 .cse6 .cse7 .cse19 .cse9 .cse20 .cse12 .cse21 .cse16) (and .cse0 .cse17 .cse2 (<= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse18 (<= .cse22 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 .cse7 (<= .cse22 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse19 .cse9 (= ~a_t~0 1) .cse20 (<= .cse22 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse12 (<= .cse22 (+ ~a_t~0 ~c_rsp_d~0)) .cse16 (<= ULTIMATE.start_m_run_~req_a___0~0 2))))) [2021-10-13 00:49:38,848 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 67) no Hoare annotation was computed. [2021-10-13 00:49:38,848 INFO L857 garLoopResultBuilder]: For program point L791(lines 791 795) no Hoare annotation was computed. [2021-10-13 00:49:38,849 INFO L857 garLoopResultBuilder]: For program point L1320(lines 1320 1324) no Hoare annotation was computed. [2021-10-13 00:49:38,849 INFO L857 garLoopResultBuilder]: For program point L1122(lines 1121 1162) no Hoare annotation was computed. [2021-10-13 00:49:38,849 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 00:49:38,849 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,849 INFO L857 garLoopResultBuilder]: For program point L463(lines 463 467) no Hoare annotation was computed. [2021-10-13 00:49:38,849 INFO L853 garLoopResultBuilder]: At program point L133(lines 103 845) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (not .cse13)) (.cse2 (= ~s_run_pc~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse12 .cse7) (and .cse8 .cse9 .cse10 .cse1 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11 .cse12 .cse7)))) [2021-10-13 00:49:38,850 INFO L853 garLoopResultBuilder]: At program point L1058(lines 1051 1086) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse13 (+ 51 ~req_tt_a~0))) (let ((.cse10 (<= .cse13 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (let ((.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (<= 2 ~c_m_ev~0))) (or (and .cse14 (<= 1 ULTIMATE.start_m_run_~a~0) .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19) (and .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse12 .cse19)))) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse2 (= ~c_req_type~0 0)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~c_write_rsp_ev~0 1)) (.cse8 (<= 52 ~s_memory2~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse7 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 (<= ~c_rsp_d~0 50) .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse13 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= .cse13 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse10 (<= .cse13 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (<= .cse13 (+ ~a_t~0 ~c_rsp_d~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,850 INFO L853 garLoopResultBuilder]: At program point L530-2(lines 530 558) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (<= 2 ~c_m_ev~0)) (.cse22 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse22 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse23 (= ~m_run_pc~0 6))) (or (and .cse14 .cse15 .cse16 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse18 .cse19 .cse20 .cse23 .cse12 .cse21) (and .cse14 .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 (<= 2 ULTIMATE.start_m_run_~a~0) .cse21 (<= ULTIMATE.start_m_run_~a~0 2))))) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= 52 ~c_req_d~0) .cse14 .cse15 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse18 .cse10 .cse19 .cse20 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse21 .cse13 (<= 2 ~a_t~0)) (and .cse0 .cse1 .cse2 (<= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (<= .cse22 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 .cse7 (<= .cse22 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse8 (= ~a_t~0 1) .cse9 (<= .cse22 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 .cse11 (<= .cse22 (+ ~a_t~0 ~c_rsp_d~0)) .cse13 (<= ULTIMATE.start_m_run_~req_a___0~0 2))))) [2021-10-13 00:49:38,850 INFO L853 garLoopResultBuilder]: At program point L1191(lines 1184 1237) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 00:49:38,850 INFO L857 garLoopResultBuilder]: For program point L993(lines 993 1000) no Hoare annotation was computed. [2021-10-13 00:49:38,851 INFO L853 garLoopResultBuilder]: At program point L597(lines 590 616) the Hoare annotation is: (let ((.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse14 (= ~a_t~0 0)) (.cse20 (<= 2 ~c_m_ev~0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse13 (let ((.cse21 (= ~m_run_pc~0 6))) (or (and .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse21 (<= 2 ULTIMATE.start_m_run_~a~0) .cse20 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse15 .cse16 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse18 .cse19 .cse21 .cse14 .cse20)))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 2 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= .cse6 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 (= ~a_t~0 1) .cse10 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_a~0 2) (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_a~0 1) .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13) (and .cse0 .cse1 (= ~c_req_a~0 0) .cse15 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse18 (<= 52 ULTIMATE.start_s_run_~req_d~1) (or (and .cse19 (= ~m_run_pc~0 0)) (and .cse19 (= ~m_run_pc~0 3))) .cse20 .cse12 (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,851 INFO L857 garLoopResultBuilder]: For program point L531(lines 530 558) no Hoare annotation was computed. [2021-10-13 00:49:38,851 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2021-10-13 00:49:38,851 INFO L853 garLoopResultBuilder]: At program point L399-1(lines 399 405) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse10 (<= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse11 (<= 51 ~s_memory1~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (<= ~s_memory0~0 50)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ~c_req_d~0 50) .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse10 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse11 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse3 (= ~a_t~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse10 .cse2 (<= 52 ~s_memory2~0) .cse11 (<= ~s_memory2~0 52) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse9 (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,852 INFO L853 garLoopResultBuilder]: At program point L333(lines 326 379) the Hoare annotation is: (let ((.cse3 (<= ~s_memory1~0 51)) (.cse5 (<= 51 ~s_memory1~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 .cse4 (<= 52 ~s_memory2~0) .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 00:49:38,852 INFO L857 garLoopResultBuilder]: For program point L1258(line 1258) no Hoare annotation was computed. [2021-10-13 00:49:38,852 INFO L857 garLoopResultBuilder]: For program point L1126(lines 1126 1130) no Hoare annotation was computed. [2021-10-13 00:49:38,852 INFO L857 garLoopResultBuilder]: For program point L1126-1(lines 1121 1162) no Hoare annotation was computed. [2021-10-13 00:49:38,852 INFO L853 garLoopResultBuilder]: At program point L69(lines 56 70) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (= 2 ~s_run_pc~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse17 (= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (<= 2 ~c_m_ev~0))) (or (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse11 .cse20)))) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse7 (<= .cse12 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 2) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,853 INFO L857 garLoopResultBuilder]: For program point L1060(lines 1060 1064) no Hoare annotation was computed. [2021-10-13 00:49:38,853 INFO L853 garLoopResultBuilder]: At program point L928(lines 921 965) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (= ~a_t~0 1)) (.cse25 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse26 (= ~c_req_a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse34 (<= 2 ~c_req_a~0)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (<= 52 ~s_memory2~0)) (.cse35 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse24 (let ((.cse41 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse41 .cse33 .cse15) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse8 .cse10 .cse12 .cse13 .cse41 .cse15)))) (.cse36 (< 1 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse11 (<= ~s_memory0~0 50)) (.cse38 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse40 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse17 .cse18 .cse19 .cse3 .cse4 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse21 (= ~req_tt_a~0 1) .cse22 .cse7 .cse23 .cse24 .cse9 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse2 .cse6 .cse27 .cse28 .cse29 .cse8 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse17 .cse18 .cse26 .cse19 .cse3 .cse20 .cse21 (= ~req_tt_a~0 0) .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse11 .cse32 .cse33) (and .cse0 .cse26 .cse1 .cse2 .cse6 (= ~s_run_pc~0 0) .cse27 .cse28 .cse29 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse34 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse20 .cse6 .cse35 .cse8 .cse36 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse39 (<= ~c_req_d~0 52) .cse15 .cse16 .cse40) (and .cse17 .cse34 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse35 .cse23 .cse24 .cse36 .cse37 .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse38 .cse39 (= ~req_tt_a~0 2) .cse40)))) [2021-10-13 00:49:38,853 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 536) no Hoare annotation was computed. [2021-10-13 00:49:38,853 INFO L857 garLoopResultBuilder]: For program point L1193(lines 1193 1197) no Hoare annotation was computed. [2021-10-13 00:49:38,854 INFO L853 garLoopResultBuilder]: At program point L136-2(lines 136 482) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse9 (= ~a_t~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 50 ~s_memory0~0)) (.cse13 (<= ~s_memory1~0 51)) (.cse15 (<= 51 ~s_memory1~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= ~s_memory0~0 50)) (.cse18 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse13 .cse14 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse15 .cse5 (<= ~c_req_d~0 51) .cse16 (= ~a_t~0 1) .cse6 .cse17 .cse7 .cse8 .cse18 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse14 (<= 50 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 50) .cse17 .cse7 .cse8 .cse18 .cse9 (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= 3 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse12 .cse13 .cse14 (<= 52 ~s_memory2~0) .cse15 .cse5 (<= ~s_memory2~0 52) .cse16 .cse6 .cse17 .cse7 .cse8 .cse18 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse10 (<= 2 ~a_t~0)) (and .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11))) [2021-10-13 00:49:38,854 INFO L857 garLoopResultBuilder]: For program point L863(lines 863 875) no Hoare annotation was computed. [2021-10-13 00:49:38,854 INFO L853 garLoopResultBuilder]: At program point L797(lines 790 807) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (<= 6 ~m_run_pc~0)) (.cse16 (not (= ~c_m_lock~0 1))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6))) (or (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) .cse11 (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse11)))) [2021-10-13 00:49:38,855 INFO L857 garLoopResultBuilder]: For program point L731(lines 731 735) no Hoare annotation was computed. [2021-10-13 00:49:38,855 INFO L857 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-10-13 00:49:38,855 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2021-10-13 00:49:38,855 INFO L853 garLoopResultBuilder]: At program point L1326(lines 1319 1336) the Hoare annotation is: (let ((.cse15 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 1 ~a_t~0)) (.cse17 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse18 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse13 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 6 ~m_run_pc~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse1 .cse3 .cse4 .cse13 .cse14) (and .cse10 .cse15 .cse11 .cse16 .cse0 .cse12 .cse1 .cse3 .cse4 .cse14))) .cse17) (and .cse10 .cse15 .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse14) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse18)) (and .cse18 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse9))) [2021-10-13 00:49:38,855 INFO L857 garLoopResultBuilder]: For program point L137(lines 136 482) no Hoare annotation was computed. [2021-10-13 00:49:38,855 INFO L857 garLoopResultBuilder]: For program point L930(lines 930 934) no Hoare annotation was computed. [2021-10-13 00:49:38,856 INFO L857 garLoopResultBuilder]: For program point L798(lines 487 839) no Hoare annotation was computed. [2021-10-13 00:49:38,856 INFO L857 garLoopResultBuilder]: For program point L1327(lines 1257 1346) no Hoare annotation was computed. [2021-10-13 00:49:38,856 INFO L857 garLoopResultBuilder]: For program point L138(lines 138 142) no Hoare annotation was computed. [2021-10-13 00:49:38,856 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 803) no Hoare annotation was computed. [2021-10-13 00:49:38,856 INFO L853 garLoopResultBuilder]: At program point L469(lines 462 479) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,856 INFO L857 garLoopResultBuilder]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2021-10-13 00:49:38,857 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 275) no Hoare annotation was computed. [2021-10-13 00:49:38,857 INFO L857 garLoopResultBuilder]: For program point L866(lines 866 874) no Hoare annotation was computed. [2021-10-13 00:49:38,857 INFO L857 garLoopResultBuilder]: For program point L470(lines 462 479) no Hoare annotation was computed. [2021-10-13 00:49:38,857 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 81) no Hoare annotation was computed. [2021-10-13 00:49:38,857 INFO L853 garLoopResultBuilder]: At program point L867(lines 862 1113) the Hoare annotation is: false [2021-10-13 00:49:38,858 INFO L853 garLoopResultBuilder]: At program point L669(lines 639 670) the Hoare annotation is: (let ((.cse10 (+ 51 ~req_tt_a~0)) (.cse12 (= ~a_t~0 0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse12 .cse20) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse11 (<= .cse10 (+ ~s_memory1~0 ~a_t~0))) (.cse9 (<= ~s_memory0~0 50))) (or (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse10 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse11 (<= .cse10 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse9 (<= .cse10 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse9 (<= ~c_rsp_d~0 50) .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0))))) [2021-10-13 00:49:38,858 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 475) no Hoare annotation was computed. [2021-10-13 00:49:38,858 INFO L853 garLoopResultBuilder]: At program point L1132(lines 1121 1162) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse31 (+ 51 ~req_tt_a~0)) (.cse25 (= ~c_empty_rsp~0 1)) (.cse48 (= ULTIMATE.start_m_run_~a~0 0)) (.cse26 (= ~a_t~0 0)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse51 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse52 (<= 1 ~a_t~0)) (.cse19 (not (= ~s_run_st~0 0))) (.cse21 (= ~m_run_st~0 0)) (.cse22 (= 2 ~s_run_pc~0)) (.cse23 (= ~c_empty_req~0 1)) (.cse24 (= 2 ~c_write_rsp_ev~0)) (.cse53 (= ~m_run_pc~0 6)) (.cse27 (<= 2 ~c_m_ev~0))) (let ((.cse1 (<= 2 ~c_req_a~0)) (.cse40 (<= 52 ~c_req_d~0)) (.cse13 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ~c_req_a~0 2)) (.cse43 (<= ~c_req_d~0 52)) (.cse41 (<= ULTIMATE.start_s_run_~req_d~1 52)) (.cse46 (= ~req_tt_a~0 0)) (.cse47 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse42 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= 51 ~s_memory1~0)) (.cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse35 (or (and .cse17 .cse36 .cse19 .cse48 .cse21 .cse22 .cse23 .cse24 .cse53 .cse26 .cse27) (and .cse17 .cse51 .cse36 .cse52 .cse19 .cse21 .cse22 .cse23 .cse24 .cse53 .cse27))) (.cse15 (= ~req_tt_a~0 2)) (.cse16 (<= 2 ~a_t~0)) (.cse37 (<= 51 ~c_req_d~0)) (.cse54 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse38 (<= ~c_req_d~0 51)) (.cse55 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse56 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse57 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse20 (not (= ~c_m_lock~0 1))) (.cse28 (= ~m_run_pc~0 0)) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse58 (= ~c_req_a~0 1)) (.cse5 (<= ~s_memory1~0 51)) (.cse29 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse30 (= ~req_tt_a~0 1)) (.cse7 (<= 52 ~s_memory2~0)) (.cse32 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (or (and .cse17 .cse36 .cse48 .cse22 .cse24 .cse25 .cse53 .cse26 .cse27) (and .cse17 .cse51 .cse36 .cse52 .cse22 .cse24 .cse25 .cse53 .cse27))) (.cse10 (<= ~s_memory2~0 52)) (.cse33 (= ~a_t~0 1)) (.cse34 (<= .cse31 (+ ~s_memory1~0 ~a_t~0))) (.cse11 (<= ~s_memory0~0 50)) (.cse18 (= ~c_req_a~0 0)) (.cse44 (= ~c_req_type~0 1)) (.cse59 (= ~s_run_pc~0 0)) (.cse49 (<= 50 ~c_req_d~0)) (.cse50 (<= ~c_req_d~0 50)) (.cse39 (= ~m_run_pc~0 3)) (.cse45 (not .cse2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse30 (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse32 .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse33 .cse34 (<= .cse31 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 .cse35 (<= .cse31 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse17 .cse36 (<= ULTIMATE.start_s_memory_write_~v 51) .cse4 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse5 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse37 .cse8 .cse32 .cse38 .cse21 .cse22 .cse33 .cse23 .cse11 .cse24 .cse39 .cse27 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse40 .cse17 .cse36 .cse3 .cse41 .cse4 .cse5 .cse19 .cse7 .cse8 .cse21 .cse10 .cse22 .cse23 .cse11 .cse24 .cse39 .cse42 .cse13 .cse43 .cse27 .cse16) (and .cse1 .cse40 .cse17 .cse36 .cse44 .cse4 .cse5 .cse8 .cse22 .cse11 .cse24 .cse25 .cse39 .cse13 .cse14 .cse43 .cse27 .cse45 .cse16) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse46 .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse47 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse34 .cse11 (<= ~c_rsp_d~0 50) .cse26 .cse35 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse17 .cse18 .cse36 .cse44 .cse48 .cse49 .cse22 .cse50 .cse24 .cse25 .cse39 .cse26 .cse27 .cse45) (and (or (and .cse17 .cse36 .cse19 .cse48 .cse22 .cse24 .cse25 .cse26 .cse27) (and .cse17 .cse51 .cse36 .cse52 .cse19 .cse22 .cse24 .cse25 .cse27)) .cse53) (and .cse0 .cse2 .cse18 .cse3 .cse41 .cse4 .cse5 .cse46 .cse7 .cse9 .cse10 .cse47 .cse34 .cse11 .cse42 .cse26) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse2 (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ~s_memory1~0 ULTIMATE.start_m_run_~a~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse12 .cse35 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) .cse15 (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse16) (and .cse17 .cse36 .cse4 .cse19 .cse48 .cse49 .cse54 .cse21 .cse22 .cse55 .cse23 .cse50 .cse11 .cse24 .cse39 .cse26 .cse56 .cse27 .cse57) (and .cse17 .cse51 .cse36 .cse44 (<= ~a_t~0 1) .cse52 .cse4 .cse58 .cse37 (<= ULTIMATE.start_m_run_~a~0 1) .cse54 .cse38 .cse22 .cse55 .cse11 .cse24 .cse25 .cse39 .cse56 .cse27 .cse57 .cse45) (and .cse2 .cse17 .cse18 .cse59 .cse20 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse17 .cse51 .cse52 .cse19 .cse22 .cse23 .cse24 .cse25 .cse53 .cse27) (and .cse22 .cse23 .cse24 .cse25 .cse39) (and .cse17 .cse19 .cse22 .cse24 .cse25 .cse39) (and .cse18 .cse19 .cse59 .cse24 .cse25 .cse39 .cse45) (and .cse18 .cse19 .cse59 .cse20 .cse21 .cse23 .cse24 .cse25 .cse28) (and .cse0 .cse2 .cse3 .cse4 .cse58 .cse5 .cse29 .cse6 .cse30 .cse7 .cse32 .cse9 .cse10 .cse33 .cse34 .cse11) (and .cse17 .cse18 .cse36 .cse44 .cse59 .cse48 .cse49 .cse50 .cse24 .cse25 .cse39 .cse26 .cse27 .cse45)))) [2021-10-13 00:49:38,859 INFO L853 garLoopResultBuilder]: At program point L1066(lines 1059 1085) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse13 (+ 51 ~req_tt_a~0))) (let ((.cse10 (<= .cse13 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (let ((.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (<= 2 ~c_m_ev~0))) (or (and .cse14 (<= 1 ULTIMATE.start_m_run_~a~0) .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19) (and .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse12 .cse19)))) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse2 (= ~c_req_type~0 0)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~c_write_rsp_ev~0 1)) (.cse8 (<= 52 ~s_memory2~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse7 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 (<= ~c_rsp_d~0 50) .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse13 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= .cse13 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse10 (<= .cse13 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (<= .cse13 (+ ~a_t~0 ~c_rsp_d~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,859 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,859 INFO L857 garLoopResultBuilder]: For program point L1265(lines 1265 1318) no Hoare annotation was computed. [2021-10-13 00:49:38,859 INFO L853 garLoopResultBuilder]: At program point L1199(lines 1192 1236) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 00:49:38,860 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 81) no Hoare annotation was computed. [2021-10-13 00:49:38,860 INFO L857 garLoopResultBuilder]: For program point L869(lines 869 873) no Hoare annotation was computed. [2021-10-13 00:49:38,860 INFO L853 garLoopResultBuilder]: At program point L737(lines 730 747) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse8 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse8 (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse12 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse8 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,860 INFO L853 garLoopResultBuilder]: At program point L605(lines 598 615) the Hoare annotation is: (let ((.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse11 (= ~a_t~0 0)) (.cse20 (<= 2 ~c_m_ev~0)) (.cse14 (+ 51 ~req_tt_a~0))) (let ((.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= .cse14 (+ ~s_memory1~0 ~a_t~0))) (.cse12 (let ((.cse21 (= ~m_run_pc~0 6))) (or (and (<= 1 ULTIMATE.start_m_run_~a~0) .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse21 .cse20) (and .cse15 .cse16 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse18 .cse19 .cse21 .cse11 .cse20)))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse10 (<= ~s_memory0~0 50)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_a~0 1) .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= 2 ~c_req_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse14 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 .cse7 (<= .cse14 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse8 (= ~a_t~0 1) .cse9 (<= .cse14 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse12 (<= ~c_req_a~0 2) (<= .cse14 (+ ~a_t~0 ~c_rsp_d~0)) .cse13 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse0 .cse1 (= ~c_req_a~0 0) .cse15 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse16 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse18 (<= 52 ULTIMATE.start_s_run_~req_d~1) (or (and .cse19 (= ~m_run_pc~0 0)) (and .cse19 (= ~m_run_pc~0 3))) .cse20 .cse13 (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,861 INFO L853 garLoopResultBuilder]: At program point L341(lines 334 378) the Hoare annotation is: (let ((.cse3 (<= ~s_memory1~0 51)) (.cse5 (<= 51 ~s_memory1~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 .cse4 (<= 52 ~s_memory2~0) .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 00:49:38,861 INFO L857 garLoopResultBuilder]: For program point L1266(lines 1266 1270) no Hoare annotation was computed. [2021-10-13 00:49:38,861 INFO L853 garLoopResultBuilder]: At program point L209(lines 179 210) the Hoare annotation is: (let ((.cse20 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse9 (<= 50 ~s_memory0~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse1 (= ~s_run_pc~0 0)) (.cse16 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= .cse20 ULTIMATE.start_m_run_~req_d~0)) (.cse19 (<= ULTIMATE.start_m_run_~req_d~0 .cse20)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse15 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse6 (= ~m_run_pc~0 0))) (or (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse9 (<= ~s_memory1~0 51) .cse0 (<= 51 ~s_memory1~0) .cse10 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse11 .cse12 .cse3 .cse4 .cse13 (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse7 (<= 1 ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_m_run_~req_a~0 1) .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 (<= ~c_req_d~0 50) .cse12 .cse3 .cse4 .cse13 .cse15 (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse16 .cse7 .cse17 .cse8 .cse1 .cse2 .cse18 .cse19 .cse11 .cse3 .cse4 .cse5 .cse15 .cse14 .cse6) (and .cse16 .cse7 .cse17 .cse8 .cse0 .cse2 .cse18 .cse19 .cse10 .cse11 .cse3 .cse4 .cse5 .cse15 .cse14 .cse6)))) [2021-10-13 00:49:38,861 INFO L857 garLoopResultBuilder]: For program point L1068(lines 1068 1072) no Hoare annotation was computed. [2021-10-13 00:49:38,862 INFO L853 garLoopResultBuilder]: At program point L936(lines 929 964) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (= ~a_t~0 1)) (.cse25 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse26 (= ~c_req_a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse34 (<= 2 ~c_req_a~0)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (<= 52 ~s_memory2~0)) (.cse35 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse24 (let ((.cse41 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse41 .cse33 .cse15) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse8 .cse10 .cse12 .cse13 .cse41 .cse15)))) (.cse36 (< 1 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse11 (<= ~s_memory0~0 50)) (.cse38 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse40 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse17 .cse18 .cse19 .cse3 .cse4 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse21 (= ~req_tt_a~0 1) .cse22 .cse7 .cse23 .cse24 .cse9 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse2 .cse6 .cse27 .cse28 .cse29 .cse8 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse17 .cse18 .cse26 .cse19 .cse3 .cse20 .cse21 (= ~req_tt_a~0 0) .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse11 .cse32 .cse33) (and .cse0 .cse26 .cse1 .cse2 .cse6 (= ~s_run_pc~0 0) .cse27 .cse28 .cse29 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse34 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse20 .cse6 .cse35 .cse8 .cse36 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse39 (<= ~c_req_d~0 52) .cse15 .cse16 .cse40) (and .cse17 .cse34 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse35 .cse23 .cse24 .cse36 .cse37 .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse38 .cse39 (= ~req_tt_a~0 2) .cse40)))) [2021-10-13 00:49:38,862 INFO L853 garLoopResultBuilder]: At program point L870(lines 862 1113) the Hoare annotation is: (let ((.cse15 (= ~c_req_type~0 0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse10 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0))) (let ((.cse6 (= ~c_req_a~0 0)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse16 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse27 (= ~c_req_a~0 1)) (.cse19 (<= 52 ~s_memory2~0)) (.cse28 (= ULTIMATE.start_m_run_~a~0 1)) (.cse21 (<= ~s_memory2~0 52)) (.cse29 (= ~a_t~0 1)) (.cse30 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse23 (let ((.cse31 (= ~m_run_pc~0 6))) (or (and .cse5 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 (<= 1 ~a_t~0) .cse0 .cse1 .cse2 .cse3 .cse31 .cse11) (and .cse5 .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse31 .cse10 .cse11)))) (.cse14 (<= 2 ~c_req_a~0)) (.cse8 (= ~c_req_type~0 1)) (.cse17 (<= 50 ~s_memory0~0)) (.cse18 (<= ~s_memory1~0 51)) (.cse20 (<= 51 ~s_memory1~0)) (.cse22 (<= ~s_memory0~0 50)) (.cse4 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= ~c_req_a~0 2)) (.cse12 (not .cse15)) (.cse26 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 (= ~c_empty_req~0 1) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 (<= 50 ~c_req_d~0) .cse1 (<= ~c_req_d~0 50) .cse2 .cse3 .cse4 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse24 .cse25 (= ~req_tt_a~0 2) .cse26) (and .cse5 .cse7 .cse8 .cse17 .cse27 .cse0 (<= 51 ~c_req_d~0) .cse28 (<= ~c_req_d~0 51) .cse1 .cse29 .cse22 .cse2 .cse3 .cse4 (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse12) (and .cse13 .cse15 .cse6 .cse16 .cse17 .cse18 (= ~req_tt_a~0 0) .cse19 .cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse30 .cse22 .cse23 .cse10) (and .cse13 .cse15 .cse16 .cse17 .cse27 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ~req_tt_a~0 1) .cse19 .cse28 .cse21 .cse29 .cse30 .cse22 .cse23) (and .cse14 (<= 52 ~c_req_d~0) .cse5 .cse7 .cse8 .cse17 .cse18 .cse0 .cse20 .cse1 .cse22 .cse2 .cse3 .cse4 .cse24 .cse25 (<= ~c_req_d~0 52) .cse11 .cse12 .cse26)))) [2021-10-13 00:49:38,862 INFO L857 garLoopResultBuilder]: For program point L738(lines 730 747) no Hoare annotation was computed. [2021-10-13 00:49:38,863 INFO L857 garLoopResultBuilder]: For program point L606(lines 487 839) no Hoare annotation was computed. [2021-10-13 00:49:38,863 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,863 INFO L857 garLoopResultBuilder]: For program point L408(lines 408 461) no Hoare annotation was computed. [2021-10-13 00:49:38,863 INFO L857 garLoopResultBuilder]: For program point L1201(lines 1201 1205) no Hoare annotation was computed. [2021-10-13 00:49:38,863 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 81) no Hoare annotation was computed. [2021-10-13 00:49:38,863 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L1003-1(lines 878 1108) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L739(lines 739 743) no Hoare annotation was computed. [2021-10-13 00:49:38,864 INFO L857 garLoopResultBuilder]: For program point L607(lines 607 611) no Hoare annotation was computed. [2021-10-13 00:49:38,865 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-10-13 00:49:38,865 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-10-13 00:49:38,865 INFO L853 garLoopResultBuilder]: At program point L277(lines 270 287) the Hoare annotation is: (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse0 (= ~c_req_a~0 0)) (.cse2 (= ~s_run_pc~0 0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_req_type~0 0))) (and .cse1 (= 2 ~s_run_pc~0) .cse4 .cse5) (let ((.cse8 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse0 (<= 1 ~c_m_lock~0) (= ~c_req_type~0 1) .cse2 .cse3 (<= .cse8 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 .cse8) (<= ~c_req_d~0 .cse8) (= ULTIMATE.start_m_run_~req_type~0 1) .cse4 .cse5 .cse6 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse7 (<= .cse8 ~c_req_d~0))))) [2021-10-13 00:49:38,865 INFO L857 garLoopResultBuilder]: For program point L1136(lines 1136 1143) no Hoare annotation was computed. [2021-10-13 00:49:38,865 INFO L857 garLoopResultBuilder]: For program point L1004(lines 1003 1027) no Hoare annotation was computed. [2021-10-13 00:49:38,865 INFO L857 garLoopResultBuilder]: For program point L938(lines 938 942) no Hoare annotation was computed. [2021-10-13 00:49:38,866 INFO L853 garLoopResultBuilder]: At program point L13-3(lines 1 1378) the Hoare annotation is: (let ((.cse12 (+ 51 ~req_tt_a~0)) (.cse11 (= ~a_t~0 0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (= 2 ~s_run_pc~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse17 (= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (<= 2 ~c_m_ev~0))) (or (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse11 .cse20)))) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~s_memory1~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 2) (<= 2 ~a_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ~req_tt_a~0 1) .cse7 (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10)))) [2021-10-13 00:49:38,866 INFO L853 garLoopResultBuilder]: At program point L13-4(lines 72 84) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 50 ~c_req_d~0)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ~c_req_d~0 50)) (.cse18 (= ~a_t~0 0)) (.cse19 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= ~s_memory1~0 51)) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= ~s_memory0~0 50)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 (<= ~s_memory2~0 52) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse11 .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse15 .cse5 .cse16 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse11 .cse12 .cse20) (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse13 .cse14 .cse15 .cse16 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse11 .cse12 .cse20) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse12))) [2021-10-13 00:49:38,866 INFO L857 garLoopResultBuilder]: For program point L278(lines 270 287) no Hoare annotation was computed. [2021-10-13 00:49:38,866 INFO L857 garLoopResultBuilder]: For program point L1005(lines 1005 1009) no Hoare annotation was computed. [2021-10-13 00:49:38,866 INFO L857 garLoopResultBuilder]: For program point L279(lines 279 283) no Hoare annotation was computed. [2021-10-13 00:49:38,867 INFO L853 garLoopResultBuilder]: At program point L147-2(lines 147 175) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse3 (= ~s_run_pc~0 0)) (.cse17 (<= 50 ~s_memory0~0)) (.cse19 (<= ~s_memory0~0 50)) (.cse20 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (not (= ~c_m_lock~0 1))) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse18 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse16 .cse3 .cse4 .cse6 .cse8 .cse10 .cse11 .cse12 .cse15) (and .cse1 .cse17 (= ULTIMATE.start_m_run_~req_a~0 1) .cse16 (<= 50 ~c_req_d~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 (<= ~c_req_d~0 50) .cse19 .cse10 .cse11 .cse20 .cse13 (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse1 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse17 (<= ~s_memory1~0 51) .cse16 (<= 51 ~s_memory1~0) .cse6 .cse18 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse8 .cse9 .cse19 .cse10 .cse11 .cse20 (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2021-10-13 00:49:38,867 INFO L857 garLoopResultBuilder]: For program point L676(lines 676 729) no Hoare annotation was computed. [2021-10-13 00:49:38,867 INFO L857 garLoopResultBuilder]: For program point L148(lines 147 175) no Hoare annotation was computed. [2021-10-13 00:49:38,867 INFO L857 garLoopResultBuilder]: For program point L677(lines 677 681) no Hoare annotation was computed. [2021-10-13 00:49:38,867 INFO L853 garLoopResultBuilder]: At program point L1272(lines 1265 1318) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse11 .cse15 .cse0 .cse1 .cse3 .cse4 .cse13))) .cse16) (and .cse10 .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse13) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse9))) [2021-10-13 00:49:38,868 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 153) no Hoare annotation was computed. [2021-10-13 00:49:38,868 INFO L853 garLoopResultBuilder]: At program point L1074(lines 1067 1084) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse13 (+ 51 ~req_tt_a~0))) (let ((.cse10 (<= .cse13 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (let ((.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (<= 2 ~c_m_ev~0))) (or (and .cse14 (<= 1 ULTIMATE.start_m_run_~a~0) .cse15 (<= 1 ~a_t~0) .cse16 .cse17 .cse18 .cse19) (and .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse12 .cse19)))) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse2 (= ~c_req_type~0 0)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~c_write_rsp_ev~0 1)) (.cse8 (<= 52 ~s_memory2~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse11 (<= ~s_memory0~0 50))) (or (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse7 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 (<= ~c_rsp_d~0 50) .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse13 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= .cse13 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse10 (<= .cse13 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (<= .cse13 (+ ~a_t~0 ~c_rsp_d~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,868 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 269) no Hoare annotation was computed. [2021-10-13 00:49:38,868 INFO L853 garLoopResultBuilder]: At program point L1207(lines 1200 1235) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 00:49:38,868 INFO L857 garLoopResultBuilder]: For program point L1075(lines 878 1108) no Hoare annotation was computed. [2021-10-13 00:49:38,869 INFO L853 garLoopResultBuilder]: At program point L415(lines 408 461) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,869 INFO L853 garLoopResultBuilder]: At program point L349(lines 342 377) the Hoare annotation is: (let ((.cse3 (<= ~s_memory1~0 51)) (.cse5 (<= 51 ~s_memory1~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 .cse4 (<= 52 ~s_memory2~0) .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 00:49:38,869 INFO L857 garLoopResultBuilder]: For program point L1340(lines 1340 1344) no Hoare annotation was computed. [2021-10-13 00:49:38,869 INFO L857 garLoopResultBuilder]: For program point L1340-1(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 00:49:38,869 INFO L857 garLoopResultBuilder]: For program point L1274(lines 1274 1278) no Hoare annotation was computed. [2021-10-13 00:49:38,870 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 221) no Hoare annotation was computed. [2021-10-13 00:49:38,870 INFO L857 garLoopResultBuilder]: For program point L1076(lines 1076 1080) no Hoare annotation was computed. [2021-10-13 00:49:38,870 INFO L853 garLoopResultBuilder]: At program point L944(lines 937 963) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (= ~a_t~0 1)) (.cse25 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse26 (= ~c_req_a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse34 (<= 2 ~c_req_a~0)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (<= 52 ~s_memory2~0)) (.cse35 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse24 (let ((.cse41 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse41 .cse33 .cse15) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse8 .cse10 .cse12 .cse13 .cse41 .cse15)))) (.cse36 (< 1 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse11 (<= ~s_memory0~0 50)) (.cse38 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse40 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse17 .cse18 .cse19 .cse3 .cse4 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse21 (= ~req_tt_a~0 1) .cse22 .cse7 .cse23 .cse24 .cse9 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse2 .cse6 .cse27 .cse28 .cse29 .cse8 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse17 .cse18 .cse26 .cse19 .cse3 .cse20 .cse21 (= ~req_tt_a~0 0) .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse11 .cse32 .cse33) (and .cse0 .cse26 .cse1 .cse2 .cse6 (= ~s_run_pc~0 0) .cse27 .cse28 .cse29 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse34 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse20 .cse6 .cse35 .cse8 .cse36 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse39 (<= ~c_req_d~0 52) .cse15 .cse16 .cse40) (and .cse17 .cse34 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse35 .cse23 .cse24 .cse36 .cse37 .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse38 .cse39 (= ~req_tt_a~0 2) .cse40)))) [2021-10-13 00:49:38,871 INFO L853 garLoopResultBuilder]: At program point L878-1(lines 862 1113) the Hoare annotation is: (let ((.cse29 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse30 (<= 1 ~a_t~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_st~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse19 (+ 51 ~req_tt_a~0))) (let ((.cse26 (= ~c_req_a~0 0)) (.cse27 (not (= ~s_run_st~0 0))) (.cse4 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_d~0 50)) (.cse28 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse22 (<= .cse19 (+ ~s_memory1~0 ~a_t~0))) (.cse13 (let ((.cse31 (= 2 ~s_run_pc~0)) (.cse32 (= ~m_run_pc~0 6))) (or (and .cse0 .cse29 .cse1 .cse30 .cse5 .cse31 .cse6 .cse9 .cse32 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse31 .cse6 .cse9 .cse32 .cse11 .cse12)))) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~c_req_type~0 0)) (.cse16 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse2 (<= 50 ~s_memory0~0)) (.cse17 (<= ~s_memory1~0 51)) (.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (<= 52 ~s_memory2~0)) (.cse23 (<= 51 ~s_memory1~0)) (.cse21 (<= ~s_memory2~0 52)) (.cse8 (<= ~s_memory0~0 50)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse13 .cse14 .cse15 .cse16 .cse2 .cse17 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse20 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse21 (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse22 (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse8 (<= .cse19 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse14 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse16 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse17 .cse20 .cse23 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse24 (<= ~c_req_d~0 52) .cse12 .cse25) (and .cse15 .cse0 .cse26 .cse27 (not (= ~c_m_lock~0 1)) .cse6 .cse9 .cse28 .cse11 .cse12 (= ~m_run_pc~0 0)) (and .cse0 .cse26 .cse1 (= ~c_req_type~0 1) .cse27 (= ~s_run_pc~0 0) .cse3 .cse4 .cse7 .cse9 .cse28 .cse10 .cse11 .cse12) (and .cse0 .cse29 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= ~a_t~0 1) .cse30 .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse17 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse23 (<= ~c_req_d~0 51) .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse13 .cse14 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse15 .cse16 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse17 .cse18 (= ~req_tt_a~0 0) .cse20 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse22 .cse8 (<= ~c_rsp_d~0 50) .cse11 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse14 .cse15 .cse16 .cse2 .cse17 .cse18 .cse20 .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse21 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse8 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse24 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse25)))) [2021-10-13 00:49:38,871 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 00:49:38,871 INFO L857 garLoopResultBuilder]: For program point L1209(lines 1209 1213) no Hoare annotation was computed. [2021-10-13 00:49:38,871 INFO L857 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-10-13 00:49:38,871 INFO L853 garLoopResultBuilder]: At program point L483(lines 135 484) the Hoare annotation is: (and (<= 3 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 50 ~s_memory0~0) (<= ~s_memory1~0 51) (not (= ~s_run_st~0 0)) (<= 52 ~s_memory2~0) (<= 51 ~s_memory1~0) (not (= ~c_m_lock~0 1)) (<= ~s_memory2~0 52) (= 2 ~s_run_pc~0) (= ~c_empty_req~0 1) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= 2 ~c_m_ev~0) (<= 2 ~a_t~0)) [2021-10-13 00:49:38,871 INFO L857 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-10-13 00:49:38,872 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2021-10-13 00:49:38,872 INFO L857 garLoopResultBuilder]: For program point L946(lines 946 950) no Hoare annotation was computed. [2021-10-13 00:49:38,872 INFO L857 garLoopResultBuilder]: For program point L881-1(lines 878 1108) no Hoare annotation was computed. [2021-10-13 00:49:38,872 INFO L857 garLoopResultBuilder]: For program point L749(lines 749 755) no Hoare annotation was computed. [2021-10-13 00:49:38,872 INFO L853 garLoopResultBuilder]: At program point L749-1(lines 749 755) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse10 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse11 (<= .cse10 (+ ~s_memory1~0 ~a_t~0))) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (= 2 ~s_run_pc~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse17 (= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (<= 2 ~c_m_ev~0))) (or (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse12 .cse20))))) (or (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse10 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse11 (<= .cse10 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse8 .cse9 (<= .cse10 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse8 (<= ~c_rsp_d~0 50) .cse9 .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0))))) [2021-10-13 00:49:38,873 INFO L853 garLoopResultBuilder]: At program point L683(lines 676 729) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse8 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse8 (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse12 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse8 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,873 INFO L857 garLoopResultBuilder]: For program point L882(lines 881 905) no Hoare annotation was computed. [2021-10-13 00:49:38,874 INFO L853 garLoopResultBuilder]: At program point L1147(lines 1121 1162) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse19 (+ 51 ~req_tt_a~0)) (.cse38 (= ~c_empty_rsp~0 1)) (.cse49 (= ULTIMATE.start_m_run_~a~0 0)) (.cse48 (= ~a_t~0 0)) (.cse24 (<= 2 ~c_write_req_ev~0)) (.cse52 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 1 ~c_m_lock~0)) (.cse53 (<= 1 ~a_t~0)) (.cse26 (not (= ~s_run_st~0 0))) (.cse29 (= ~m_run_st~0 0)) (.cse30 (= 2 ~s_run_pc~0)) (.cse31 (= ~c_empty_req~0 1)) (.cse32 (= 2 ~c_write_rsp_ev~0)) (.cse54 (= ~m_run_pc~0 6)) (.cse34 (<= 2 ~c_m_ev~0))) (let ((.cse1 (<= 2 ~c_req_a~0)) (.cse40 (<= 52 ~c_req_d~0)) (.cse13 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ~c_req_a~0 2)) (.cse43 (<= ~c_req_d~0 52)) (.cse41 (<= ULTIMATE.start_s_run_~req_d~1 52)) (.cse46 (= ~req_tt_a~0 0)) (.cse47 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse42 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= 51 ~s_memory1~0)) (.cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (or (and .cse24 .cse25 .cse26 .cse49 .cse29 .cse30 .cse31 .cse32 .cse54 .cse48 .cse34) (and .cse24 .cse52 .cse25 .cse53 .cse26 .cse29 .cse30 .cse31 .cse32 .cse54 .cse34))) (.cse15 (= ~req_tt_a~0 2)) (.cse16 (<= 2 ~a_t~0)) (.cse27 (<= 51 ~c_req_d~0)) (.cse55 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse28 (<= ~c_req_d~0 51)) (.cse56 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse57 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse58 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse59 (= ~c_req_a~0 1)) (.cse5 (<= ~s_memory1~0 51)) (.cse17 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ~req_tt_a~0 1)) (.cse7 (<= 52 ~s_memory2~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (or (and .cse24 .cse25 .cse49 .cse30 .cse32 .cse38 .cse54 .cse48 .cse34) (and .cse24 .cse52 .cse25 .cse53 .cse30 .cse32 .cse38 .cse54 .cse34))) (.cse10 (<= ~s_memory2~0 52)) (.cse21 (= ~a_t~0 1)) (.cse22 (<= .cse19 (+ ~s_memory1~0 ~a_t~0))) (.cse11 (<= ~s_memory0~0 50)) (.cse44 (= ~c_req_type~0 1)) (.cse36 (= ~s_run_pc~0 0)) (.cse50 (<= 50 ~c_req_d~0)) (.cse51 (<= ~c_req_d~0 50)) (.cse33 (= ~m_run_pc~0 3)) (.cse45 (not .cse2)) (.cse35 (= ~c_req_a~0 0)) (.cse37 (not (= ~c_m_lock~0 1))) (.cse39 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse18 (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse20 .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse21 .cse22 (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 .cse23 (<= .cse19 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse24 .cse25 (<= ULTIMATE.start_s_memory_write_~v 51) .cse4 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse5 .cse26 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse27 .cse8 .cse20 .cse28 .cse29 .cse30 .cse21 .cse31 .cse11 .cse32 .cse33 .cse34 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse35 .cse26 .cse36 .cse37 .cse31 .cse32 .cse38 .cse39) (and .cse0 .cse40 .cse24 .cse25 .cse3 .cse41 .cse4 .cse5 .cse26 .cse7 .cse8 .cse29 .cse10 .cse30 .cse31 .cse11 .cse32 .cse33 .cse42 .cse13 .cse43 .cse34 .cse16) (and .cse1 .cse40 .cse24 .cse25 .cse44 .cse4 .cse5 .cse8 .cse30 .cse11 .cse32 .cse38 .cse33 .cse13 .cse14 .cse43 .cse34 .cse45 .cse16) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse46 .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse47 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse22 .cse11 (<= ~c_rsp_d~0 50) .cse48 .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse35 .cse25 .cse44 .cse49 .cse50 .cse30 .cse51 .cse32 .cse38 .cse33 .cse48 .cse34 .cse45) (and (or (and .cse24 .cse25 .cse26 .cse49 .cse30 .cse32 .cse38 .cse48 .cse34) (and .cse24 .cse52 .cse25 .cse53 .cse26 .cse30 .cse32 .cse38 .cse34)) .cse54) (and .cse0 .cse2 .cse35 .cse3 .cse41 .cse4 .cse5 .cse46 .cse7 .cse9 .cse10 .cse47 .cse22 .cse11 .cse42 .cse48) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse2 (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ~s_memory1~0 ULTIMATE.start_m_run_~a~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 52) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse12 .cse23 (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) .cse15 (<= ULTIMATE.start_s_run_~rsp_d~1 52) .cse16) (and .cse24 .cse25 .cse4 .cse26 .cse49 .cse50 .cse55 .cse29 .cse30 .cse56 .cse31 .cse51 .cse11 .cse32 .cse33 .cse48 .cse57 .cse34 .cse58) (and .cse24 .cse52 .cse25 .cse44 (<= ~a_t~0 1) .cse53 .cse4 .cse59 .cse27 (<= ULTIMATE.start_m_run_~a~0 1) .cse55 .cse28 .cse30 .cse56 .cse11 .cse32 .cse38 .cse33 .cse57 .cse34 .cse58 .cse45) (and .cse2 .cse24 .cse35 .cse36 .cse37 .cse31 .cse32 .cse38 .cse48 .cse34 .cse39) (and .cse24 .cse52 .cse53 .cse26 .cse30 .cse31 .cse32 .cse38 .cse54 .cse34) (and .cse30 .cse31 .cse32 .cse38 .cse33) (and .cse24 .cse26 .cse30 .cse32 .cse38 .cse33) (and .cse35 .cse26 .cse36 .cse32 .cse38 .cse33 .cse45) (and .cse0 .cse2 .cse3 .cse4 .cse59 .cse5 .cse17 .cse6 .cse18 .cse7 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11) (and .cse24 .cse35 .cse25 .cse44 .cse36 .cse49 .cse50 .cse51 .cse32 .cse38 .cse33 .cse48 .cse34 .cse45) (and .cse2 .cse24 .cse35 .cse26 .cse37 .cse30 .cse31 .cse32 .cse38 .cse48 .cse34 .cse39)))) [2021-10-13 00:49:38,874 INFO L857 garLoopResultBuilder]: For program point L883(lines 883 887) no Hoare annotation was computed. [2021-10-13 00:49:38,874 INFO L857 garLoopResultBuilder]: For program point L685(lines 685 689) no Hoare annotation was computed. [2021-10-13 00:49:38,874 INFO L853 garLoopResultBuilder]: At program point L487-2(lines 487 839) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse23 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse25 (+ 51 ~req_tt_a~0)) (.cse26 (+ 51 ULTIMATE.start_m_run_~req_a___0~0))) (let ((.cse16 (<= 2 ~a_t~0)) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~c_req_type~0 0)) (.cse18 (<= .cse26 (+ ~s_memory1~0 ULTIMATE.start_m_run_~a~0))) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse19 (< ULTIMATE.start_m_run_~rsp_d___0~0 .cse26)) (.cse20 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse21 (<= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse22 (<= .cse25 (+ ~s_memory1~0 ~a_t~0))) (.cse12 (<= ~s_memory0~0 50)) (.cse24 (let ((.cse27 (<= 6 ~m_run_pc~0)) (.cse28 (= ~m_run_pc~0 6))) (or (and .cse1 (<= 1 ~a_t~0) .cse5 .cse27 .cse8 .cse10 .cse11 .cse13 .cse14 .cse28 (<= 2 ULTIMATE.start_m_run_~a~0) .cse15) (and .cse1 .cse5 .cse27 .cse8 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse11 .cse13 .cse14 .cse28 .cse23 .cse15))))) (or (and .cse0 (<= 52 ~c_req_d~0) .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse15 .cse16) (and .cse0 .cse17 .cse18 .cse2 .cse3 .cse4 .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse12 .cse23 .cse24) (and (<= 3 ULTIMATE.start_m_run_~a~0) .cse17 .cse18 .cse3 .cse4 .cse19 .cse20 .cse7 .cse21 .cse22 .cse12 .cse24 .cse16) (and .cse0 .cse17 .cse18 .cse2 .cse3 .cse4 .cse19 .cse20 (<= .cse25 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) (= ULTIMATE.start_m_run_~a~0 2) .cse6 .cse7 (<= .cse25 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 .cse21 (= ~a_t~0 1) .cse22 (<= .cse25 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse12 (<= .cse26 (+ ULTIMATE.start_m_run_~a~0 ~c_rsp_d~0)) (<= .cse25 (+ ~a_t~0 ~c_rsp_d~0)) .cse24)))) [2021-10-13 00:49:38,875 INFO L853 garLoopResultBuilder]: At program point L1280(lines 1273 1317) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse11 .cse15 .cse0 .cse1 .cse3 .cse4 .cse13))) .cse16) (and .cse10 .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse13) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse9))) [2021-10-13 00:49:38,875 INFO L853 garLoopResultBuilder]: At program point L223(lines 216 269) the Hoare annotation is: (let ((.cse23 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse13 (= ~c_req_a~0 0)) (.cse22 (= ~s_run_pc~0 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= .cse23 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 .cse23)) (.cse17 (<= ~c_req_d~0 .cse23)) (.cse18 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (= ~m_run_pc~0 0)) (.cse21 (<= .cse23 ~c_req_d~0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= ~s_memory0~0 50)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse19 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (not (= ~c_req_type~0 0)))) (or (and (<= 2 ~c_req_a~0) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse2 .cse3 (<= ~s_memory1~0 51) .cse4 (<= 51 ~s_memory1~0) .cse5 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 2) (<= ~c_req_d~0 52) .cse11 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse12 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse13 .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse17 .cse5 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11 .cse20 .cse21) (and .cse13 .cse3 .cse4 .cse22 .cse14 .cse8 .cse9 .cse18 .cse20 .cse12) (and .cse13 .cse0 .cse1 .cse22 .cse14 .cse15 .cse16 .cse17 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse3 .cse4 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0))))) [2021-10-13 00:49:38,875 INFO L857 garLoopResultBuilder]: For program point L488(lines 487 839) no Hoare annotation was computed. [2021-10-13 00:49:38,875 INFO L860 garLoopResultBuilder]: At program point L1347(lines 1169 1352) the Hoare annotation is: true [2021-10-13 00:49:38,876 INFO L853 garLoopResultBuilder]: At program point L290-2(lines 290 318) the Hoare annotation is: (let ((.cse7 (= ~a_t~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse22 (= ~c_req_type~0 1)) (.cse23 (<= 1 ~a_t~0)) (.cse31 (= ULTIMATE.start_m_run_~a~0 1)) (.cse15 (= 2 ~s_run_pc~0)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse26 (= ~c_empty_rsp~0 1)) (.cse20 (<= 2 ~c_m_ev~0)) (.cse29 (not (= ~c_req_type~0 0)))) (let ((.cse2 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (let ((.cse35 (= ~c_req_a~0 1))) (or (and .cse10 .cse11 .cse22 .cse35 .cse31 .cse15 .cse18 .cse26 .cse7 .cse20 .cse29) (and .cse10 .cse11 .cse22 .cse23 .cse35 .cse31 .cse15 .cse18 .cse26 .cse20 .cse29)))) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse9 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 51 ~c_req_d~0)) (.cse3 (<= ~c_req_d~0 51)) (.cse30 (= ~a_t~0 1)) (.cse33 (not .cse15)) (.cse32 (= ~c_req_a~0 0)) (.cse34 (= ~s_run_pc~0 0)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 50 ~c_req_d~0)) (.cse17 (<= ~c_req_d~0 50)) (.cse21 (<= 52 ~c_req_d~0)) (.cse0 (<= 50 ~s_memory0~0)) (.cse24 (<= ~s_memory1~0 51)) (.cse12 (not (= ~s_run_st~0 0))) (.cse25 (<= 51 ~s_memory1~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse5 (<= ~s_memory0~0 50)) (.cse19 (= ~m_run_pc~0 3)) (.cse27 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= ~c_req_d~0 52))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse2 .cse15 .cse4 .cse16 .cse17 .cse5 .cse18 .cse19 .cse7 .cse8 .cse20 .cse9) (and (<= 2 ~c_req_a~0) .cse21 .cse10 .cse11 .cse22 .cse23 .cse0 .cse24 .cse25 .cse15 .cse5 .cse18 .cse26 .cse27 (<= ~c_req_a~0 2) .cse28 .cse20 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse10 .cse11 (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse24 .cse12 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse1 .cse25 .cse31 .cse3 .cse15 .cse30 .cse16 .cse5 .cse18 .cse19 .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse10 .cse32 .cse11 .cse22 .cse13 .cse14 .cse15 .cse17 .cse18 .cse26 .cse7 .cse20 .cse29) (and .cse10 .cse12 .cse15 .cse18 .cse26) (and .cse33 .cse32 .cse12 .cse34 .cse18 .cse26 .cse29) (and .cse15 .cse16 .cse18 .cse26 .cse19) (and .cse33 .cse10 .cse32 .cse11 .cse22 .cse34 .cse13 .cse14 .cse17 .cse18 .cse26 .cse7 .cse20 .cse29) (and (<= ULTIMATE.start_s_memory_write_~v 52) .cse21 .cse10 .cse11 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse0 .cse24 .cse12 (<= 52 ~s_memory2~0) .cse25 (<= ~s_memory2~0 52) .cse15 .cse16 .cse5 .cse18 .cse19 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse28 .cse20 (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,876 INFO L853 garLoopResultBuilder]: At program point L1215(lines 1208 1234) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 00:49:38,876 INFO L853 garLoopResultBuilder]: At program point L819(lines 812 829) the Hoare annotation is: (let ((.cse12 (= ~a_t~0 0)) (.cse6 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= ~s_memory2~0 52)) (.cse9 (<= .cse6 (+ ~s_memory1~0 ~a_t~0))) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse15 (<= 6 ~m_run_pc~0)) (.cse16 (not (= ~c_m_lock~0 1))) (.cse17 (= 2 ~s_run_pc~0)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6))) (or (and .cse13 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) (= ~a_t~0 1) .cse9 (<= .cse6 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse6 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) .cse11 (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse7 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse8 (<= ULTIMATE.start_s_memory_read_~x~0 52) (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0)) (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse7 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse12 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse11)))) [2021-10-13 00:49:38,876 INFO L857 garLoopResultBuilder]: For program point L621(lines 621 625) no Hoare annotation was computed. [2021-10-13 00:49:38,877 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-13 00:49:38,877 INFO L853 garLoopResultBuilder]: At program point L423(lines 416 460) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,877 INFO L853 garLoopResultBuilder]: At program point L357(lines 350 376) the Hoare annotation is: (let ((.cse3 (<= ~s_memory1~0 51)) (.cse5 (<= 51 ~s_memory1~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 .cse4 (<= 52 ~s_memory2~0) .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 00:49:38,877 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 318) no Hoare annotation was computed. [2021-10-13 00:49:38,877 INFO L857 garLoopResultBuilder]: For program point L1282(lines 1282 1286) no Hoare annotation was computed. [2021-10-13 00:49:38,878 INFO L857 garLoopResultBuilder]: For program point L225(lines 225 229) no Hoare annotation was computed. [2021-10-13 00:49:38,878 INFO L853 garLoopResultBuilder]: At program point L952(lines 945 962) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_m_ev~0))) (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (= ~a_t~0 1)) (.cse25 (<= (+ 51 ~req_tt_a~0) (+ ~s_memory1~0 ~a_t~0))) (.cse26 (= ~c_req_a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse34 (<= 2 ~c_req_a~0)) (.cse18 (= ~c_req_type~0 0)) (.cse19 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse20 (<= ~s_memory1~0 51)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse22 (<= 52 ~s_memory2~0)) (.cse35 (<= 51 ~s_memory1~0)) (.cse23 (<= ~s_memory2~0 52)) (.cse24 (let ((.cse41 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse41 .cse33 .cse15) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse8 .cse10 .cse12 .cse13 .cse41 .cse15)))) (.cse36 (< 1 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse11 (<= ~s_memory0~0 50)) (.cse38 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse39 (<= ~c_req_a~0 2)) (.cse40 (<= 2 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse17 .cse18 .cse19 .cse3 .cse4 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 .cse21 (= ~req_tt_a~0 1) .cse22 .cse7 .cse23 .cse24 .cse9 .cse25 .cse11) (and .cse0 .cse26 .cse1 .cse2 .cse6 .cse27 .cse28 .cse29 .cse8 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse17 .cse18 .cse26 .cse19 .cse3 .cse20 .cse21 (= ~req_tt_a~0 0) .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse11 .cse32 .cse33) (and .cse0 .cse26 .cse1 .cse2 .cse6 (= ~s_run_pc~0 0) .cse27 .cse28 .cse29 .cse30 .cse10 .cse31 .cse12 .cse13 .cse14 .cse32 .cse33 .cse15 .cse16) (and .cse34 (<= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse20 .cse6 .cse35 .cse8 .cse36 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse38 .cse39 (<= ~c_req_d~0 52) .cse15 .cse16 .cse40) (and .cse17 .cse34 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse35 .cse23 .cse24 .cse36 .cse37 .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse38 .cse39 (= ~req_tt_a~0 2) .cse40)))) [2021-10-13 00:49:38,878 INFO L857 garLoopResultBuilder]: For program point L820(lines 812 829) no Hoare annotation was computed. [2021-10-13 00:49:38,878 INFO L857 garLoopResultBuilder]: For program point L292(lines 292 296) no Hoare annotation was computed. [2021-10-13 00:49:38,878 INFO L857 garLoopResultBuilder]: For program point L1217(lines 1217 1221) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point L1151(lines 1151 1158) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point L953(lines 878 1108) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point L821(lines 821 825) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point L425(lines 425 429) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2021-10-13 00:49:38,879 INFO L857 garLoopResultBuilder]: For program point L954(lines 954 958) no Hoare annotation was computed. [2021-10-13 00:49:38,880 INFO L853 garLoopResultBuilder]: At program point L691(lines 684 728) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse12 (+ 51 ~req_tt_a~0))) (let ((.cse9 (<= .cse12 (+ ~s_memory1~0 ~a_t~0))) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= ~s_memory2~0 52)) (.cse8 (let ((.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (<= 2 ~c_m_ev~0))) (or (and .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse11 .cse21) (and .cse13 (<= 1 ULTIMATE.start_m_run_~a~0) .cse14 (<= 1 ~a_t~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (.cse10 (<= ~s_memory0~0 50))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (= ULTIMATE.start_m_run_~a~0 1) .cse7 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse8 (= ~a_t~0 1) .cse9 (<= .cse12 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse10 (<= .cse12 (+ ~a_t~0 ~c_rsp_d~0)) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= (+ 51 ULTIMATE.start_m_run_~req_a___0~0) (+ ULTIMATE.start_m_run_~a~0 ULTIMATE.start_m_run_~rsp_d___0~0)) (<= ~c_rsp_d~0 51)) (and (<= 52 ~c_rsp_d~0) (<= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse4 .cse5 .cse6 (<= 51 ~s_memory1~0) (<= |ULTIMATE.start_s_memory_read_#res| 52) (<= 52 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 (<= ULTIMATE.start_s_memory_read_~x~0 52) .cse8 (<= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_s_memory_read_~x~0) (<= ~c_rsp_d~0 52) (= ~req_tt_a~0 2) (<= ULTIMATE.start_s_run_~rsp_d~1 52) (<= 2 ~a_t~0))))) [2021-10-13 00:49:38,880 INFO L853 garLoopResultBuilder]: At program point L559(lines 529 560) the Hoare annotation is: (let ((.cse19 (= ~a_t~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse6 (not (= ~s_run_st~0 0))) (.cse10 (= 2 ~s_run_pc~0)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse21 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse16 (= ~c_req_type~0 0)) (.cse3 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= ~s_memory1~0 51)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (<= 52 ~s_memory2~0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse18 (<= .cse21 (+ ~s_memory1~0 ~a_t~0))) (.cse11 (<= ~s_memory0~0 50)) (.cse20 (let ((.cse22 (<= 6 ~m_run_pc~0)) (.cse23 (= ~m_run_pc~0 6))) (or (and .cse1 .cse2 .cse6 .cse22 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse12 .cse13 .cse23 .cse19 .cse14) (and .cse1 .cse2 (<= 1 ~a_t~0) .cse6 .cse22 .cse10 .cse12 .cse13 .cse23 (<= 2 ULTIMATE.start_m_run_~a~0) .cse14 (<= ULTIMATE.start_m_run_~a~0 2))))) (.cse15 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 52 ~c_req_d~0) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse14 .cse15 (<= 2 ~a_t~0)) (and .cse0 .cse16 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 .cse7 .cse8 .cse9 .cse18 .cse11 .cse19 .cse20 .cse15) (and .cse0 .cse16 .cse3 .cse4 .cse5 .cse17 (<= .cse21 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse7 .cse8 (<= .cse21 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 (= ~a_t~0 1) .cse18 (<= .cse21 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse11 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= .cse21 (+ ~a_t~0 ~c_rsp_d~0)) .cse20 .cse15)))) [2021-10-13 00:49:38,880 INFO L857 garLoopResultBuilder]: For program point L758(lines 758 811) no Hoare annotation was computed. [2021-10-13 00:49:38,881 INFO L857 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-10-13 00:49:38,881 INFO L857 garLoopResultBuilder]: For program point L693(lines 693 697) no Hoare annotation was computed. [2021-10-13 00:49:38,881 INFO L853 garLoopResultBuilder]: At program point L627(lines 620 637) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (<= 1 ~a_t~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 (= ULTIMATE.start_m_run_~a~0 1) .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7) (and (<= 1 ULTIMATE.start_m_run_~a~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2021-10-13 00:49:38,881 INFO L853 garLoopResultBuilder]: At program point L1288(lines 1281 1316) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and (let ((.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse10 .cse11 .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse11 .cse15 .cse0 .cse1 .cse3 .cse4 .cse13))) .cse16) (and .cse10 .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse13) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse9))) [2021-10-13 00:49:38,882 INFO L853 garLoopResultBuilder]: At program point L231(lines 224 268) the Hoare annotation is: (let ((.cse23 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse13 (= ~c_req_a~0 0)) (.cse22 (= ~s_run_pc~0 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= .cse23 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 .cse23)) (.cse17 (<= ~c_req_d~0 .cse23)) (.cse18 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (= ~m_run_pc~0 0)) (.cse21 (<= .cse23 ~c_req_d~0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= ~s_memory0~0 50)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse19 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (not (= ~c_req_type~0 0)))) (or (and (<= 2 ~c_req_a~0) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 (<= ~a_t~0 1) (<= 1 ~a_t~0) .cse2 .cse3 (<= ~s_memory1~0 51) .cse4 (<= 51 ~s_memory1~0) .cse5 (<= ULTIMATE.start_m_run_~req_d~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 2) (<= ~c_req_d~0 52) .cse11 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2) .cse12 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse13 .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse17 .cse5 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11 .cse20 .cse21) (and .cse13 .cse3 .cse4 .cse22 .cse14 .cse8 .cse9 .cse18 .cse20 .cse12) (and .cse13 .cse0 .cse1 .cse22 .cse14 .cse15 .cse16 .cse17 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse3 .cse4 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0))))) [2021-10-13 00:49:38,882 INFO L857 garLoopResultBuilder]: For program point L1090(lines 1090 1094) no Hoare annotation was computed. [2021-10-13 00:49:38,882 INFO L857 garLoopResultBuilder]: For program point L628(lines 620 637) no Hoare annotation was computed. [2021-10-13 00:49:38,882 INFO L853 garLoopResultBuilder]: At program point L1223(lines 1216 1233) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 00:49:38,882 INFO L857 garLoopResultBuilder]: For program point L629(lines 629 633) no Hoare annotation was computed. [2021-10-13 00:49:38,882 INFO L853 garLoopResultBuilder]: At program point L431(lines 424 459) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (<= ~s_memory1~0 51)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 51 ~s_memory1~0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 .cse2 .cse3 (<= 52 ~s_memory2~0) .cse4 .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) (<= 2 ~a_t~0)))) [2021-10-13 00:49:38,883 INFO L853 garLoopResultBuilder]: At program point L497-2(lines 497 525) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse8 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse22 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse19 (+ 51 ~req_tt_a~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= ~c_req_type~0 0)) (.cse2 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= ~s_memory1~0 51)) (.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (<= 52 ~s_memory2~0)) (.cse7 (<= 51 ~s_memory1~0)) (.cse9 (<= ~s_memory2~0 52)) (.cse20 (<= .cse19 (+ ~s_memory1~0 ~a_t~0))) (.cse12 (<= ~s_memory0~0 50)) (.cse21 (let ((.cse23 (= ~m_run_pc~0 6))) (or (and .cse1 (<= 1 ~a_t~0) .cse5 .cse8 .cse10 .cse11 .cse13 .cse14 .cse23 (<= 2 ULTIMATE.start_m_run_~a~0) .cse15 (<= ULTIMATE.start_m_run_~a~0 2)) (and .cse1 .cse5 .cse8 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse11 .cse13 .cse14 .cse23 .cse22 .cse15)))) (.cse16 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (<= 52 ~c_req_d~0) .cse1 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13 .cse14 (= ~m_run_pc~0 3) (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) .cse15 .cse16 (<= 2 ~a_t~0)) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse18 (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_run_~rsp_d~1)) .cse6 .cse7 (<= .cse19 (+ ~a_t~0 |ULTIMATE.start_s_memory_read_#res|)) .cse9 (= ~a_t~0 1) .cse20 (<= .cse19 (+ ~a_t~0 ULTIMATE.start_s_memory_read_~x~0)) .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse21 (<= .cse19 (+ ~a_t~0 ~c_rsp_d~0)) .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse18 .cse6 .cse7 .cse9 .cse20 .cse12 .cse21 .cse22 .cse16)))) [2021-10-13 00:49:38,883 INFO L853 garLoopResultBuilder]: At program point L365(lines 358 375) the Hoare annotation is: (let ((.cse3 (<= ~s_memory1~0 51)) (.cse5 (<= 51 ~s_memory1~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 52) (<= 52 ~c_req_d~0) .cse0 .cse1 (<= 52 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 .cse4 (<= 52 ~s_memory2~0) .cse5 (<= ~s_memory2~0 52) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 52) .cse12 (<= 2 ~a_t~0)) (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse5 (= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse6 (= ~a_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ~c_req_d~0 50) .cse8 .cse9 .cse10 .cse11 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse12 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 00:49:38,883 INFO L857 garLoopResultBuilder]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2021-10-13 00:49:38,883 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 237) no Hoare annotation was computed. [2021-10-13 00:49:38,884 INFO L857 garLoopResultBuilder]: For program point L1224(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 00:49:38,888 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:49:39,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:49:39 BoogieIcfgContainer [2021-10-13 00:49:39,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:49:39,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:49:39,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:49:39,105 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:49:39,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:25" (3/4) ... [2021-10-13 00:49:39,108 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:49:39,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-13 00:49:39,132 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 00:49:39,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:49:39,135 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:49:39,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && m_run_st == 0) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 52 <= req_d) && a_t == 0)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-10-13 00:49:39,162 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && m_run_st == 0) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 52 <= req_d) && a_t == 0)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || ((((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && m_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) [2021-10-13 00:49:39,163 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && m_run_st == 0) && s_memory2 <= 52) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && a <= 1) && 51 <= s_memory1) && c_req_d <= 51) && m_run_st == 0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,164 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((((52 <= rsp_d && v <= 52) && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || ((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 <= \result)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && \result <= 50) [2021-10-13 00:49:39,165 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || (((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((3 <= a && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 <= s_memory1) && req_a___0 + 50 <= rsp_d___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 2 <= a_t)) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && a == 2) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_a___0 <= a + c_rsp_d) && 51 + req_tt_a <= a_t + c_rsp_d) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) [2021-10-13 00:49:39,166 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && s_memory0 <= 50) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) || ((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || (m_run_pc == 6 && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= s_memory2) && rsp_d <= 51) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 52 <= req_d) && a_t == 0) [2021-10-13 00:49:39,166 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0)) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && a_t == 0) && req_type___0 == 0) [2021-10-13 00:49:39,166 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && ((((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0)) || (((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 2 <= req_a___0) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && ((((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && req_a___0 <= 2) [2021-10-13 00:49:39,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && a_t == 0) && req_type___0 == 0) || ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t)) || (((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 2 <= req_a___0) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && req_a___0 <= 2) [2021-10-13 00:49:39,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 6 <= m_run_pc) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && req_type___0 == 0)) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && 51 + req_tt_a <= a_t + c_rsp_d) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 6 <= m_run_pc) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && req_type___0 == 0) [2021-10-13 00:49:39,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_req_d <= 50) && s_memory0 <= 50) && (((((!(s_run_st == 0) && s_run_pc == 0) && m_run_st == 0) && c_empty_req == 1) && m_run_pc == 3) || (((m_run_st == 0 && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && s_memory0 <= 50) && 52 <= req_d) && (((((!(s_run_st == 0) && s_run_pc == 0) && m_run_st == 0) && c_empty_req == 1) && m_run_pc == 3) || (((m_run_st == 0 && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 3))) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && a_t == 1) && s_memory0 <= 50) && (((((!(s_run_st == 0) && s_run_pc == 0) && m_run_st == 0) && c_empty_req == 1) && m_run_pc == 3) || (((m_run_st == 0 && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 == req_a___0) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) [2021-10-13 00:49:39,169 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,169 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,170 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) || ((((v <= 52 && 52 <= v) && (((((((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50) && a_t == 0) || ((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50)) && a == 1) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) || (((((((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50) && a_t == 0) || ((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50)) && 51 <= s_memory1) && a == 1) && 51 + req_tt_a <= s_memory1 + a_t) && a_t == 0))) && 52 <= s_memory2) && s_memory2 <= 52)) || ((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 0 == req_a___0) && s_memory0 <= 50) && 52 <= req_d)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && req_tt_a == 2) || ((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && a == 2) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2)) && 2 <= a)) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) [2021-10-13 00:49:39,170 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) [2021-10-13 00:49:39,170 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) [2021-10-13 00:49:39,171 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && \result <= 50) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 52 <= s_memory2) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50)) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && req_tt_a == 2) && 2 <= a_t) [2021-10-13 00:49:39,171 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) [2021-10-13 00:49:39,171 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 52 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) [2021-10-13 00:49:39,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 52 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) [2021-10-13 00:49:39,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && (((((((((1 <= a && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && req_type___0 == 0) || ((((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && (((((((((1 <= a && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && a <= 2)) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 52 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) [2021-10-13 00:49:39,173 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,173 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,173 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,173 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,174 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,174 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) [2021-10-13 00:49:39,174 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) [2021-10-13 00:49:39,175 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) [2021-10-13 00:49:39,175 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) [2021-10-13 00:49:39,175 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) [2021-10-13 00:49:39,176 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) [2021-10-13 00:49:39,176 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) [2021-10-13 00:49:39,176 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) [2021-10-13 00:49:39,176 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && a_t == 1) && (((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_a___0 <= a + c_rsp_d) && 51 + req_tt_a <= a_t + c_rsp_d) || (((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && (((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0)) || ((((((((((((c_req_type == 0 && 51 + req_a___0 <= s_memory1 + a) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 <= s_memory1) && req_a___0 + 50 <= rsp_d___0) && (((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 <= a) && 2 <= a_t) [2021-10-13 00:49:39,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:49:39,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:49:39,303 INFO L168 Benchmark]: Toolchain (without parser) took 195660.29 ms. Allocated memory was 98.6 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 66.1 MB in the beginning and 796.2 MB in the end (delta: -730.0 MB). Peak memory consumption was 779.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,303 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 98.6 MB. Free memory is still 54.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:49:39,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.39 ms. Allocated memory is still 98.6 MB. Free memory was 65.9 MB in the beginning and 65.7 MB in the end (delta: 157.6 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.02 ms. Allocated memory is still 98.6 MB. Free memory was 65.7 MB in the beginning and 62.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,304 INFO L168 Benchmark]: Boogie Preprocessor took 80.61 ms. Allocated memory is still 98.6 MB. Free memory was 62.5 MB in the beginning and 59.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,305 INFO L168 Benchmark]: RCFGBuilder took 1237.02 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 59.1 MB in the beginning and 76.1 MB in the end (delta: -17.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,305 INFO L168 Benchmark]: TraceAbstraction took 193501.26 ms. Allocated memory was 123.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 75.5 MB in the beginning and 827.6 MB in the end (delta: -752.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,305 INFO L168 Benchmark]: Witness Printer took 197.11 ms. Allocated memory is still 1.6 GB. Free memory was 827.6 MB in the beginning and 796.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:49:39,307 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.24 ms. Allocated memory is still 98.6 MB. Free memory is still 54.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 533.39 ms. Allocated memory is still 98.6 MB. Free memory was 65.9 MB in the beginning and 65.7 MB in the end (delta: 157.6 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.02 ms. Allocated memory is still 98.6 MB. Free memory was 65.7 MB in the beginning and 62.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 80.61 ms. Allocated memory is still 98.6 MB. Free memory was 62.5 MB in the beginning and 59.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1237.02 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 59.1 MB in the beginning and 76.1 MB in the end (delta: -17.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 193501.26 ms. Allocated memory was 123.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 75.5 MB in the beginning and 827.6 MB in the end (delta: -752.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 197.11 ms. Allocated memory is still 1.6 GB. Free memory was 827.6 MB in the beginning and 796.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 274 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 193210.1ms, OverallIterations: 31, TraceHistogramMax: 13, EmptinessCheckTime: 141.3ms, AutomataDifference: 27652.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 119756.9ms, InitialAbstractionConstructionTime: 22.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 18630 SDtfs, 44467 SDslu, 82806 SDs, 0 SdLazy, 8743 SolverSat, 1258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5511.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5049 GetRequests, 4483 SyntacticMatches, 10 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11037 ImplicationChecksByTransitivity, 8993.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7525occurred in iteration=13, InterpolantAutomatonStates: 487, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8229.3ms AutomataMinimizationTime, 31 MinimizatonAttempts, 68093 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 639 NumberOfFragments, 34962 HoareAnnotationTreeSize, 98 FomulaSimplifications, 71298443109 FormulaSimplificationTreeSizeReduction, 27382.2ms HoareSimplificationTime, 98 FomulaSimplificationsInter, 6167063920 FormulaSimplificationTreeSizeReductionInter, 92276.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 669.1ms SsaConstructionTime, 2172.7ms SatisfiabilityAnalysisTime, 23986.2ms InterpolantComputationTime, 10949 NumberOfCodeBlocks, 10949 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 10906 ConstructedInterpolants, 0 QuantifiedInterpolants, 41122 SizeOfPredicates, 98 NumberOfNonLiveVariables, 12575 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 43 InterpolantComputations, 24 PerfectInterpolantSequences, 6955/12680 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 1238]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && a_t == 0) && req_type___0 == 0) || ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t)) || (((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 2 <= req_a___0) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && req_a___0 <= 2) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 937]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && req_a == 0) && a_t == 0)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && 1 < req_a) && req_a <= 2) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t)) || ((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 1 < req_a) && req_a <= 2) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && 2 == s_run_pc) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || (((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 52 <= req_d) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && c_empty_req == 1) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && a <= 2)) || (((((((((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && !(req_type == 0)) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((!(2 == s_run_pc) && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) - InvariantResult [Line: 1281]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 52 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 462]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= a_t) - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && \result <= 50) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 52 <= s_memory2) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50)) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 1 <= c_m_lock) && 52 <= req_d) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 2 <= a) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && !(c_req_type == 0)) && a <= 2) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && req_a == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) && a + 50 <= c_req_d)) || ((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 1121]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && m_run_st == 0) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 52 <= req_d) && a_t == 0)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= a_t) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && s_memory0 <= 50) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) || ((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || (m_run_pc == 6 && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= s_memory2) && rsp_d <= 51) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 52 <= req_d) && a_t == 0) - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 1 <= c_m_lock) && 52 <= req_d) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 2 <= a) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && !(c_req_type == 0)) && a <= 2) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && req_a == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) && a + 50 <= c_req_d)) || ((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= a_t) - InvariantResult [Line: 1200]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 497]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0)) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && a_t == 0) && req_type___0 == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || (((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 51 <= req_d) && a <= 2)) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((((3 <= a && v <= 52) && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || (((((((!(s_run_st == 0) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) || ((((v <= 52 && 52 <= v) && (((((((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50) && a_t == 0) || ((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50)) && a == 1) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) || (((((((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50) && a_t == 0) || ((((((((c_req_type == 0 && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory0 <= 50)) && 51 <= s_memory1) && a == 1) && 51 + req_tt_a <= s_memory1 + a_t) && a_t == 0))) && 52 <= s_memory2) && s_memory2 <= 52)) || ((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 0 == req_a___0) && s_memory0 <= 50) && 52 <= req_d)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && req_tt_a == 2) || ((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && a == 2) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2)) && 2 <= a)) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 1067]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 831]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && a_t == 1) && (((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_a___0 <= a + c_rsp_d) && 51 + req_tt_a <= a_t + c_rsp_d) || (((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && (((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0)) || ((((((((((((c_req_type == 0 && 51 + req_a___0 <= s_memory1 + a) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 <= s_memory1) && req_a___0 + 50 <= rsp_d___0) && (((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 <= a) && 2 <= a_t) - InvariantResult [Line: 929]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && req_a == 0) && a_t == 0)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && 1 < req_a) && req_a <= 2) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t)) || ((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 1 < req_a) && req_a <= 2) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || (((((((((!(req_type == 0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0)) || ((((((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || (((((((((((((((((((((2 <= c_write_req_ev && 52 <= req_d) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && !(c_m_lock == 1)) && 2 == s_run_pc) && req_d <= 52) && c_empty_req == 1) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && a <= 2)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && 2 == s_run_pc) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 6 <= m_run_pc) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && req_type___0 == 0)) || ((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && 51 + req_tt_a <= a_t + c_rsp_d) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 6 <= m_run_pc) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && req_type___0 == 0) - InvariantResult [Line: 967]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && req_a == 0) && a_t == 0)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && 1 < req_a) && req_a <= 2) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t)) || ((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 1 < req_a) && req_a <= 2) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) - InvariantResult [Line: 812]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) - InvariantResult [Line: 1265]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 749]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 1184]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) || (((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t)) || (((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: (((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) || (((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || (((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev)) || (((((((1 <= a && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) - InvariantResult [Line: 1216]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= a_t) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && (((((((((1 <= a && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && req_type___0 == 0) || ((((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && (((((((((1 <= a && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && a <= 2)) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 52 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) - InvariantResult [Line: 1121]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && m_run_st == 0) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 52 <= req_d) && a_t == 0)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || ((((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && m_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 921]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && req_a == 0) && a_t == 0)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && 1 < req_a) && req_a <= 2) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t)) || ((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 1 < req_a) && req_a <= 2) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 1 <= c_m_lock) && 52 <= req_d) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && !(req_type == 0)) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && !(c_req_type == 0)) && a <= 2) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d)) || ((((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(req_type == 0)) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && x <= 52) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && req_tt_a == 2) && 2 <= a_t)) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 1208]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && m_run_st == 0) && s_memory2 <= 52) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && a <= 1) && 51 <= s_memory1) && c_req_d <= 51) && m_run_st == 0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && c_rsp_d <= 51)) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 1 <= c_m_lock) && 52 <= req_d) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && !(req_type == 0)) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && !(c_req_type == 0)) && a <= 2) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d)) || ((((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(req_type == 0)) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || ((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || (((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && a_t == 0)) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || (((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t) - InvariantResult [Line: 1192]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 1169]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || (((((((((!(req_type == 0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0)) || ((((((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || (((((((((((((((((((((2 <= c_write_req_ev && 52 <= req_d) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && !(c_m_lock == 1)) && 2 == s_run_pc) && req_d <= 52) && c_empty_req == 1) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && a <= 2)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && 2 == s_run_pc) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && ((((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0)) || (((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 2 <= req_a___0) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && ((((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2))) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && req_a___0 <= 2) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && rsp_d___0 <= 51) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && 51 + req_a___0 <= a + rsp_d___0) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && c_rsp_d <= 51) || ((((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && rsp_d___0 <= 52) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && 52 <= rsp_d___0) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) && rsp_d <= 52) && 2 <= a_t)) || (((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6))) - InvariantResult [Line: 1353]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1043]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) || (((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((3 <= a && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 <= s_memory1) && req_a___0 + 50 <= rsp_d___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 2 <= a_t)) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && rsp_d___0 < 51 + req_a___0) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && a == 2) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && req_a___0 + 50 <= rsp_d___0) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_a___0 <= a + c_rsp_d) && 51 + req_tt_a <= a_t + c_rsp_d) && ((((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) || (((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && a == 1) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) || (((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || (((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && a_t == 0)) || ((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || (((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 <= a_t) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 <= a && v <= 52) && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 <= s_memory0 && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 50 <= req_d) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && c_req_a == 1) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && c_req_a == 1) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && !(c_req_type == 0)))) && a_t == 0) && v <= 50) && 50 <= v) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((50 <= s_memory0 && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && a_t == 1) && 50 <= req_d) && s_memory0 <= 50) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && c_req_a == 1) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && c_req_a == 1) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && !(c_req_type == 0)))) && v <= 50) && 50 <= v)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((!(2 == s_run_pc) && c_req_a == 0) && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(c_req_type == 0))) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 1 <= c_m_lock) && 52 <= req_d) && c_req_type == 1) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 2 <= a) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && !(c_req_type == 0)) && a <= 2) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && req_a == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) && a + 50 <= c_req_d)) || ((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((!(req_type == 0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 52 <= req_d) && a_t <= 1) && 1 <= a_t) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && req_d <= 52) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 2 <= req_a) && req_a <= 2) && a <= 2)) || ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && a <= 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || ((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= a_t) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 590]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || (((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && 52 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) - InvariantResult [Line: 1297]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || (((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) - InvariantResult [Line: 913]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && req_a == 0) && a_t == 0)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && 1 < req_a) && req_a <= 2) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t)) || ((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 1 < req_a) && req_a <= 2) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 1319]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 6 <= m_run_pc) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 1289]: Loop Invariant Derived loop invariant: ((((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev)) && m_run_pc == 6)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && !(c_m_lock == 1)) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= a_t) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0)) || (((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && c_write_rsp_ev == 1) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_req_d <= 50) && s_memory0 <= 50) && (((((!(s_run_st == 0) && s_run_pc == 0) && m_run_st == 0) && c_empty_req == 1) && m_run_pc == 3) || (((m_run_st == 0 && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && s_memory0 <= 50) && 52 <= req_d) && (((((!(s_run_st == 0) && s_run_pc == 0) && m_run_st == 0) && c_empty_req == 1) && m_run_pc == 3) || (((m_run_st == 0 && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 3))) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && a_t == 1) && s_memory0 <= 50) && (((((!(s_run_st == 0) && s_run_pc == 0) && m_run_st == 0) && c_empty_req == 1) && m_run_pc == 3) || (((m_run_st == 0 && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && v <= 52) && c_req_type == 0) && 51 + req_a___0 <= s_memory1 + a) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 52 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && 2 == req_a___0) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((((((((((52 <= rsp_d && v <= 52) && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t)) || ((((((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && rsp_d <= 51) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 <= \result)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((v <= 52 && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && \result <= 50) - InvariantResult [Line: 945]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 52 <= s_memory2) && a == 1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || (((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 0) && 52 <= s_memory2) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 0 == req_a___0) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && req_a == 0) && a_t == 0)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((((2 <= c_req_a && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_type == 1) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 51 <= s_memory1) && 2 == s_run_pc) && 1 < req_a) && req_a <= 2) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_a <= 2) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t)) || ((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && (((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev))) && 1 < req_a) && req_a <= 2) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && c_req_a <= 2) && req_tt_a == 2) && 2 <= a_t) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v <= 52 && 2 <= c_req_a) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && 51 + req_tt_a <= a_t + rsp_d) && 52 <= s_memory2) && 51 <= s_memory1) && 51 + req_tt_a <= a_t + \result) && s_memory2 <= 52) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 2 == req_a___0) && c_req_a <= 2) && 51 + req_tt_a <= a_t + c_rsp_d) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) || (((((((((((((((v <= 52 && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && c_req_a == 1) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && a_t == 0) && req_type___0 == 0) && ((((((((((1 <= c_m_lock && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev) && a <= 2) || ((((((((1 <= c_m_lock && !(s_run_st == 0)) && a == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)))) || ((((((((((((((((((((((v <= 52 && c_req_type == 0) && c_req_a == 0) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= c_m_ev) && req_type___0 == 0) && 2 <= a_t) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && req_type == 1) && 2 <= a_t) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && x <= 50) && c_req_type == 0) && 52 <= v) && 50 <= rsp_d) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && req_tt_a == 0) && 52 <= s_memory2) && 50 <= x) && s_memory2 <= 52) && 0 == req_a___0) && rsp_d <= 50) && 50 <= \result) && 51 + req_tt_a <= s_memory1 + a_t) && s_memory0 <= 50) && c_rsp_d <= 50) && a_t == 0) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 + req_tt_a <= a_t + rsp_d) && c_write_rsp_ev == 1) && 52 <= s_memory2) && rsp_d <= 51) && 51 + req_tt_a <= a_t + \result) && a == 1) && s_memory2 <= 52) && x <= 51) && a_t == 1) && 51 + req_tt_a <= s_memory1 + a_t) && 51 + req_tt_a <= a_t + x) && s_memory0 <= 50) && 51 + req_tt_a <= a_t + c_rsp_d) && c_rsp_d <= 51)) || (((((((((((((((((((((((52 <= c_rsp_d && 52 <= rsp_d) && ((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 1 <= a_t) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && 2 <= c_m_ev) || (((((((2 <= c_write_req_ev && 1 <= c_m_lock) && a == 0) && 2 == s_run_pc) && c_empty_req == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev))) && v <= 52) && c_req_type == 0) && 52 <= v) && 50 <= s_memory0) && s_memory1 <= 51) && req_type == 0) && c_write_rsp_ev == 1) && 52 <= s_memory2) && 51 <= s_memory1) && \result <= 52) && s_memory2 <= 52) && x <= 52) && 52 <= \result) && s_memory0 <= 50) && 2 == req_a___0) && 2 <= a) && 52 <= x) && c_rsp_d <= 52) && req_tt_a == 2) && rsp_d <= 52) && 2 <= a_t) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && a == 1) && c_req_d <= 51) && 2 == s_run_pc) && a_t == 1) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((((((v <= 52 && 52 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 52 <= v) && req_d <= 52) && 50 <= s_memory0) && s_memory1 <= 51) && !(s_run_st == 0)) && 52 <= s_memory2) && 51 <= s_memory1) && s_memory2 <= 52) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 52 <= req_d) && 2 <= a) && c_req_d <= 52) && 2 <= c_m_ev) && 2 <= a_t) RESULT: Ultimate proved your program to be correct! [2021-10-13 00:49:39,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49548d2e-7446-426c-a7f1-f04160785ad8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...