./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/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_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU --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 fbba2a9273848acc92c97606d167976822a652702dabd32e61042dd7ae14e9d5 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 23:07:09,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 23:07:09,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 23:07:09,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 23:07:09,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 23:07:09,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 23:07:09,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 23:07:09,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 23:07:09,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 23:07:09,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 23:07:09,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 23:07:09,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 23:07:09,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 23:07:09,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 23:07:09,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 23:07:09,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 23:07:09,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 23:07:09,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 23:07:09,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 23:07:09,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 23:07:09,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 23:07:09,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 23:07:09,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 23:07:09,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 23:07:09,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 23:07:09,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 23:07:09,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 23:07:09,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 23:07:09,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 23:07:09,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 23:07:09,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 23:07:09,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 23:07:09,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 23:07:09,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 23:07:09,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 23:07:09,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 23:07:09,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 23:07:09,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 23:07:09,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 23:07:09,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 23:07:09,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 23:07:09,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 23:07:09,969 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 23:07:09,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 23:07:09,970 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 23:07:09,970 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 23:07:09,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 23:07:09,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 23:07:09,977 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 23:07:09,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 23:07:09,978 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 23:07:09,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 23:07:09,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 23:07:09,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 23:07:09,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 23:07:09,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 23:07:09,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 23:07:09,979 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 23:07:09,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 23:07:09,979 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 23:07:09,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 23:07:09,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 23:07:09,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 23:07:09,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 23:07:09,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:07:09,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 23:07:09,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 23:07:09,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 23:07:09,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 23:07:09,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 23:07:09,982 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 23:07:09,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 23:07:09,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 23:07:09,982 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 23:07:09,982 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_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/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_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU 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 -> fbba2a9273848acc92c97606d167976822a652702dabd32e61042dd7ae14e9d5 [2021-11-02 23:07:10,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 23:07:10,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 23:07:10,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 23:07:10,290 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 23:07:10,291 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 23:07:10,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-11-02 23:07:10,359 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/data/044928c48/bdd3d18c78f0435fb90c141a69883584/FLAG41228a3d7 [2021-11-02 23:07:10,829 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 23:07:10,830 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-11-02 23:07:10,851 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/data/044928c48/bdd3d18c78f0435fb90c141a69883584/FLAG41228a3d7 [2021-11-02 23:07:11,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/data/044928c48/bdd3d18c78f0435fb90c141a69883584 [2021-11-02 23:07:11,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 23:07:11,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 23:07:11,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 23:07:11,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 23:07:11,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 23:07:11,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbba700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11, skipping insertion in model container [2021-11-02 23:07:11,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 23:07:11,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 23:07:11,432 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_8b5ea031-c233-4c63-b6bf-74defebf784b/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-11-02 23:07:11,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:07:11,555 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 23:07:11,567 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_8b5ea031-c233-4c63-b6bf-74defebf784b/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-11-02 23:07:11,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:07:11,687 INFO L208 MainTranslator]: Completed translation [2021-11-02 23:07:11,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11 WrapperNode [2021-11-02 23:07:11,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 23:07:11,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 23:07:11,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 23:07:11,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 23:07:11,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 23:07:11,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 23:07:11,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 23:07:11,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 23:07:11,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 23:07:11,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 23:07:11,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 23:07:11,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 23:07:11,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (1/1) ... [2021-11-02 23:07:11,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:07:11,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:11,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 23:07:11,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 23:07:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 23:07:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 23:07:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 23:07:11,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 23:07:12,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 23:07:12,830 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-11-02 23:07:12,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:07:12 BoogieIcfgContainer [2021-11-02 23:07:12,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 23:07:12,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 23:07:12,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 23:07:12,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 23:07:12,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:07:11" (1/3) ... [2021-11-02 23:07:12,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d14e190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:07:12, skipping insertion in model container [2021-11-02 23:07:12,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:07:11" (2/3) ... [2021-11-02 23:07:12,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d14e190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:07:12, skipping insertion in model container [2021-11-02 23:07:12,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:07:12" (3/3) ... [2021-11-02 23:07:12,847 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2021-11-02 23:07:12,853 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 23:07:12,853 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 23:07:12,899 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 23:07:12,906 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, mAutomataTypeConcurrency=PETRI_NET, 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-11-02 23:07:12,906 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 23:07:12,931 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-11-02 23:07:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-02 23:07:12,941 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:12,942 INFO L513 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-11-02 23:07:12,943 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-11-02 23:07:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-11-02 23:07:12,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:12,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062472055] [2021-11-02 23:07:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:12,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:13,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:13,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062472055] [2021-11-02 23:07:13,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062472055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:13,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:13,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:13,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218772809] [2021-11-02 23:07:13,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:13,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:13,192 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-11-02 23:07:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:13,674 INFO L93 Difference]: Finished difference Result 725 states and 1316 transitions. [2021-11-02 23:07:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:13,679 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-11-02 23:07:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:13,701 INFO L225 Difference]: With dead ends: 725 [2021-11-02 23:07:13,706 INFO L226 Difference]: Without dead ends: 448 [2021-11-02 23:07:13,713 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-02 23:07:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 432. [2021-11-02 23:07:13,805 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-11-02 23:07:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 682 transitions. [2021-11-02 23:07:13,810 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 682 transitions. Word has length 28 [2021-11-02 23:07:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:13,810 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 682 transitions. [2021-11-02 23:07:13,811 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-11-02 23:07:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 682 transitions. [2021-11-02 23:07:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 23:07:13,814 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:13,815 INFO L513 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-11-02 23:07:13,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 23:07:13,815 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-11-02 23:07:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2021-11-02 23:07:13,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:13,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087522491] [2021-11-02 23:07:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:13,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:13,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:13,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087522491] [2021-11-02 23:07:13,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087522491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:13,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:13,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:13,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946954065] [2021-11-02 23:07:13,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:13,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:13,929 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-11-02 23:07:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:14,065 INFO L93 Difference]: Finished difference Result 1135 states and 1815 transitions. [2021-11-02 23:07:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:14,066 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-11-02 23:07:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:14,072 INFO L225 Difference]: With dead ends: 1135 [2021-11-02 23:07:14,072 INFO L226 Difference]: Without dead ends: 717 [2021-11-02 23:07:14,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-11-02 23:07:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 701. [2021-11-02 23:07:14,117 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-11-02 23:07:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1137 transitions. [2021-11-02 23:07:14,121 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1137 transitions. Word has length 38 [2021-11-02 23:07:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:14,122 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1137 transitions. [2021-11-02 23:07:14,122 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-11-02 23:07:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1137 transitions. [2021-11-02 23:07:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 23:07:14,126 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:14,126 INFO L513 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-11-02 23:07:14,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 23:07:14,127 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-11-02 23:07:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2021-11-02 23:07:14,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:14,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483006226] [2021-11-02 23:07:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:14,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:14,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:14,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483006226] [2021-11-02 23:07:14,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483006226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:14,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:14,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:14,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46373734] [2021-11-02 23:07:14,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:14,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:14,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:14,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:14,195 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-11-02 23:07:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:14,252 INFO L93 Difference]: Finished difference Result 1763 states and 2860 transitions. [2021-11-02 23:07:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:14,253 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-11-02 23:07:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:14,261 INFO L225 Difference]: With dead ends: 1763 [2021-11-02 23:07:14,261 INFO L226 Difference]: Without dead ends: 1087 [2021-11-02 23:07:14,263 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-11-02 23:07:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1075. [2021-11-02 23:07:14,327 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-11-02 23:07:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1740 transitions. [2021-11-02 23:07:14,332 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1740 transitions. Word has length 39 [2021-11-02 23:07:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:14,333 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 1740 transitions. [2021-11-02 23:07:14,333 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-11-02 23:07:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1740 transitions. [2021-11-02 23:07:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 23:07:14,335 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:14,336 INFO L513 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-11-02 23:07:14,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 23:07:14,336 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-11-02 23:07:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2021-11-02 23:07:14,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:14,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545386486] [2021-11-02 23:07:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:14,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:14,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:14,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545386486] [2021-11-02 23:07:14,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545386486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:14,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:14,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:07:14,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146461273] [2021-11-02 23:07:14,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:07:14,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:07:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:07:14,406 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-11-02 23:07:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:14,814 INFO L93 Difference]: Finished difference Result 2957 states and 4769 transitions. [2021-11-02 23:07:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:07:14,815 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-11-02 23:07:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:14,828 INFO L225 Difference]: With dead ends: 2957 [2021-11-02 23:07:14,828 INFO L226 Difference]: Without dead ends: 1907 [2021-11-02 23:07:14,833 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:07:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2021-11-02 23:07:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1677. [2021-11-02 23:07:14,924 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-11-02 23:07:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2680 transitions. [2021-11-02 23:07:14,935 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2680 transitions. Word has length 46 [2021-11-02 23:07:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:14,936 INFO L470 AbstractCegarLoop]: Abstraction has 1677 states and 2680 transitions. [2021-11-02 23:07:14,936 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-11-02 23:07:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2680 transitions. [2021-11-02 23:07:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 23:07:14,937 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:14,938 INFO L513 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-11-02 23:07:14,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 23:07:14,938 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-11-02 23:07:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-11-02 23:07:14,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:14,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330589745] [2021-11-02 23:07:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:14,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:15,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:15,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330589745] [2021-11-02 23:07:15,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330589745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:15,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:15,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:07:15,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640624389] [2021-11-02 23:07:15,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:07:15,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:07:15,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:07:15,061 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-11-02 23:07:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:15,573 INFO L93 Difference]: Finished difference Result 4989 states and 7868 transitions. [2021-11-02 23:07:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:07:15,574 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-11-02 23:07:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:15,595 INFO L225 Difference]: With dead ends: 4989 [2021-11-02 23:07:15,595 INFO L226 Difference]: Without dead ends: 3331 [2021-11-02 23:07:15,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:07:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2021-11-02 23:07:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2953. [2021-11-02 23:07:15,746 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-11-02 23:07:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4647 transitions. [2021-11-02 23:07:15,759 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4647 transitions. Word has length 52 [2021-11-02 23:07:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:15,760 INFO L470 AbstractCegarLoop]: Abstraction has 2953 states and 4647 transitions. [2021-11-02 23:07:15,760 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-11-02 23:07:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4647 transitions. [2021-11-02 23:07:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 23:07:15,762 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:15,763 INFO L513 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-11-02 23:07:15,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 23:07:15,763 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-11-02 23:07:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-11-02 23:07:15,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:15,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542144351] [2021-11-02 23:07:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:15,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:15,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:15,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542144351] [2021-11-02 23:07:15,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542144351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:15,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:15,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:15,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773718295] [2021-11-02 23:07:15,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:15,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:15,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:15,852 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-11-02 23:07:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:16,110 INFO L93 Difference]: Finished difference Result 6943 states and 10882 transitions. [2021-11-02 23:07:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:16,111 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-11-02 23:07:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:16,143 INFO L225 Difference]: With dead ends: 6943 [2021-11-02 23:07:16,144 INFO L226 Difference]: Without dead ends: 4013 [2021-11-02 23:07:16,149 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2021-11-02 23:07:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3829. [2021-11-02 23:07:16,390 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-11-02 23:07:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 5949 transitions. [2021-11-02 23:07:16,408 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 5949 transitions. Word has length 52 [2021-11-02 23:07:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:16,409 INFO L470 AbstractCegarLoop]: Abstraction has 3829 states and 5949 transitions. [2021-11-02 23:07:16,410 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-11-02 23:07:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 5949 transitions. [2021-11-02 23:07:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-02 23:07:16,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:16,414 INFO L513 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-11-02 23:07:16,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 23:07:16,414 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-11-02 23:07:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1900061236, now seen corresponding path program 1 times [2021-11-02 23:07:16,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:16,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413268643] [2021-11-02 23:07:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:16,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:16,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:16,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413268643] [2021-11-02 23:07:16,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413268643] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:16,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:16,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:16,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134943408] [2021-11-02 23:07:16,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:16,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:16,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:16,505 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-11-02 23:07:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:16,977 INFO L93 Difference]: Finished difference Result 9203 states and 14417 transitions. [2021-11-02 23:07:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:16,978 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-11-02 23:07:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:17,009 INFO L225 Difference]: With dead ends: 9203 [2021-11-02 23:07:17,009 INFO L226 Difference]: Without dead ends: 5397 [2021-11-02 23:07:17,015 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2021-11-02 23:07:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 4635. [2021-11-02 23:07:17,230 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-11-02 23:07:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 6938 transitions. [2021-11-02 23:07:17,290 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 6938 transitions. Word has length 58 [2021-11-02 23:07:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:17,291 INFO L470 AbstractCegarLoop]: Abstraction has 4635 states and 6938 transitions. [2021-11-02 23:07:17,291 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-11-02 23:07:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 6938 transitions. [2021-11-02 23:07:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 23:07:17,294 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:17,294 INFO L513 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-11-02 23:07:17,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 23:07:17,294 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-11-02 23:07:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2021-11-02 23:07:17,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:17,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910289283] [2021-11-02 23:07:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:17,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:17,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:17,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910289283] [2021-11-02 23:07:17,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910289283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:17,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:17,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:17,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134005980] [2021-11-02 23:07:17,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:17,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:17,334 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-11-02 23:07:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:17,575 INFO L93 Difference]: Finished difference Result 9113 states and 13653 transitions. [2021-11-02 23:07:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:17,575 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-11-02 23:07:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:17,603 INFO L225 Difference]: With dead ends: 9113 [2021-11-02 23:07:17,603 INFO L226 Difference]: Without dead ends: 4501 [2021-11-02 23:07:17,641 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-11-02 23:07:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4501. [2021-11-02 23:07:17,900 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-11-02 23:07:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6637 transitions. [2021-11-02 23:07:17,920 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6637 transitions. Word has length 60 [2021-11-02 23:07:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:17,920 INFO L470 AbstractCegarLoop]: Abstraction has 4501 states and 6637 transitions. [2021-11-02 23:07:17,921 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-11-02 23:07:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6637 transitions. [2021-11-02 23:07:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 23:07:17,924 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:17,924 INFO L513 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-11-02 23:07:17,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 23:07:17,925 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-11-02 23:07:17,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash -468089154, now seen corresponding path program 1 times [2021-11-02 23:07:17,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:17,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156033291] [2021-11-02 23:07:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:17,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:17,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:17,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156033291] [2021-11-02 23:07:17,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156033291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:17,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:17,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:17,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688418258] [2021-11-02 23:07:17,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:17,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:17,956 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-11-02 23:07:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:18,246 INFO L93 Difference]: Finished difference Result 9649 states and 14392 transitions. [2021-11-02 23:07:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:18,247 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-11-02 23:07:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:18,275 INFO L225 Difference]: With dead ends: 9649 [2021-11-02 23:07:18,275 INFO L226 Difference]: Without dead ends: 5171 [2021-11-02 23:07:18,289 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5171 states. [2021-11-02 23:07:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5171 to 3471. [2021-11-02 23:07:18,488 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-11-02 23:07:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5175 transitions. [2021-11-02 23:07:18,497 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 5175 transitions. Word has length 61 [2021-11-02 23:07:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:18,498 INFO L470 AbstractCegarLoop]: Abstraction has 3471 states and 5175 transitions. [2021-11-02 23:07:18,499 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-11-02 23:07:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 5175 transitions. [2021-11-02 23:07:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-02 23:07:18,500 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:18,501 INFO L513 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-11-02 23:07:18,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 23:07:18,501 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-11-02 23:07:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2021-11-02 23:07:18,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:18,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284718063] [2021-11-02 23:07:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:18,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:18,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:18,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284718063] [2021-11-02 23:07:18,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284718063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:18,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:18,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:07:18,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906343423] [2021-11-02 23:07:18,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:07:18,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:07:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:18,579 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-11-02 23:07:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:19,788 INFO L93 Difference]: Finished difference Result 16445 states and 24335 transitions. [2021-11-02 23:07:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 23:07:19,788 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-11-02 23:07:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:19,827 INFO L225 Difference]: With dead ends: 16445 [2021-11-02 23:07:19,827 INFO L226 Difference]: Without dead ends: 13193 [2021-11-02 23:07:19,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-02 23:07:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13193 states. [2021-11-02 23:07:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13193 to 4337. [2021-11-02 23:07:20,224 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-11-02 23:07:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 6433 transitions. [2021-11-02 23:07:20,242 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 6433 transitions. Word has length 63 [2021-11-02 23:07:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:20,242 INFO L470 AbstractCegarLoop]: Abstraction has 4337 states and 6433 transitions. [2021-11-02 23:07:20,242 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-11-02 23:07:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 6433 transitions. [2021-11-02 23:07:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 23:07:20,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:20,245 INFO L513 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-11-02 23:07:20,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 23:07:20,246 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-11-02 23:07:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2021-11-02 23:07:20,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:20,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461326131] [2021-11-02 23:07:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:20,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:20,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:20,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461326131] [2021-11-02 23:07:20,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461326131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:20,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:20,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:07:20,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684671279] [2021-11-02 23:07:20,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:07:20,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:20,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:07:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:07:20,344 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-11-02 23:07:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:22,368 INFO L93 Difference]: Finished difference Result 29901 states and 44086 transitions. [2021-11-02 23:07:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-02 23:07:22,369 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-11-02 23:07:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:22,435 INFO L225 Difference]: With dead ends: 29901 [2021-11-02 23:07:22,435 INFO L226 Difference]: Without dead ends: 25783 [2021-11-02 23:07:22,448 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-11-02 23:07:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25783 states. [2021-11-02 23:07:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25783 to 4645. [2021-11-02 23:07:23,011 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-11-02 23:07:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 6843 transitions. [2021-11-02 23:07:23,026 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 6843 transitions. Word has length 64 [2021-11-02 23:07:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:23,027 INFO L470 AbstractCegarLoop]: Abstraction has 4645 states and 6843 transitions. [2021-11-02 23:07:23,028 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-11-02 23:07:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 6843 transitions. [2021-11-02 23:07:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-02 23:07:23,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:23,031 INFO L513 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-11-02 23:07:23,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 23:07:23,032 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-11-02 23:07:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -642302294, now seen corresponding path program 1 times [2021-11-02 23:07:23,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:23,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949735456] [2021-11-02 23:07:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:23,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:23,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:23,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949735456] [2021-11-02 23:07:23,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949735456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:23,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:23,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:23,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800570520] [2021-11-02 23:07:23,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:23,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:23,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:23,065 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-11-02 23:07:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:23,527 INFO L93 Difference]: Finished difference Result 9788 states and 14388 transitions. [2021-11-02 23:07:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:23,527 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-11-02 23:07:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:23,543 INFO L225 Difference]: With dead ends: 9788 [2021-11-02 23:07:23,544 INFO L226 Difference]: Without dead ends: 5164 [2021-11-02 23:07:23,553 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2021-11-02 23:07:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5090. [2021-11-02 23:07:23,955 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-11-02 23:07:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 7472 transitions. [2021-11-02 23:07:23,966 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 7472 transitions. Word has length 77 [2021-11-02 23:07:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:23,967 INFO L470 AbstractCegarLoop]: Abstraction has 5090 states and 7472 transitions. [2021-11-02 23:07:23,967 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-11-02 23:07:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 7472 transitions. [2021-11-02 23:07:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-02 23:07:23,970 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:23,970 INFO L513 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-11-02 23:07:23,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 23:07:23,971 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-11-02 23:07:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2021-11-02 23:07:23,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:23,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386732835] [2021-11-02 23:07:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:23,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:24,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:24,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386732835] [2021-11-02 23:07:24,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386732835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:24,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:24,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:07:24,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061206732] [2021-11-02 23:07:24,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:07:24,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:07:24,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:07:24,011 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-11-02 23:07:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:24,852 INFO L93 Difference]: Finished difference Result 13614 states and 19820 transitions. [2021-11-02 23:07:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 23:07:24,852 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-11-02 23:07:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:24,873 INFO L225 Difference]: With dead ends: 13614 [2021-11-02 23:07:24,873 INFO L226 Difference]: Without dead ends: 8424 [2021-11-02 23:07:24,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:07:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2021-11-02 23:07:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 7525. [2021-11-02 23:07:25,337 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-11-02 23:07:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 10832 transitions. [2021-11-02 23:07:25,354 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 10832 transitions. Word has length 88 [2021-11-02 23:07:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:25,355 INFO L470 AbstractCegarLoop]: Abstraction has 7525 states and 10832 transitions. [2021-11-02 23:07:25,355 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-11-02 23:07:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 10832 transitions. [2021-11-02 23:07:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-02 23:07:25,358 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:25,358 INFO L513 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-11-02 23:07:25,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 23:07:25,359 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-11-02 23:07:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2021-11-02 23:07:25,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:25,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422435067] [2021-11-02 23:07:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:25,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:25,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:25,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422435067] [2021-11-02 23:07:25,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422435067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:25,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:25,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:25,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581043856] [2021-11-02 23:07:25,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:25,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:25,403 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-11-02 23:07:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:25,790 INFO L93 Difference]: Finished difference Result 10856 states and 15661 transitions. [2021-11-02 23:07:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:25,791 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-11-02 23:07:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:25,806 INFO L225 Difference]: With dead ends: 10856 [2021-11-02 23:07:25,806 INFO L226 Difference]: Without dead ends: 3339 [2021-11-02 23:07:25,816 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-11-02 23:07:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3286. [2021-11-02 23:07:26,039 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-11-02 23:07:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4433 transitions. [2021-11-02 23:07:26,046 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4433 transitions. Word has length 95 [2021-11-02 23:07:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:26,047 INFO L470 AbstractCegarLoop]: Abstraction has 3286 states and 4433 transitions. [2021-11-02 23:07:26,047 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-11-02 23:07:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4433 transitions. [2021-11-02 23:07:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-02 23:07:26,049 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:26,049 INFO L513 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-11-02 23:07:26,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 23:07:26,049 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-11-02 23:07:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1416682179, now seen corresponding path program 1 times [2021-11-02 23:07:26,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:26,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630892316] [2021-11-02 23:07:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:26,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:26,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:26,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630892316] [2021-11-02 23:07:26,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630892316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:26,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:26,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:07:26,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893946375] [2021-11-02 23:07:26,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:07:26,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:07:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:07:26,101 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-11-02 23:07:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:26,949 INFO L93 Difference]: Finished difference Result 12537 states and 16915 transitions. [2021-11-02 23:07:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 23:07:26,950 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-11-02 23:07:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:26,975 INFO L225 Difference]: With dead ends: 12537 [2021-11-02 23:07:26,975 INFO L226 Difference]: Without dead ends: 9425 [2021-11-02 23:07:26,981 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:07:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9425 states. [2021-11-02 23:07:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9425 to 3288. [2021-11-02 23:07:27,363 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-11-02 23:07:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4429 transitions. [2021-11-02 23:07:27,370 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4429 transitions. Word has length 98 [2021-11-02 23:07:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:27,371 INFO L470 AbstractCegarLoop]: Abstraction has 3288 states and 4429 transitions. [2021-11-02 23:07:27,371 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-11-02 23:07:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4429 transitions. [2021-11-02 23:07:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-02 23:07:27,376 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:27,376 INFO L513 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-11-02 23:07:27,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 23:07:27,377 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-11-02 23:07:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1620290344, now seen corresponding path program 1 times [2021-11-02 23:07:27,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:27,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107601307] [2021-11-02 23:07:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:27,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:27,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:27,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107601307] [2021-11-02 23:07:27,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107601307] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:27,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130202939] [2021-11-02 23:07:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:27,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:27,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:27,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 23:07:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:27,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 23:07:27,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:07:27,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130202939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:27,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:07:27,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-02 23:07:27,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383944927] [2021-11-02 23:07:27,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:27,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:27,970 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-11-02 23:07:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:28,351 INFO L93 Difference]: Finished difference Result 3923 states and 5276 transitions. [2021-11-02 23:07:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:28,352 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-11-02 23:07:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:28,362 INFO L225 Difference]: With dead ends: 3923 [2021-11-02 23:07:28,363 INFO L226 Difference]: Without dead ends: 3919 [2021-11-02 23:07:28,365 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2021-11-02 23:07:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3869. [2021-11-02 23:07:28,749 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-11-02 23:07:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 5200 transitions. [2021-11-02 23:07:28,758 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 5200 transitions. Word has length 100 [2021-11-02 23:07:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:28,758 INFO L470 AbstractCegarLoop]: Abstraction has 3869 states and 5200 transitions. [2021-11-02 23:07:28,759 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-11-02 23:07:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 5200 transitions. [2021-11-02 23:07:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-02 23:07:28,763 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:28,763 INFO L513 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-11-02 23:07:28,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-02 23:07:28,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-02 23:07:28,980 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-11-02 23:07:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash -576078609, now seen corresponding path program 1 times [2021-11-02 23:07:28,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:28,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533996647] [2021-11-02 23:07:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:28,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:07:29,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:29,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533996647] [2021-11-02 23:07:29,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533996647] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:29,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674435233] [2021-11-02 23:07:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:29,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:29,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:29,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 23:07:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:29,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 23:07:29,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:07:29,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674435233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:29,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:07:29,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-02 23:07:29,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30557365] [2021-11-02 23:07:29,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:29,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:29,633 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-11-02 23:07:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:29,935 INFO L93 Difference]: Finished difference Result 6887 states and 9305 transitions. [2021-11-02 23:07:29,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:29,936 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-11-02 23:07:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:29,941 INFO L225 Difference]: With dead ends: 6887 [2021-11-02 23:07:29,941 INFO L226 Difference]: Without dead ends: 3027 [2021-11-02 23:07:29,948 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2021-11-02 23:07:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2806. [2021-11-02 23:07:30,196 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-11-02 23:07:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3712 transitions. [2021-11-02 23:07:30,199 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3712 transitions. Word has length 154 [2021-11-02 23:07:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:30,200 INFO L470 AbstractCegarLoop]: Abstraction has 2806 states and 3712 transitions. [2021-11-02 23:07:30,200 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-11-02 23:07:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3712 transitions. [2021-11-02 23:07:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-02 23:07:30,202 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:30,202 INFO L513 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-11-02 23:07:30,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:30,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-02 23:07:30,416 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-11-02 23:07:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1529302704, now seen corresponding path program 1 times [2021-11-02 23:07:30,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:30,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512441905] [2021-11-02 23:07:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:30,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:07:30,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:30,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512441905] [2021-11-02 23:07:30,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512441905] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:30,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518971577] [2021-11-02 23:07:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:30,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:30,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:30,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:30,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 23:07:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:30,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 23:07:30,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 23:07:31,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518971577] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:31,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:07:31,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-02 23:07:31,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167703343] [2021-11-02 23:07:31,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:31,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:31,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:31,131 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-11-02 23:07:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:31,407 INFO L93 Difference]: Finished difference Result 5443 states and 7240 transitions. [2021-11-02 23:07:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:31,408 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-11-02 23:07:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:31,412 INFO L225 Difference]: With dead ends: 5443 [2021-11-02 23:07:31,413 INFO L226 Difference]: Without dead ends: 2806 [2021-11-02 23:07:31,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-11-02 23:07:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2806. [2021-11-02 23:07:31,663 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-11-02 23:07:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3616 transitions. [2021-11-02 23:07:31,668 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3616 transitions. Word has length 157 [2021-11-02 23:07:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:31,668 INFO L470 AbstractCegarLoop]: Abstraction has 2806 states and 3616 transitions. [2021-11-02 23:07:31,668 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-11-02 23:07:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3616 transitions. [2021-11-02 23:07:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-02 23:07:31,672 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:31,672 INFO L513 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-11-02 23:07:31,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:31,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-02 23:07:31,900 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-11-02 23:07:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1270598443, now seen corresponding path program 1 times [2021-11-02 23:07:31,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:31,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979841129] [2021-11-02 23:07:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:31,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:07:31,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:31,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979841129] [2021-11-02 23:07:31,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979841129] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:31,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345717636] [2021-11-02 23:07:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:31,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:31,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:32,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-02 23:07:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:32,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 23:07:32,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-02 23:07:32,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345717636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:32,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:07:32,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-02 23:07:32,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030043404] [2021-11-02 23:07:32,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:32,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:32,603 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-11-02 23:07:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:33,127 INFO L93 Difference]: Finished difference Result 6342 states and 8333 transitions. [2021-11-02 23:07:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:33,127 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-11-02 23:07:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:33,133 INFO L225 Difference]: With dead ends: 6342 [2021-11-02 23:07:33,133 INFO L226 Difference]: Without dead ends: 3705 [2021-11-02 23:07:33,138 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:07:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2021-11-02 23:07:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3614. [2021-11-02 23:07:33,458 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-11-02 23:07:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4545 transitions. [2021-11-02 23:07:33,465 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4545 transitions. Word has length 158 [2021-11-02 23:07:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:33,466 INFO L470 AbstractCegarLoop]: Abstraction has 3614 states and 4545 transitions. [2021-11-02 23:07:33,466 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-11-02 23:07:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4545 transitions. [2021-11-02 23:07:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-02 23:07:33,471 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:33,471 INFO L513 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-11-02 23:07:33,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:33,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:33,698 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-11-02 23:07:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2021-11-02 23:07:33,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:33,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924699303] [2021-11-02 23:07:33,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:33,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:07:33,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:33,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924699303] [2021-11-02 23:07:33,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924699303] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:33,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472710460] [2021-11-02 23:07:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:33,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:33,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:33,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:33,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-02 23:07:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:34,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 23:07:34,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:07:34,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472710460] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:34,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:07:34,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-11-02 23:07:34,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979203703] [2021-11-02 23:07:34,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 23:07:34,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 23:07:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:07:34,665 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-11-02 23:07:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:36,617 INFO L93 Difference]: Finished difference Result 18152 states and 22925 transitions. [2021-11-02 23:07:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-02 23:07:36,617 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-11-02 23:07:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:36,637 INFO L225 Difference]: With dead ends: 18152 [2021-11-02 23:07:36,637 INFO L226 Difference]: Without dead ends: 14707 [2021-11-02 23:07:36,645 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2021-11-02 23:07:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14707 states. [2021-11-02 23:07:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14707 to 5121. [2021-11-02 23:07:37,298 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-11-02 23:07:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 6468 transitions. [2021-11-02 23:07:37,306 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 6468 transitions. Word has length 160 [2021-11-02 23:07:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:37,307 INFO L470 AbstractCegarLoop]: Abstraction has 5121 states and 6468 transitions. [2021-11-02 23:07:37,307 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-11-02 23:07:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 6468 transitions. [2021-11-02 23:07:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-11-02 23:07:37,312 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:37,313 INFO L513 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-11-02 23:07:37,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:37,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:37,539 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-11-02 23:07:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2021-11-02 23:07:37,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:37,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385673482] [2021-11-02 23:07:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:37,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 189 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-02 23:07:37,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:37,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385673482] [2021-11-02 23:07:37,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385673482] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:37,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033953006] [2021-11-02 23:07:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:37,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:37,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:37,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-02 23:07:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:38,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 23:07:38,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-02 23:07:39,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033953006] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:39,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:07:39,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2021-11-02 23:07:39,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612095918] [2021-11-02 23:07:39,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 23:07:39,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:39,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 23:07:39,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-02 23:07:39,273 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-11-02 23:07:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:42,526 INFO L93 Difference]: Finished difference Result 24658 states and 31106 transitions. [2021-11-02 23:07:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-02 23:07:42,527 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-11-02 23:07:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:42,557 INFO L225 Difference]: With dead ends: 24658 [2021-11-02 23:07:42,557 INFO L226 Difference]: Without dead ends: 19706 [2021-11-02 23:07:42,567 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=551, Invalid=2989, Unknown=0, NotChecked=0, Total=3540 [2021-11-02 23:07:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19706 states. [2021-11-02 23:07:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19706 to 6345. [2021-11-02 23:07:43,185 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-11-02 23:07:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 8036 transitions. [2021-11-02 23:07:43,193 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 8036 transitions. Word has length 258 [2021-11-02 23:07:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:43,194 INFO L470 AbstractCegarLoop]: Abstraction has 6345 states and 8036 transitions. [2021-11-02 23:07:43,194 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-11-02 23:07:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 8036 transitions. [2021-11-02 23:07:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-11-02 23:07:43,202 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:43,202 INFO L513 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-11-02 23:07:43,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-02 23:07:43,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:43,416 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-11-02 23:07:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1050472350, now seen corresponding path program 1 times [2021-11-02 23:07:43,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:43,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470713301] [2021-11-02 23:07:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:43,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-11-02 23:07:43,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:43,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470713301] [2021-11-02 23:07:43,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470713301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:43,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:43,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:43,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818273809] [2021-11-02 23:07:43,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:43,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:43,535 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-11-02 23:07:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:43,794 INFO L93 Difference]: Finished difference Result 7580 states and 9437 transitions. [2021-11-02 23:07:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:43,794 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-11-02 23:07:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:43,796 INFO L225 Difference]: With dead ends: 7580 [2021-11-02 23:07:43,796 INFO L226 Difference]: Without dead ends: 1293 [2021-11-02 23:07:43,802 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2021-11-02 23:07:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 914. [2021-11-02 23:07:43,957 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-11-02 23:07:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 980 transitions. [2021-11-02 23:07:43,959 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 980 transitions. Word has length 358 [2021-11-02 23:07:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:43,960 INFO L470 AbstractCegarLoop]: Abstraction has 914 states and 980 transitions. [2021-11-02 23:07:43,960 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-11-02 23:07:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 980 transitions. [2021-11-02 23:07:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-11-02 23:07:43,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:43,964 INFO L513 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-11-02 23:07:43,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 23:07:43,964 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-11-02 23:07:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2021-11-02 23:07:43,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:43,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464866832] [2021-11-02 23:07:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:43,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-11-02 23:07:44,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:44,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464866832] [2021-11-02 23:07:44,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464866832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:44,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:44,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:07:44,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184557399] [2021-11-02 23:07:44,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:07:44,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:44,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:07:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:07:44,071 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-11-02 23:07:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:44,395 INFO L93 Difference]: Finished difference Result 2047 states and 2228 transitions. [2021-11-02 23:07:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 23:07:44,396 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-11-02 23:07:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:44,399 INFO L225 Difference]: With dead ends: 2047 [2021-11-02 23:07:44,399 INFO L226 Difference]: Without dead ends: 1846 [2021-11-02 23:07:44,400 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-11-02 23:07:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2021-11-02 23:07:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 980. [2021-11-02 23:07:44,495 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-11-02 23:07:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1053 transitions. [2021-11-02 23:07:44,497 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1053 transitions. Word has length 359 [2021-11-02 23:07:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:44,497 INFO L470 AbstractCegarLoop]: Abstraction has 980 states and 1053 transitions. [2021-11-02 23:07:44,498 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-11-02 23:07:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1053 transitions. [2021-11-02 23:07:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-11-02 23:07:44,500 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:44,501 INFO L513 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-11-02 23:07:44,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 23:07:44,501 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-11-02 23:07:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2021-11-02 23:07:44,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:44,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276365746] [2021-11-02 23:07:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:44,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-11-02 23:07:44,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:44,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276365746] [2021-11-02 23:07:44,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276365746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:44,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:44,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:07:44,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102292080] [2021-11-02 23:07:44,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:07:44,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:07:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:07:44,596 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-11-02 23:07:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:44,760 INFO L93 Difference]: Finished difference Result 1347 states and 1459 transitions. [2021-11-02 23:07:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:07:44,761 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-11-02 23:07:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:44,762 INFO L225 Difference]: With dead ends: 1347 [2021-11-02 23:07:44,762 INFO L226 Difference]: Without dead ends: 1146 [2021-11-02 23:07:44,763 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:07:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-11-02 23:07:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 968. [2021-11-02 23:07:44,859 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-11-02 23:07:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1030 transitions. [2021-11-02 23:07:44,860 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1030 transitions. Word has length 360 [2021-11-02 23:07:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:44,861 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1030 transitions. [2021-11-02 23:07:44,861 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-11-02 23:07:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1030 transitions. [2021-11-02 23:07:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-11-02 23:07:44,864 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:44,864 INFO L513 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-11-02 23:07:44,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 23:07:44,865 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-11-02 23:07:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2021-11-02 23:07:44,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:44,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055111172] [2021-11-02 23:07:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:44,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2021-11-02 23:07:44,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:44,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055111172] [2021-11-02 23:07:44,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055111172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:07:44,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:07:44,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:07:44,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443291555] [2021-11-02 23:07:44,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:07:44,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:44,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:07:44,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:44,963 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-11-02 23:07:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:45,072 INFO L93 Difference]: Finished difference Result 1553 states and 1651 transitions. [2021-11-02 23:07:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:07:45,072 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-11-02 23:07:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:45,074 INFO L225 Difference]: With dead ends: 1553 [2021-11-02 23:07:45,074 INFO L226 Difference]: Without dead ends: 843 [2021-11-02 23:07:45,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:07:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-11-02 23:07:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 673. [2021-11-02 23:07:45,142 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-11-02 23:07:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 718 transitions. [2021-11-02 23:07:45,143 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 718 transitions. Word has length 417 [2021-11-02 23:07:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:45,143 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 718 transitions. [2021-11-02 23:07:45,143 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-11-02 23:07:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 718 transitions. [2021-11-02 23:07:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-11-02 23:07:45,146 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:45,146 INFO L513 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-11-02 23:07:45,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 23:07:45,147 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-11-02 23:07:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2021-11-02 23:07:45,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:45,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526889915] [2021-11-02 23:07:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:45,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-11-02 23:07:45,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:45,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526889915] [2021-11-02 23:07:45,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526889915] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:45,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772374536] [2021-11-02 23:07:45,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:45,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:45,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:45,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-02 23:07:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:46,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-02 23:07:46,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-11-02 23:07:48,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772374536] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:48,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:07:48,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2021-11-02 23:07:48,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145283819] [2021-11-02 23:07:48,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 23:07:48,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 23:07:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-11-02 23:07:48,801 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-11-02 23:07:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:49,664 INFO L93 Difference]: Finished difference Result 918 states and 981 transitions. [2021-11-02 23:07:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-02 23:07:49,664 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-11-02 23:07:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:49,666 INFO L225 Difference]: With dead ends: 918 [2021-11-02 23:07:49,666 INFO L226 Difference]: Without dead ends: 916 [2021-11-02 23:07:49,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2021-11-02 23:07:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-11-02 23:07:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 734. [2021-11-02 23:07:49,752 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-11-02 23:07:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 780 transitions. [2021-11-02 23:07:49,753 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 780 transitions. Word has length 417 [2021-11-02 23:07:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:49,754 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 780 transitions. [2021-11-02 23:07:49,754 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-11-02 23:07:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 780 transitions. [2021-11-02 23:07:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2021-11-02 23:07:49,756 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:49,757 INFO L513 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-11-02 23:07:49,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:49,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:49,960 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-11-02 23:07:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2021-11-02 23:07:49,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:49,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556139376] [2021-11-02 23:07:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:49,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-02 23:07:50,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:50,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556139376] [2021-11-02 23:07:50,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556139376] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:50,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235314714] [2021-11-02 23:07:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:50,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:50,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:50,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:50,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-02 23:07:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:51,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 23:07:51,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-02 23:07:52,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235314714] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:52,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:07:52,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-11-02 23:07:52,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127677570] [2021-11-02 23:07:52,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 23:07:52,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 23:07:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:07:52,203 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-11-02 23:07:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:52,595 INFO L93 Difference]: Finished difference Result 1281 states and 1368 transitions. [2021-11-02 23:07:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 23:07:52,596 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-11-02 23:07:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:52,598 INFO L225 Difference]: With dead ends: 1281 [2021-11-02 23:07:52,598 INFO L226 Difference]: Without dead ends: 1151 [2021-11-02 23:07:52,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-11-02 23:07:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-11-02 23:07:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 798. [2021-11-02 23:07:52,694 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-11-02 23:07:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 849 transitions. [2021-11-02 23:07:52,695 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 849 transitions. Word has length 464 [2021-11-02 23:07:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:52,696 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 849 transitions. [2021-11-02 23:07:52,696 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-11-02 23:07:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 849 transitions. [2021-11-02 23:07:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2021-11-02 23:07:52,700 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:52,701 INFO L513 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-11-02 23:07:52,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-02 23:07:52,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-02 23:07:52,916 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-11-02 23:07:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2021-11-02 23:07:52,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:52,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30582681] [2021-11-02 23:07:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:52,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 137 proven. 527 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-11-02 23:07:53,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:53,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30582681] [2021-11-02 23:07:53,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30582681] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:53,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227242165] [2021-11-02 23:07:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:53,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:53,383 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:53,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-02 23:07:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:54,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-02 23:07:54,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:07:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-11-02 23:07:57,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227242165] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:57,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:07:57,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2021-11-02 23:07:57,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444290753] [2021-11-02 23:07:57,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-02 23:07:57,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:07:57,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-02 23:07:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2021-11-02 23:07:57,688 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-11-02 23:07:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:07:58,813 INFO L93 Difference]: Finished difference Result 1063 states and 1132 transitions. [2021-11-02 23:07:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-02 23:07:58,813 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-11-02 23:07:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:07:58,814 INFO L225 Difference]: With dead ends: 1063 [2021-11-02 23:07:58,814 INFO L226 Difference]: Without dead ends: 1061 [2021-11-02 23:07:58,816 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=419, Invalid=3121, Unknown=0, NotChecked=0, Total=3540 [2021-11-02 23:07:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-11-02 23:07:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 859. [2021-11-02 23:07:58,924 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-11-02 23:07:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 911 transitions. [2021-11-02 23:07:58,925 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 911 transitions. Word has length 523 [2021-11-02 23:07:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:07:58,925 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 911 transitions. [2021-11-02 23:07:58,925 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-11-02 23:07:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 911 transitions. [2021-11-02 23:07:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2021-11-02 23:07:58,928 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:07:58,929 INFO L513 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-11-02 23:07:58,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-02 23:07:59,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-02 23:07:59,129 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-11-02 23:07:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:07:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2021-11-02 23:07:59,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:07:59,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605343172] [2021-11-02 23:07:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:59,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:07:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:07:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 25 proven. 725 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-11-02 23:07:59,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:07:59,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605343172] [2021-11-02 23:07:59,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605343172] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:07:59,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350831217] [2021-11-02 23:07:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:07:59,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:07:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:07:59,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:07:59,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-02 23:08:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:08:00,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 23:08:00,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:08:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-11-02 23:08:02,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350831217] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:08:02,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:08:02,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 26 [2021-11-02 23:08:02,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541725643] [2021-11-02 23:08:02,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-02 23:08:02,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:08:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-02 23:08:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2021-11-02 23:08:02,392 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-11-02 23:08:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:08:06,365 INFO L93 Difference]: Finished difference Result 2557 states and 2721 transitions. [2021-11-02 23:08:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-11-02 23:08:06,365 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-11-02 23:08:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:08:06,369 INFO L225 Difference]: With dead ends: 2557 [2021-11-02 23:08:06,369 INFO L226 Difference]: Without dead ends: 2427 [2021-11-02 23:08:06,378 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 626 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6574 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2073, Invalid=17109, Unknown=0, NotChecked=0, Total=19182 [2021-11-02 23:08:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2021-11-02 23:08:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 985. [2021-11-02 23:08:06,551 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-11-02 23:08:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1044 transitions. [2021-11-02 23:08:06,552 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1044 transitions. Word has length 570 [2021-11-02 23:08:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:08:06,553 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1044 transitions. [2021-11-02 23:08:06,553 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-11-02 23:08:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1044 transitions. [2021-11-02 23:08:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2021-11-02 23:08:06,556 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:08:06,556 INFO L513 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-11-02 23:08:06,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-02 23:08:06,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-02 23:08:06,757 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-11-02 23:08:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:08:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2021-11-02 23:08:06,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:08:06,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265429573] [2021-11-02 23:08:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:08:06,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:08:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:08:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 96 proven. 990 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-02 23:08:07,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:08:07,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265429573] [2021-11-02 23:08:07,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265429573] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:08:07,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980031974] [2021-11-02 23:08:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:08:07,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:08:07,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:08:07,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:08:07,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-02 23:08:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:08:08,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-02 23:08:08,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:08:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-02 23:08:13,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980031974] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:08:13,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 23:08:13,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2021-11-02 23:08:13,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053157553] [2021-11-02 23:08:13,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-02 23:08:13,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:08:13,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-02 23:08:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2021-11-02 23:08:13,107 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-11-02 23:08:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:08:15,283 INFO L93 Difference]: Finished difference Result 2034 states and 2156 transitions. [2021-11-02 23:08:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-02 23:08:15,283 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-11-02 23:08:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:08:15,285 INFO L225 Difference]: With dead ends: 2034 [2021-11-02 23:08:15,285 INFO L226 Difference]: Without dead ends: 2032 [2021-11-02 23:08:15,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 642 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=652, Invalid=6154, Unknown=0, NotChecked=0, Total=6806 [2021-11-02 23:08:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2021-11-02 23:08:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1475. [2021-11-02 23:08:15,520 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-11-02 23:08:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1559 transitions. [2021-11-02 23:08:15,521 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1559 transitions. Word has length 630 [2021-11-02 23:08:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:08:15,522 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 1559 transitions. [2021-11-02 23:08:15,522 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-11-02 23:08:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1559 transitions. [2021-11-02 23:08:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2021-11-02 23:08:15,526 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:08:15,527 INFO L513 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-11-02 23:08:15,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-02 23:08:15,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:08:15,727 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-11-02 23:08:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:08:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash -16317840, now seen corresponding path program 1 times [2021-11-02 23:08:15,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:08:15,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574280804] [2021-11-02 23:08:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:08:15,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:08:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:08:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 235 proven. 895 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-11-02 23:08:16,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:08:16,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574280804] [2021-11-02 23:08:16,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574280804] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:08:16,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873685358] [2021-11-02 23:08:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:08:16,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:08:16,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:08:16,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:08:16,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-02 23:08:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:08:18,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-02 23:08:18,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:08:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-11-02 23:08:19,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873685358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:08:19,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:08:19,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 24 [2021-11-02 23:08:19,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288806371] [2021-11-02 23:08:19,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 23:08:19,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:08:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 23:08:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2021-11-02 23:08:19,560 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-11-02 23:08:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:08:19,834 INFO L93 Difference]: Finished difference Result 1493 states and 1577 transitions. [2021-11-02 23:08:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 23:08:19,835 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-11-02 23:08:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:08:19,835 INFO L225 Difference]: With dead ends: 1493 [2021-11-02 23:08:19,835 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 23:08:19,837 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2021-11-02 23:08:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 23:08:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 23:08:19,837 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-11-02 23:08:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 23:08:19,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 677 [2021-11-02 23:08:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:08:19,837 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 23:08:19,838 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-11-02 23:08:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 23:08:19,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 23:08:19,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:08:19,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:08:19,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:08:19,841 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:08:19,841 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:08:19,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-02 23:08:20,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:08:20,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 23:08:20,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:20,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:20,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:21,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:21,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:21,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:22,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:22,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:22,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:22,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:23,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:24,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:24,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:27,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:27,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:27,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:27,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:27,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:27,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:28,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:28,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:28,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:28,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:28,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:28,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:29,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:30,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:30,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:30,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:31,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:31,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:31,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:31,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:31,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:31,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:32,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:33,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:33,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:33,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:33,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:33,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:36,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:36,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:36,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:36,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:36,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:37,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:37,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:37,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:37,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:38,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:38,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:38,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:39,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:40,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:40,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:41,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:41,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:41,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:42,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:43,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:43,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:44,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:44,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:44,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:44,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:46,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:46,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:46,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:46,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:08:47,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:09:04,433 WARN L207 SmtUtils]: Spent 7.52 s on a formula simplification. DAG size of input: 957 DAG size of output: 219 [2021-11-02 23:09:33,842 WARN L207 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 951 DAG size of output: 219 [2021-11-02 23:10:12,970 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-11-02 23:10:12,970 INFO L857 garLoopResultBuilder]: For program point L498(lines 497 525) no Hoare annotation was computed. [2021-11-02 23:10:12,970 INFO L857 garLoopResultBuilder]: For program point L366(lines 136 482) no Hoare annotation was computed. [2021-11-02 23:10:12,971 INFO L857 garLoopResultBuilder]: For program point L1225(lines 1225 1229) no Hoare annotation was computed. [2021-11-02 23:10:12,971 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2021-11-02 23:10:12,971 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 437) no Hoare annotation was computed. [2021-11-02 23:10:12,971 INFO L857 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2021-11-02 23:10:12,972 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-11-02 23:10:12,972 INFO L857 garLoopResultBuilder]: For program point L566(lines 566 619) no Hoare annotation was computed. [2021-11-02 23:10:12,972 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 132) no Hoare annotation was computed. [2021-11-02 23:10:12,972 INFO L857 garLoopResultBuilder]: For program point L831(lines 831 837) no Hoare annotation was computed. [2021-11-02 23:10:12,976 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-11-02 23:10:12,977 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-11-02 23:10:12,977 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-11-02 23:10:12,978 INFO L857 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-11-02 23:10:12,978 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-11-02 23:10:12,979 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-11-02 23:10:12,979 INFO L857 garLoopResultBuilder]: For program point L1097(lines 1089 1106) no Hoare annotation was computed. [2021-11-02 23:10:12,979 INFO L857 garLoopResultBuilder]: For program point L767(lines 767 771) no Hoare annotation was computed. [2021-11-02 23:10:12,979 INFO L857 garLoopResultBuilder]: For program point L701(lines 701 705) no Hoare annotation was computed. [2021-11-02 23:10:12,979 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-11-02 23:10:12,980 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-11-02 23:10:12,980 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 131) no Hoare annotation was computed. [2021-11-02 23:10:12,980 INFO L857 garLoopResultBuilder]: For program point L1098(lines 1098 1102) no Hoare annotation was computed. [2021-11-02 23:10:12,980 INFO L853 garLoopResultBuilder]: At program point L108(lines 103 845) the Hoare annotation is: false [2021-11-02 23:10:12,980 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-11-02 23:10:12,981 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1302) no Hoare annotation was computed. [2021-11-02 23:10:12,981 INFO L857 garLoopResultBuilder]: For program point L241(lines 241 245) no Hoare annotation was computed. [2021-11-02 23:10:12,981 INFO L857 garLoopResultBuilder]: For program point L968(lines 968 972) no Hoare annotation was computed. [2021-11-02 23:10:12,981 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-11-02 23:10:12,981 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 130) no Hoare annotation was computed. [2021-11-02 23:10:12,982 INFO L857 garLoopResultBuilder]: For program point L1035(lines 1035 1088) no Hoare annotation was computed. [2021-11-02 23:10:12,982 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-11-02 23:10:12,982 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-11-02 23:10:12,982 INFO L853 garLoopResultBuilder]: At program point L111(lines 103 845) the Hoare annotation is: false [2021-11-02 23:10:12,982 INFO L857 garLoopResultBuilder]: For program point L1036(lines 1036 1040) no Hoare annotation was computed. [2021-11-02 23:10:12,983 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-11-02 23:10:12,983 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-11-02 23:10:12,984 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-11-02 23:10:12,984 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-11-02 23:10:12,984 INFO L857 garLoopResultBuilder]: For program point L641(lines 640 668) no Hoare annotation was computed. [2021-11-02 23:10:12,984 INFO L857 garLoopResultBuilder]: For program point L575(lines 575 579) no Hoare annotation was computed. [2021-11-02 23:10:12,984 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 129) no Hoare annotation was computed. [2021-11-02 23:10:12,985 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-11-02 23:10:12,985 INFO L857 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2021-11-02 23:10:12,985 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-11-02 23:10:12,986 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-11-02 23:10:12,986 INFO L857 garLoopResultBuilder]: For program point L775(lines 775 779) no Hoare annotation was computed. [2021-11-02 23:10:12,986 INFO L857 garLoopResultBuilder]: For program point L709(lines 709 713) no Hoare annotation was computed. [2021-11-02 23:10:12,986 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-11-02 23:10:12,987 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-11-02 23:10:12,987 INFO L857 garLoopResultBuilder]: For program point L181(lines 180 208) no Hoare annotation was computed. [2021-11-02 23:10:12,987 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-11-02 23:10:12,987 INFO L857 garLoopResultBuilder]: For program point L1305(lines 1257 1346) no Hoare annotation was computed. [2021-11-02 23:10:12,988 INFO L857 garLoopResultBuilder]: For program point L1239(lines 1239 1243) no Hoare annotation was computed. [2021-11-02 23:10:12,988 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 186) no Hoare annotation was computed. [2021-11-02 23:10:12,988 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 128) no Hoare annotation was computed. [2021-11-02 23:10:12,988 INFO L857 garLoopResultBuilder]: For program point L975(lines 967 984) no Hoare annotation was computed. [2021-11-02 23:10:12,988 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-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L381(lines 381 385) no Hoare annotation was computed. [2021-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L1306(lines 1306 1310) no Hoare annotation was computed. [2021-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L249(lines 249 253) no Hoare annotation was computed. [2021-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L1174(lines 1174 1178) no Hoare annotation was computed. [2021-11-02 23:10:12,989 INFO L853 garLoopResultBuilder]: At program point L117(lines 103 845) the Hoare annotation is: false [2021-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L1174-2(lines 1172 1351) no Hoare annotation was computed. [2021-11-02 23:10:12,989 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-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L976(lines 976 980) no Hoare annotation was computed. [2021-11-02 23:10:12,989 INFO L857 garLoopResultBuilder]: For program point L448(lines 136 482) no Hoare annotation was computed. [2021-11-02 23:10:12,990 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-11-02 23:10:12,990 INFO L857 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-11-02 23:10:12,990 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 127) no Hoare annotation was computed. [2021-11-02 23:10:12,990 INFO L857 garLoopResultBuilder]: For program point L1044(lines 1044 1048) no Hoare annotation was computed. [2021-11-02 23:10:12,990 INFO L853 garLoopResultBuilder]: At program point L120(lines 103 845) the Hoare annotation is: false [2021-11-02 23:10:12,990 INFO L857 garLoopResultBuilder]: For program point L913(lines 913 966) no Hoare annotation was computed. [2021-11-02 23:10:12,991 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-11-02 23:10:12,991 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-11-02 23:10:12,991 INFO L857 garLoopResultBuilder]: For program point L583(lines 583 587) no Hoare annotation was computed. [2021-11-02 23:10:12,991 INFO L860 garLoopResultBuilder]: At program point L1376(lines 1353 1378) the Hoare annotation is: true [2021-11-02 23:10:12,992 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-11-02 23:10:12,992 INFO L857 garLoopResultBuilder]: For program point L914(lines 914 918) no Hoare annotation was computed. [2021-11-02 23:10:12,992 INFO L857 garLoopResultBuilder]: For program point L716(lines 487 839) no Hoare annotation was computed. [2021-11-02 23:10:12,992 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-11-02 23:10:12,992 INFO L857 garLoopResultBuilder]: For program point L1179-1(lines 1172 1351) no Hoare annotation was computed. [2021-11-02 23:10:12,992 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 126) no Hoare annotation was computed. [2021-11-02 23:10:12,993 INFO L857 garLoopResultBuilder]: For program point L783(lines 783 787) no Hoare annotation was computed. [2021-11-02 23:10:12,993 INFO L857 garLoopResultBuilder]: For program point L717(lines 717 721) no Hoare annotation was computed. [2021-11-02 23:10:12,993 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-11-02 23:10:12,993 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-11-02 23:10:12,994 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-11-02 23:10:12,994 INFO L857 garLoopResultBuilder]: For program point L388(lines 380 397) no Hoare annotation was computed. [2021-11-02 23:10:12,994 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 23:10:12,994 INFO L857 garLoopResultBuilder]: For program point L256(lines 136 482) no Hoare annotation was computed. [2021-11-02 23:10:12,994 INFO L857 garLoopResultBuilder]: For program point L1247(lines 1247 1251) no Hoare annotation was computed. [2021-11-02 23:10:12,995 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 393) no Hoare annotation was computed. [2021-11-02 23:10:12,995 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 261) no Hoare annotation was computed. [2021-11-02 23:10:12,995 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-11-02 23:10:12,995 INFO L857 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2021-11-02 23:10:12,996 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-11-02 23:10:12,996 INFO L857 garLoopResultBuilder]: For program point L1052(lines 1052 1056) no Hoare annotation was computed. [2021-11-02 23:10:12,996 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-11-02 23:10:12,996 INFO L857 garLoopResultBuilder]: For program point L326(lines 326 379) no Hoare annotation was computed. [2021-11-02 23:10:12,997 INFO L857 garLoopResultBuilder]: For program point L1185(lines 1185 1189) no Hoare annotation was computed. [2021-11-02 23:10:12,997 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2021-11-02 23:10:12,997 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 1001) no Hoare annotation was computed. [2021-11-02 23:10:12,997 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-11-02 23:10:12,997 INFO L857 garLoopResultBuilder]: For program point L591(lines 591 595) no Hoare annotation was computed. [2021-11-02 23:10:12,998 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-11-02 23:10:12,998 INFO L857 garLoopResultBuilder]: For program point L922(lines 922 926) no Hoare annotation was computed. [2021-11-02 23:10:12,998 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-11-02 23:10:12,998 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 67) no Hoare annotation was computed. [2021-11-02 23:10:12,998 INFO L857 garLoopResultBuilder]: For program point L791(lines 791 795) no Hoare annotation was computed. [2021-11-02 23:10:12,998 INFO L857 garLoopResultBuilder]: For program point L1320(lines 1320 1324) no Hoare annotation was computed. [2021-11-02 23:10:12,999 INFO L857 garLoopResultBuilder]: For program point L1122(lines 1121 1162) no Hoare annotation was computed. [2021-11-02 23:10:12,999 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 23:10:12,999 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-11-02 23:10:12,999 INFO L857 garLoopResultBuilder]: For program point L463(lines 463 467) no Hoare annotation was computed. [2021-11-02 23:10:12,999 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-11-02 23:10:13,000 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-11-02 23:10:13,000 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-11-02 23:10:13,000 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-11-02 23:10:13,000 INFO L857 garLoopResultBuilder]: For program point L993(lines 993 1000) no Hoare annotation was computed. [2021-11-02 23:10:13,001 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-11-02 23:10:13,001 INFO L857 garLoopResultBuilder]: For program point L531(lines 530 558) no Hoare annotation was computed. [2021-11-02 23:10:13,001 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2021-11-02 23:10:13,001 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-11-02 23:10:13,002 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-11-02 23:10:13,002 INFO L857 garLoopResultBuilder]: For program point L1258(line 1258) no Hoare annotation was computed. [2021-11-02 23:10:13,002 INFO L857 garLoopResultBuilder]: For program point L1126(lines 1126 1130) no Hoare annotation was computed. [2021-11-02 23:10:13,002 INFO L857 garLoopResultBuilder]: For program point L1126-1(lines 1121 1162) no Hoare annotation was computed. [2021-11-02 23:10:13,002 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-11-02 23:10:13,002 INFO L857 garLoopResultBuilder]: For program point L1060(lines 1060 1064) no Hoare annotation was computed. [2021-11-02 23:10:13,003 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-11-02 23:10:13,003 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 536) no Hoare annotation was computed. [2021-11-02 23:10:13,003 INFO L857 garLoopResultBuilder]: For program point L1193(lines 1193 1197) no Hoare annotation was computed. [2021-11-02 23:10:13,004 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-11-02 23:10:13,004 INFO L857 garLoopResultBuilder]: For program point L863(lines 863 875) no Hoare annotation was computed. [2021-11-02 23:10:13,004 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-11-02 23:10:13,004 INFO L857 garLoopResultBuilder]: For program point L731(lines 731 735) no Hoare annotation was computed. [2021-11-02 23:10:13,004 INFO L857 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-11-02 23:10:13,005 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2021-11-02 23:10:13,005 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-11-02 23:10:13,005 INFO L857 garLoopResultBuilder]: For program point L137(lines 136 482) no Hoare annotation was computed. [2021-11-02 23:10:13,005 INFO L857 garLoopResultBuilder]: For program point L930(lines 930 934) no Hoare annotation was computed. [2021-11-02 23:10:13,005 INFO L857 garLoopResultBuilder]: For program point L798(lines 487 839) no Hoare annotation was computed. [2021-11-02 23:10:13,005 INFO L857 garLoopResultBuilder]: For program point L1327(lines 1257 1346) no Hoare annotation was computed. [2021-11-02 23:10:13,006 INFO L857 garLoopResultBuilder]: For program point L138(lines 138 142) no Hoare annotation was computed. [2021-11-02 23:10:13,006 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 803) no Hoare annotation was computed. [2021-11-02 23:10:13,006 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-11-02 23:10:13,006 INFO L857 garLoopResultBuilder]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2021-11-02 23:10:13,006 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 275) no Hoare annotation was computed. [2021-11-02 23:10:13,006 INFO L857 garLoopResultBuilder]: For program point L866(lines 866 874) no Hoare annotation was computed. [2021-11-02 23:10:13,007 INFO L857 garLoopResultBuilder]: For program point L470(lines 462 479) no Hoare annotation was computed. [2021-11-02 23:10:13,007 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 81) no Hoare annotation was computed. [2021-11-02 23:10:13,007 INFO L853 garLoopResultBuilder]: At program point L867(lines 862 1113) the Hoare annotation is: false [2021-11-02 23:10:13,007 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-11-02 23:10:13,007 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 475) no Hoare annotation was computed. [2021-11-02 23:10:13,008 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-11-02 23:10:13,008 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-11-02 23:10:13,009 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,009 INFO L857 garLoopResultBuilder]: For program point L1265(lines 1265 1318) no Hoare annotation was computed. [2021-11-02 23:10:13,009 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-11-02 23:10:13,009 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 81) no Hoare annotation was computed. [2021-11-02 23:10:13,009 INFO L857 garLoopResultBuilder]: For program point L869(lines 869 873) no Hoare annotation was computed. [2021-11-02 23:10:13,010 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-11-02 23:10:13,010 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-11-02 23:10:13,010 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-11-02 23:10:13,010 INFO L857 garLoopResultBuilder]: For program point L1266(lines 1266 1270) no Hoare annotation was computed. [2021-11-02 23:10:13,010 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-11-02 23:10:13,011 INFO L857 garLoopResultBuilder]: For program point L1068(lines 1068 1072) no Hoare annotation was computed. [2021-11-02 23:10:13,011 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-11-02 23:10:13,011 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-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point L738(lines 730 747) no Hoare annotation was computed. [2021-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point L606(lines 487 839) no Hoare annotation was computed. [2021-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point L408(lines 408 461) no Hoare annotation was computed. [2021-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point L1201(lines 1201 1205) no Hoare annotation was computed. [2021-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 81) no Hoare annotation was computed. [2021-11-02 23:10:13,012 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L1003-1(lines 878 1108) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L739(lines 739 743) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L607(lines 607 611) no Hoare annotation was computed. [2021-11-02 23:10:13,013 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-11-02 23:10:13,014 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-11-02 23:10:13,014 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-11-02 23:10:13,014 INFO L857 garLoopResultBuilder]: For program point L1136(lines 1136 1143) no Hoare annotation was computed. [2021-11-02 23:10:13,014 INFO L857 garLoopResultBuilder]: For program point L1004(lines 1003 1027) no Hoare annotation was computed. [2021-11-02 23:10:13,014 INFO L857 garLoopResultBuilder]: For program point L938(lines 938 942) no Hoare annotation was computed. [2021-11-02 23:10:13,015 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-11-02 23:10:13,015 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-11-02 23:10:13,015 INFO L857 garLoopResultBuilder]: For program point L278(lines 270 287) no Hoare annotation was computed. [2021-11-02 23:10:13,015 INFO L857 garLoopResultBuilder]: For program point L1005(lines 1005 1009) no Hoare annotation was computed. [2021-11-02 23:10:13,015 INFO L857 garLoopResultBuilder]: For program point L279(lines 279 283) no Hoare annotation was computed. [2021-11-02 23:10:13,016 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-11-02 23:10:13,016 INFO L857 garLoopResultBuilder]: For program point L676(lines 676 729) no Hoare annotation was computed. [2021-11-02 23:10:13,016 INFO L857 garLoopResultBuilder]: For program point L148(lines 147 175) no Hoare annotation was computed. [2021-11-02 23:10:13,016 INFO L857 garLoopResultBuilder]: For program point L677(lines 677 681) no Hoare annotation was computed. [2021-11-02 23:10:13,016 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-11-02 23:10:13,016 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 153) no Hoare annotation was computed. [2021-11-02 23:10:13,017 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-11-02 23:10:13,017 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 269) no Hoare annotation was computed. [2021-11-02 23:10:13,017 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-11-02 23:10:13,017 INFO L857 garLoopResultBuilder]: For program point L1075(lines 878 1108) no Hoare annotation was computed. [2021-11-02 23:10:13,018 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-11-02 23:10:13,018 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-11-02 23:10:13,018 INFO L857 garLoopResultBuilder]: For program point L1340(lines 1340 1344) no Hoare annotation was computed. [2021-11-02 23:10:13,018 INFO L857 garLoopResultBuilder]: For program point L1340-1(lines 1172 1351) no Hoare annotation was computed. [2021-11-02 23:10:13,018 INFO L857 garLoopResultBuilder]: For program point L1274(lines 1274 1278) no Hoare annotation was computed. [2021-11-02 23:10:13,018 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 221) no Hoare annotation was computed. [2021-11-02 23:10:13,019 INFO L857 garLoopResultBuilder]: For program point L1076(lines 1076 1080) no Hoare annotation was computed. [2021-11-02 23:10:13,019 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-11-02 23:10:13,019 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-11-02 23:10:13,020 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 23:10:13,020 INFO L857 garLoopResultBuilder]: For program point L1209(lines 1209 1213) no Hoare annotation was computed. [2021-11-02 23:10:13,020 INFO L857 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-11-02 23:10:13,020 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-11-02 23:10:13,020 INFO L857 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-11-02 23:10:13,020 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2021-11-02 23:10:13,021 INFO L857 garLoopResultBuilder]: For program point L946(lines 946 950) no Hoare annotation was computed. [2021-11-02 23:10:13,021 INFO L857 garLoopResultBuilder]: For program point L881-1(lines 878 1108) no Hoare annotation was computed. [2021-11-02 23:10:13,021 INFO L857 garLoopResultBuilder]: For program point L749(lines 749 755) no Hoare annotation was computed. [2021-11-02 23:10:13,021 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-11-02 23:10:13,022 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-11-02 23:10:13,022 INFO L857 garLoopResultBuilder]: For program point L882(lines 881 905) no Hoare annotation was computed. [2021-11-02 23:10:13,022 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-11-02 23:10:13,022 INFO L857 garLoopResultBuilder]: For program point L883(lines 883 887) no Hoare annotation was computed. [2021-11-02 23:10:13,023 INFO L857 garLoopResultBuilder]: For program point L685(lines 685 689) no Hoare annotation was computed. [2021-11-02 23:10:13,023 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-11-02 23:10:13,023 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-11-02 23:10:13,024 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-11-02 23:10:13,024 INFO L857 garLoopResultBuilder]: For program point L488(lines 487 839) no Hoare annotation was computed. [2021-11-02 23:10:13,024 INFO L860 garLoopResultBuilder]: At program point L1347(lines 1169 1352) the Hoare annotation is: true [2021-11-02 23:10:13,024 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-11-02 23:10:13,024 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-11-02 23:10:13,025 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-11-02 23:10:13,025 INFO L857 garLoopResultBuilder]: For program point L621(lines 621 625) no Hoare annotation was computed. [2021-11-02 23:10:13,025 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-11-02 23:10:13,025 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-11-02 23:10:13,026 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-11-02 23:10:13,026 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 318) no Hoare annotation was computed. [2021-11-02 23:10:13,026 INFO L857 garLoopResultBuilder]: For program point L1282(lines 1282 1286) no Hoare annotation was computed. [2021-11-02 23:10:13,026 INFO L857 garLoopResultBuilder]: For program point L225(lines 225 229) no Hoare annotation was computed. [2021-11-02 23:10:13,026 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-11-02 23:10:13,027 INFO L857 garLoopResultBuilder]: For program point L820(lines 812 829) no Hoare annotation was computed. [2021-11-02 23:10:13,027 INFO L857 garLoopResultBuilder]: For program point L292(lines 292 296) no Hoare annotation was computed. [2021-11-02 23:10:13,027 INFO L857 garLoopResultBuilder]: For program point L1217(lines 1217 1221) no Hoare annotation was computed. [2021-11-02 23:10:13,027 INFO L857 garLoopResultBuilder]: For program point L1151(lines 1151 1158) no Hoare annotation was computed. [2021-11-02 23:10:13,027 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 23:10:13,027 INFO L857 garLoopResultBuilder]: For program point L953(lines 878 1108) no Hoare annotation was computed. [2021-11-02 23:10:13,028 INFO L857 garLoopResultBuilder]: For program point L821(lines 821 825) no Hoare annotation was computed. [2021-11-02 23:10:13,028 INFO L857 garLoopResultBuilder]: For program point L425(lines 425 429) no Hoare annotation was computed. [2021-11-02 23:10:13,028 INFO L857 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2021-11-02 23:10:13,028 INFO L857 garLoopResultBuilder]: For program point L954(lines 954 958) no Hoare annotation was computed. [2021-11-02 23:10:13,028 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-11-02 23:10:13,029 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-11-02 23:10:13,029 INFO L857 garLoopResultBuilder]: For program point L758(lines 758 811) no Hoare annotation was computed. [2021-11-02 23:10:13,029 INFO L857 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-11-02 23:10:13,029 INFO L857 garLoopResultBuilder]: For program point L693(lines 693 697) no Hoare annotation was computed. [2021-11-02 23:10:13,029 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-11-02 23:10:13,030 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-11-02 23:10:13,030 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-11-02 23:10:13,030 INFO L857 garLoopResultBuilder]: For program point L1090(lines 1090 1094) no Hoare annotation was computed. [2021-11-02 23:10:13,030 INFO L857 garLoopResultBuilder]: For program point L628(lines 620 637) no Hoare annotation was computed. [2021-11-02 23:10:13,030 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-11-02 23:10:13,031 INFO L857 garLoopResultBuilder]: For program point L629(lines 629 633) no Hoare annotation was computed. [2021-11-02 23:10:13,031 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-11-02 23:10:13,031 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-11-02 23:10:13,031 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-11-02 23:10:13,032 INFO L857 garLoopResultBuilder]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2021-11-02 23:10:13,032 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 237) no Hoare annotation was computed. [2021-11-02 23:10:13,032 INFO L857 garLoopResultBuilder]: For program point L1224(lines 1172 1351) no Hoare annotation was computed. [2021-11-02 23:10:13,035 INFO L731 BasicCegarLoop]: Path program 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] [2021-11-02 23:10:13,037 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 23:10:13,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:10:13 BoogieIcfgContainer [2021-11-02 23:10:13,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 23:10:13,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 23:10:13,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 23:10:13,389 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 23:10:13,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:07:12" (3/4) ... [2021-11-02 23:10:13,393 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 23:10:13,429 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-02 23:10:13,431 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-02 23:10:13,433 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 23:10:13,434 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 23:10:13,474 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-11-02 23:10:13,475 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-11-02 23:10:13,477 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-11-02 23:10:13,479 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-11-02 23:10:13,483 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-11-02 23:10:13,487 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-11-02 23:10:13,487 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-11-02 23:10:13,487 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-11-02 23:10:13,488 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-11-02 23:10:13,488 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-11-02 23:10:13,491 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-11-02 23:10:13,491 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-11-02 23:10:13,491 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-11-02 23:10:13,492 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-11-02 23:10:13,492 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-11-02 23:10:13,492 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-11-02 23:10:13,493 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-11-02 23:10:13,493 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-11-02 23:10:13,493 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-11-02 23:10:13,493 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-11-02 23:10:13,494 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-11-02 23:10:13,494 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-11-02 23:10:13,494 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-11-02 23:10:13,495 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-11-02 23:10:13,495 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-11-02 23:10:13,495 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-11-02 23:10:13,496 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-11-02 23:10:13,496 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-11-02 23:10:13,496 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-11-02 23:10:13,496 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-11-02 23:10:13,496 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-11-02 23:10:13,497 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-11-02 23:10:13,497 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-11-02 23:10:13,497 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-11-02 23:10:13,498 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-11-02 23:10:13,498 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-11-02 23:10:13,498 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-11-02 23:10:13,498 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-11-02 23:10:13,653 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 23:10:13,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 23:10:13,654 INFO L168 Benchmark]: Toolchain (without parser) took 182474.74 ms. Allocated memory was 104.9 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 65.4 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 247.6 MB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,655 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 104.9 MB. Free memory is still 82.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 23:10:13,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.21 ms. Allocated memory is still 104.9 MB. Free memory was 65.3 MB in the beginning and 71.9 MB in the end (delta: -6.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.25 ms. Allocated memory is still 104.9 MB. Free memory was 71.9 MB in the beginning and 68.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,656 INFO L168 Benchmark]: Boogie Preprocessor took 94.14 ms. Allocated memory is still 104.9 MB. Free memory was 68.6 MB in the beginning and 65.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,657 INFO L168 Benchmark]: RCFGBuilder took 950.17 ms. Allocated memory is still 104.9 MB. Free memory was 65.2 MB in the beginning and 69.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,657 INFO L168 Benchmark]: TraceAbstraction took 180548.38 ms. Allocated memory was 104.9 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 68.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,658 INFO L168 Benchmark]: Witness Printer took 263.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:10:13,669 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.19 ms. Allocated memory is still 104.9 MB. Free memory is still 82.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 507.21 ms. Allocated memory is still 104.9 MB. Free memory was 65.3 MB in the beginning and 71.9 MB in the end (delta: -6.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.25 ms. Allocated memory is still 104.9 MB. Free memory was 71.9 MB in the beginning and 68.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.14 ms. Allocated memory is still 104.9 MB. Free memory was 68.6 MB in the beginning and 65.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 950.17 ms. Allocated memory is still 104.9 MB. Free memory was 65.2 MB in the beginning and 69.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 180548.38 ms. Allocated memory was 104.9 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 68.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 263.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 31.2 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 180.1s, OverallIterations: 31, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 112.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 18630 SDtfs, 44467 SDslu, 82806 SDs, 0 SdLazy, 8743 SolverSat, 1258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5049 GetRequests, 4483 SyntacticMatches, 10 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11037 ImplicationChecksByTransitivity, 7.6s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 68093 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 639 NumberOfFragments, 34962 HoareAnnotationTreeSize, 98 FomulaSimplifications, 71298443109 FormulaSimplificationTreeSizeReduction, 27.4s HoareSimplificationTime, 98 FomulaSimplificationsInter, 6167063920 FormulaSimplificationTreeSizeReductionInter, 85.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 21.3s 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-11-02 23:10:14,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5ea031-c233-4c63-b6bf-74defebf784b/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE