./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5175cce01b12a2d959ac6d92bcc0adb5892ab17f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:15:37,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:15:37,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:15:37,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:15:37,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:15:37,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:15:37,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:15:37,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:15:37,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:15:37,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:15:37,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:15:37,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:15:37,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:15:37,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:15:37,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:15:37,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:15:37,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:15:37,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:15:37,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:15:37,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:15:37,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:15:37,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:15:37,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:15:37,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:15:37,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:15:37,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:15:37,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:15:37,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:15:37,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:15:37,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:15:37,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:15:37,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:15:37,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:15:37,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:15:37,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:15:37,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:15:37,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:15:37,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:15:37,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:15:37,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:15:37,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:15:37,701 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:15:37,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:15:37,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:15:37,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:15:37,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:15:37,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:15:37,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:15:37,782 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:15:37,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:15:37,784 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:15:37,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:15:37,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:15:37,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:15:37,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:15:37,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:15:37,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:15:37,787 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:15:37,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:15:37,788 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:15:37,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:15:37,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:15:37,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:15:37,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:15:37,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:15:37,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:15:37,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:15:37,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:15:37,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:15:37,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:15:37,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:15:37,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:15:37,794 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_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5175cce01b12a2d959ac6d92bcc0adb5892ab17f [2021-10-13 01:15:38,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:15:38,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:15:38,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:15:38,148 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:15:38,148 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:15:38,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2021-10-13 01:15:38,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/data/2f985a6b0/69f7bef7adbf495680ed1be500ac921e/FLAGb8570be85 [2021-10-13 01:15:38,891 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:15:38,892 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2021-10-13 01:15:38,911 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/data/2f985a6b0/69f7bef7adbf495680ed1be500ac921e/FLAGb8570be85 [2021-10-13 01:15:39,174 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/data/2f985a6b0/69f7bef7adbf495680ed1be500ac921e [2021-10-13 01:15:39,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:15:39,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:15:39,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:15:39,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:15:39,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:15:39,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26106e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39, skipping insertion in model container [2021-10-13 01:15:39,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:15:39,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:15:39,520 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_e6e352d2-081c-4e65-9764-2891581c9790/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[341,354] [2021-10-13 01:15:39,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:15:39,685 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:15:39,709 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_e6e352d2-081c-4e65-9764-2891581c9790/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[341,354] [2021-10-13 01:15:39,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:15:39,849 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:15:39,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39 WrapperNode [2021-10-13 01:15:39,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:15:39,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:15:39,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:15:39,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:15:39,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:15:39,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:15:39,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:15:39,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:15:39,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:39,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:40,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:40,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:40,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:15:40,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:15:40,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:15:40,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:15:40,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (1/1) ... [2021-10-13 01:15:40,049 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:15:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:15:40,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:15:40,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:15:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:15:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:15:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:15:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:15:41,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:15:41,294 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-10-13 01:15:41,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:15:41 BoogieIcfgContainer [2021-10-13 01:15:41,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:15:41,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:15:41,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:15:41,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:15:41,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:15:39" (1/3) ... [2021-10-13 01:15:41,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e763c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:15:41, skipping insertion in model container [2021-10-13 01:15:41,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:39" (2/3) ... [2021-10-13 01:15:41,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e763c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:15:41, skipping insertion in model container [2021-10-13 01:15:41,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:15:41" (3/3) ... [2021-10-13 01:15:41,326 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2021-10-13 01:15:41,333 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:15:41,333 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-10-13 01:15:41,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:15:41,409 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:15:41,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 01:15:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 264 states have (on average 1.8636363636363635) internal successors, (492), 269 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 01:15:41,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:41,455 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:41,456 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 991682984, now seen corresponding path program 1 times [2021-10-13 01:15:41,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:41,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67435155] [2021-10-13 01:15:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:41,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:41,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:41,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67435155] [2021-10-13 01:15:41,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67435155] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:41,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:41,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:41,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425252655] [2021-10-13 01:15:41,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:41,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:41,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:41,844 INFO L87 Difference]: Start difference. First operand has 270 states, 264 states have (on average 1.8636363636363635) internal successors, (492), 269 states have internal predecessors, (492), 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.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:42,405 INFO L93 Difference]: Finished difference Result 713 states and 1292 transitions. [2021-10-13 01:15:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-10-13 01:15:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:42,441 INFO L225 Difference]: With dead ends: 713 [2021-10-13 01:15:42,442 INFO L226 Difference]: Without dead ends: 440 [2021-10-13 01:15:42,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-10-13 01:15:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2021-10-13 01:15:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.5894988066825775) internal successors, (666), 423 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 666 transitions. [2021-10-13 01:15:42,536 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 666 transitions. Word has length 27 [2021-10-13 01:15:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:42,537 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 666 transitions. [2021-10-13 01:15:42,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 666 transitions. [2021-10-13 01:15:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 01:15:42,541 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:42,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:42,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:15:42,542 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2034129844, now seen corresponding path program 1 times [2021-10-13 01:15:42,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:42,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677875292] [2021-10-13 01:15:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:42,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:42,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:42,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677875292] [2021-10-13 01:15:42,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677875292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:42,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:42,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:42,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353987746] [2021-10-13 01:15:42,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:42,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:42,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:42,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:42,622 INFO L87 Difference]: Start difference. First operand 424 states and 666 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:42,872 INFO L93 Difference]: Finished difference Result 1111 states and 1767 transitions. [2021-10-13 01:15:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-10-13 01:15:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:42,881 INFO L225 Difference]: With dead ends: 1111 [2021-10-13 01:15:42,881 INFO L226 Difference]: Without dead ends: 701 [2021-10-13 01:15:42,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-10-13 01:15:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 685. [2021-10-13 01:15:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 680 states have (on average 1.625) internal successors, (1105), 684 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1105 transitions. [2021-10-13 01:15:42,990 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1105 transitions. Word has length 36 [2021-10-13 01:15:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:42,991 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 1105 transitions. [2021-10-13 01:15:42,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1105 transitions. [2021-10-13 01:15:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 01:15:42,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:42,996 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:42,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:15:42,997 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -838577631, now seen corresponding path program 1 times [2021-10-13 01:15:43,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:43,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261681878] [2021-10-13 01:15:43,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:43,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:43,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:43,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261681878] [2021-10-13 01:15:43,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261681878] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:43,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:43,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:43,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795617993] [2021-10-13 01:15:43,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:43,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:43,113 INFO L87 Difference]: Start difference. First operand 685 states and 1105 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:43,222 INFO L93 Difference]: Finished difference Result 1731 states and 2796 transitions. [2021-10-13 01:15:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2021-10-13 01:15:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:43,232 INFO L225 Difference]: With dead ends: 1731 [2021-10-13 01:15:43,233 INFO L226 Difference]: Without dead ends: 1071 [2021-10-13 01:15:43,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-10-13 01:15:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1059. [2021-10-13 01:15:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1054 states have (on average 1.6204933586337762) internal successors, (1708), 1058 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1708 transitions. [2021-10-13 01:15:43,353 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1708 transitions. Word has length 37 [2021-10-13 01:15:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:43,367 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 1708 transitions. [2021-10-13 01:15:43,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1708 transitions. [2021-10-13 01:15:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 01:15:43,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:43,387 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:43,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:15:43,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash -981805896, now seen corresponding path program 1 times [2021-10-13 01:15:43,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:43,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108277933] [2021-10-13 01:15:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:43,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:43,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:43,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108277933] [2021-10-13 01:15:43,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108277933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:43,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:43,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:15:43,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103166324] [2021-10-13 01:15:43,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:15:43,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:15:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:15:43,476 INFO L87 Difference]: Start difference. First operand 1059 states and 1708 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:43,989 INFO L93 Difference]: Finished difference Result 2909 states and 4673 transitions. [2021-10-13 01:15:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:15:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-13 01:15:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:44,010 INFO L225 Difference]: With dead ends: 2909 [2021-10-13 01:15:44,010 INFO L226 Difference]: Without dead ends: 1875 [2021-10-13 01:15:44,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:15:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-10-13 01:15:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1645. [2021-10-13 01:15:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1640 states have (on average 1.5951219512195123) internal successors, (2616), 1644 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2616 transitions. [2021-10-13 01:15:44,130 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2616 transitions. Word has length 46 [2021-10-13 01:15:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:44,132 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2616 transitions. [2021-10-13 01:15:44,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2616 transitions. [2021-10-13 01:15:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 01:15:44,138 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:44,139 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:44,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:15:44,140 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:44,141 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-10-13 01:15:44,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:44,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797302119] [2021-10-13 01:15:44,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:44,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:44,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:44,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797302119] [2021-10-13 01:15:44,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797302119] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:44,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:44,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:15:44,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672427969] [2021-10-13 01:15:44,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:15:44,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:15:44,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:15:44,239 INFO L87 Difference]: Start difference. First operand 1645 states and 2616 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:44,838 INFO L93 Difference]: Finished difference Result 4885 states and 7660 transitions. [2021-10-13 01:15:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:15:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 01:15:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:44,863 INFO L225 Difference]: With dead ends: 4885 [2021-10-13 01:15:44,864 INFO L226 Difference]: Without dead ends: 3259 [2021-10-13 01:15:44,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:15:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2021-10-13 01:15:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2889. [2021-10-13 01:15:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2884 states have (on average 1.5669209431345354) internal successors, (4519), 2888 states have internal predecessors, (4519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4519 transitions. [2021-10-13 01:15:45,087 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4519 transitions. Word has length 52 [2021-10-13 01:15:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:45,088 INFO L470 AbstractCegarLoop]: Abstraction has 2889 states and 4519 transitions. [2021-10-13 01:15:45,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4519 transitions. [2021-10-13 01:15:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 01:15:45,090 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:45,090 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:45,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:15:45,091 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:45,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-10-13 01:15:45,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:45,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842839578] [2021-10-13 01:15:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:45,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:45,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:45,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842839578] [2021-10-13 01:15:45,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842839578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:45,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:45,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:45,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285736334] [2021-10-13 01:15:45,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:45,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:45,155 INFO L87 Difference]: Start difference. First operand 2889 states and 4519 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:45,410 INFO L93 Difference]: Finished difference Result 6783 states and 10562 transitions. [2021-10-13 01:15:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 01:15:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:45,441 INFO L225 Difference]: With dead ends: 6783 [2021-10-13 01:15:45,442 INFO L226 Difference]: Without dead ends: 3917 [2021-10-13 01:15:45,456 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2021-10-13 01:15:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3733. [2021-10-13 01:15:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 3728 states have (on average 1.5442596566523605) internal successors, (5757), 3732 states have internal predecessors, (5757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5757 transitions. [2021-10-13 01:15:45,707 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5757 transitions. Word has length 52 [2021-10-13 01:15:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:45,708 INFO L470 AbstractCegarLoop]: Abstraction has 3733 states and 5757 transitions. [2021-10-13 01:15:45,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5757 transitions. [2021-10-13 01:15:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-13 01:15:45,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:45,713 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:45,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:15:45,714 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -471765361, now seen corresponding path program 1 times [2021-10-13 01:15:45,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:45,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624939730] [2021-10-13 01:15:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:45,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:45,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:45,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624939730] [2021-10-13 01:15:45,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624939730] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:45,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:45,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:45,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302127259] [2021-10-13 01:15:45,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:45,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:45,854 INFO L87 Difference]: Start difference. First operand 3733 states and 5757 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:46,401 INFO L93 Difference]: Finished difference Result 8963 states and 13937 transitions. [2021-10-13 01:15:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2021-10-13 01:15:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:46,471 INFO L225 Difference]: With dead ends: 8963 [2021-10-13 01:15:46,472 INFO L226 Difference]: Without dead ends: 5253 [2021-10-13 01:15:46,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2021-10-13 01:15:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4515. [2021-10-13 01:15:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 4510 states have (on average 1.4851441241685144) internal successors, (6698), 4514 states have internal predecessors, (6698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6698 transitions. [2021-10-13 01:15:46,807 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6698 transitions. Word has length 56 [2021-10-13 01:15:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:46,808 INFO L470 AbstractCegarLoop]: Abstraction has 4515 states and 6698 transitions. [2021-10-13 01:15:46,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6698 transitions. [2021-10-13 01:15:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 01:15:46,812 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:46,812 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:46,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:15:46,812 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1405970949, now seen corresponding path program 1 times [2021-10-13 01:15:46,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:46,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22220721] [2021-10-13 01:15:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:46,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:46,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:46,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22220721] [2021-10-13 01:15:46,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22220721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:46,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:46,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:46,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88601107] [2021-10-13 01:15:46,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:46,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:46,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:46,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:46,903 INFO L87 Difference]: Start difference. First operand 4515 states and 6698 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:47,220 INFO L93 Difference]: Finished difference Result 8873 states and 13173 transitions. [2021-10-13 01:15:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-13 01:15:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:47,255 INFO L225 Difference]: With dead ends: 8873 [2021-10-13 01:15:47,256 INFO L226 Difference]: Without dead ends: 4381 [2021-10-13 01:15:47,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2021-10-13 01:15:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4381. [2021-10-13 01:15:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4376 states have (on average 1.461837294332724) internal successors, (6397), 4380 states have internal predecessors, (6397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6397 transitions. [2021-10-13 01:15:47,580 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6397 transitions. Word has length 58 [2021-10-13 01:15:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:47,581 INFO L470 AbstractCegarLoop]: Abstraction has 4381 states and 6397 transitions. [2021-10-13 01:15:47,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6397 transitions. [2021-10-13 01:15:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-13 01:15:47,585 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:47,585 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:47,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:15:47,586 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1675488665, now seen corresponding path program 1 times [2021-10-13 01:15:47,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:47,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258098601] [2021-10-13 01:15:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:47,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:47,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:47,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258098601] [2021-10-13 01:15:47,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258098601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:47,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:47,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:47,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51699508] [2021-10-13 01:15:47,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:47,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:47,664 INFO L87 Difference]: Start difference. First operand 4381 states and 6397 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:48,009 INFO L93 Difference]: Finished difference Result 9409 states and 13912 transitions. [2021-10-13 01:15:48,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:48,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2021-10-13 01:15:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:48,071 INFO L225 Difference]: With dead ends: 9409 [2021-10-13 01:15:48,071 INFO L226 Difference]: Without dead ends: 5051 [2021-10-13 01:15:48,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2021-10-13 01:15:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3399. [2021-10-13 01:15:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3394 states have (on average 1.4823217442545669) internal successors, (5031), 3398 states have internal predecessors, (5031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 5031 transitions. [2021-10-13 01:15:48,357 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 5031 transitions. Word has length 59 [2021-10-13 01:15:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:48,358 INFO L470 AbstractCegarLoop]: Abstraction has 3399 states and 5031 transitions. [2021-10-13 01:15:48,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 5031 transitions. [2021-10-13 01:15:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 01:15:48,362 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:48,362 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:48,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:15:48,362 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash -920667186, now seen corresponding path program 1 times [2021-10-13 01:15:48,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:48,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744111067] [2021-10-13 01:15:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:48,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:48,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:48,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744111067] [2021-10-13 01:15:48,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744111067] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:48,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:48,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:15:48,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495218152] [2021-10-13 01:15:48,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:15:48,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:15:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:15:48,464 INFO L87 Difference]: Start difference. First operand 3399 states and 5031 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:49,992 INFO L93 Difference]: Finished difference Result 16205 states and 23855 transitions. [2021-10-13 01:15:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 01:15:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 01:15:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:50,035 INFO L225 Difference]: With dead ends: 16205 [2021-10-13 01:15:50,036 INFO L226 Difference]: Without dead ends: 13025 [2021-10-13 01:15:50,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 97.0ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-13 01:15:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13025 states. [2021-10-13 01:15:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13025 to 4265. [2021-10-13 01:15:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4265 states, 4260 states have (on average 1.4762910798122066) internal successors, (6289), 4264 states have internal predecessors, (6289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 6289 transitions. [2021-10-13 01:15:50,497 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 6289 transitions. Word has length 61 [2021-10-13 01:15:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:50,497 INFO L470 AbstractCegarLoop]: Abstraction has 4265 states and 6289 transitions. [2021-10-13 01:15:50,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 6289 transitions. [2021-10-13 01:15:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 01:15:50,501 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:50,502 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:50,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:15:50,502 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1524549323, now seen corresponding path program 1 times [2021-10-13 01:15:50,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:50,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409443810] [2021-10-13 01:15:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:50,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:50,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:50,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409443810] [2021-10-13 01:15:50,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409443810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:50,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:50,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:15:50,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034715144] [2021-10-13 01:15:50,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:15:50,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:15:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:15:50,627 INFO L87 Difference]: Start difference. First operand 4265 states and 6289 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:53,179 INFO L93 Difference]: Finished difference Result 25491 states and 37406 transitions. [2021-10-13 01:15:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-13 01:15:53,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 62 [2021-10-13 01:15:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:53,269 INFO L225 Difference]: With dead ends: 25491 [2021-10-13 01:15:53,269 INFO L226 Difference]: Without dead ends: 25489 [2021-10-13 01:15:53,280 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 243.7ms TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-10-13 01:15:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25489 states. [2021-10-13 01:15:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25489 to 4573. [2021-10-13 01:15:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4568 states have (on average 1.466506129597198) internal successors, (6699), 4572 states have internal predecessors, (6699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6699 transitions. [2021-10-13 01:15:53,930 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6699 transitions. Word has length 62 [2021-10-13 01:15:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:53,931 INFO L470 AbstractCegarLoop]: Abstraction has 4573 states and 6699 transitions. [2021-10-13 01:15:53,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6699 transitions. [2021-10-13 01:15:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-13 01:15:53,935 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:53,935 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:53,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:15:53,936 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1908319894, now seen corresponding path program 1 times [2021-10-13 01:15:53,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:53,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012907317] [2021-10-13 01:15:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:53,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:53,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:53,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012907317] [2021-10-13 01:15:53,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012907317] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:53,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:53,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:53,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311738595] [2021-10-13 01:15:53,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:53,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:53,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:53,972 INFO L87 Difference]: Start difference. First operand 4573 states and 6699 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:54,388 INFO L93 Difference]: Finished difference Result 9620 states and 14052 transitions. [2021-10-13 01:15:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-10-13 01:15:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:54,404 INFO L225 Difference]: With dead ends: 9620 [2021-10-13 01:15:54,404 INFO L226 Difference]: Without dead ends: 5068 [2021-10-13 01:15:54,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2021-10-13 01:15:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4994. [2021-10-13 01:15:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4994 states, 4989 states have (on average 1.4592102625776708) internal successors, (7280), 4993 states have internal predecessors, (7280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 7280 transitions. [2021-10-13 01:15:54,786 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 7280 transitions. Word has length 77 [2021-10-13 01:15:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:54,787 INFO L470 AbstractCegarLoop]: Abstraction has 4994 states and 7280 transitions. [2021-10-13 01:15:54,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 7280 transitions. [2021-10-13 01:15:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 01:15:54,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:54,792 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:54,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:15:54,792 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1154888105, now seen corresponding path program 1 times [2021-10-13 01:15:54,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:54,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410020623] [2021-10-13 01:15:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:54,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:54,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:54,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410020623] [2021-10-13 01:15:54,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410020623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:54,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:54,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:15:54,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573921856] [2021-10-13 01:15:54,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:15:54,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:15:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:15:54,849 INFO L87 Difference]: Start difference. First operand 4994 states and 7280 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:55,786 INFO L93 Difference]: Finished difference Result 13350 states and 19292 transitions. [2021-10-13 01:15:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:15:55,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-13 01:15:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:55,812 INFO L225 Difference]: With dead ends: 13350 [2021-10-13 01:15:55,813 INFO L226 Difference]: Without dead ends: 8256 [2021-10-13 01:15:55,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:15:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2021-10-13 01:15:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 7429. [2021-10-13 01:15:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7424 states have (on average 1.4331896551724137) internal successors, (10640), 7428 states have internal predecessors, (10640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 10640 transitions. [2021-10-13 01:15:56,517 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 10640 transitions. Word has length 88 [2021-10-13 01:15:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:56,518 INFO L470 AbstractCegarLoop]: Abstraction has 7429 states and 10640 transitions. [2021-10-13 01:15:56,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 10640 transitions. [2021-10-13 01:15:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 01:15:56,523 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:56,524 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:56,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:15:56,524 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash -258076045, now seen corresponding path program 1 times [2021-10-13 01:15:56,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:56,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992944332] [2021-10-13 01:15:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:56,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:56,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:56,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992944332] [2021-10-13 01:15:56,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992944332] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:56,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:56,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:56,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078992088] [2021-10-13 01:15:56,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:56,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:56,574 INFO L87 Difference]: Start difference. First operand 7429 states and 10640 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:56,962 INFO L93 Difference]: Finished difference Result 10736 states and 15421 transitions. [2021-10-13 01:15:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-13 01:15:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:56,974 INFO L225 Difference]: With dead ends: 10736 [2021-10-13 01:15:56,975 INFO L226 Difference]: Without dead ends: 3315 [2021-10-13 01:15:56,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2021-10-13 01:15:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3262. [2021-10-13 01:15:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 3257 states have (on average 1.3463309794289222) internal successors, (4385), 3261 states have internal predecessors, (4385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4385 transitions. [2021-10-13 01:15:57,341 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4385 transitions. Word has length 95 [2021-10-13 01:15:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:57,342 INFO L470 AbstractCegarLoop]: Abstraction has 3262 states and 4385 transitions. [2021-10-13 01:15:57,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4385 transitions. [2021-10-13 01:15:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-10-13 01:15:57,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:57,345 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:57,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:15:57,346 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash 635068147, now seen corresponding path program 1 times [2021-10-13 01:15:57,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:57,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60170489] [2021-10-13 01:15:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:57,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:57,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:57,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60170489] [2021-10-13 01:15:57,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60170489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:57,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:57,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:15:57,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350653289] [2021-10-13 01:15:57,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:15:57,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:57,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:15:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:15:57,405 INFO L87 Difference]: Start difference. First operand 3262 states and 4385 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:58,437 INFO L93 Difference]: Finished difference Result 12465 states and 16771 transitions. [2021-10-13 01:15:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:15:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-10-13 01:15:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:58,456 INFO L225 Difference]: With dead ends: 12465 [2021-10-13 01:15:58,456 INFO L226 Difference]: Without dead ends: 9377 [2021-10-13 01:15:58,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 31.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:15:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2021-10-13 01:15:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 3264. [2021-10-13 01:15:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3264 states, 3259 states have (on average 1.3442773857011354) internal successors, (4381), 3263 states have internal predecessors, (4381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4381 transitions. [2021-10-13 01:15:58,844 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4381 transitions. Word has length 98 [2021-10-13 01:15:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:58,844 INFO L470 AbstractCegarLoop]: Abstraction has 3264 states and 4381 transitions. [2021-10-13 01:15:58,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4381 transitions. [2021-10-13 01:15:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:15:58,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:58,848 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:58,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:15:58,848 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:15:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1367461198, now seen corresponding path program 1 times [2021-10-13 01:15:58,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:58,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542051071] [2021-10-13 01:15:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:58,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:58,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:58,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542051071] [2021-10-13 01:15:58,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542051071] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:15:58,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098851004] [2021-10-13 01:15:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:58,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:15:58,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:15:58,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:15:58,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 01:15:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:59,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 01:15:59,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:15:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 01:15:59,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098851004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:59,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:15:59,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-10-13 01:15:59,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285882520] [2021-10-13 01:15:59,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:59,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:59,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:15:59,586 INFO L87 Difference]: Start difference. First operand 3264 states and 4381 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:59,980 INFO L93 Difference]: Finished difference Result 3891 states and 5212 transitions. [2021-10-13 01:15:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:15:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:59,988 INFO L225 Difference]: With dead ends: 3891 [2021-10-13 01:15:59,988 INFO L226 Difference]: Without dead ends: 3887 [2021-10-13 01:15:59,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:15:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2021-10-13 01:16:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3837. [2021-10-13 01:16:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3832 states have (on average 1.3402922755741127) internal successors, (5136), 3836 states have internal predecessors, (5136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5136 transitions. [2021-10-13 01:16:00,322 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5136 transitions. Word has length 100 [2021-10-13 01:16:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:00,323 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 5136 transitions. [2021-10-13 01:16:00,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5136 transitions. [2021-10-13 01:16:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-13 01:16:00,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:16:00,328 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:00,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-13 01:16:00,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-13 01:16:00,554 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:16:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -913357440, now seen corresponding path program 1 times [2021-10-13 01:16:00,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:00,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711014300] [2021-10-13 01:16:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:00,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:00,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:00,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711014300] [2021-10-13 01:16:00,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711014300] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:16:00,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441983807] [2021-10-13 01:16:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:00,625 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:16:00,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:16:00,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:16:00,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 01:16:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:00,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 01:16:00,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:16:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 01:16:01,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441983807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:01,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:16:01,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-10-13 01:16:01,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686587859] [2021-10-13 01:16:01,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:16:01,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:16:01,374 INFO L87 Difference]: Start difference. First operand 3837 states and 5136 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:01,742 INFO L93 Difference]: Finished difference Result 6823 states and 9177 transitions. [2021-10-13 01:16:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 152 [2021-10-13 01:16:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:16:01,748 INFO L225 Difference]: With dead ends: 6823 [2021-10-13 01:16:01,749 INFO L226 Difference]: Without dead ends: 2995 [2021-10-13 01:16:01,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:16:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2021-10-13 01:16:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2774. [2021-10-13 01:16:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2769 states have (on average 1.3174431202600216) internal successors, (3648), 2773 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3648 transitions. [2021-10-13 01:16:02,022 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3648 transitions. Word has length 152 [2021-10-13 01:16:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:02,022 INFO L470 AbstractCegarLoop]: Abstraction has 2774 states and 3648 transitions. [2021-10-13 01:16:02,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3648 transitions. [2021-10-13 01:16:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-10-13 01:16:02,026 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:16:02,026 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:02,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 01:16:02,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 01:16:02,254 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:16:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 124699861, now seen corresponding path program 1 times [2021-10-13 01:16:02,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:02,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889630788] [2021-10-13 01:16:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:02,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 01:16:02,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:02,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889630788] [2021-10-13 01:16:02,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889630788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:02,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:02,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:16:02,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068904874] [2021-10-13 01:16:02,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:16:02,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:16:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:02,311 INFO L87 Difference]: Start difference. First operand 2774 states and 3648 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:02,571 INFO L93 Difference]: Finished difference Result 3357 states and 4372 transitions. [2021-10-13 01:16:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:16:02,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 155 [2021-10-13 01:16:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:16:02,573 INFO L225 Difference]: With dead ends: 3357 [2021-10-13 01:16:02,573 INFO L226 Difference]: Without dead ends: 641 [2021-10-13 01:16:02,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:16:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-10-13 01:16:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 633. [2021-10-13 01:16:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 630 states have (on average 1.0793650793650793) internal successors, (680), 632 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 680 transitions. [2021-10-13 01:16:02,653 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 680 transitions. Word has length 155 [2021-10-13 01:16:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:02,654 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 680 transitions. [2021-10-13 01:16:02,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 680 transitions. [2021-10-13 01:16:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-13 01:16:02,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:16:02,657 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:02,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:16:02,658 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:16:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1963184793, now seen corresponding path program 1 times [2021-10-13 01:16:02,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:02,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109067506] [2021-10-13 01:16:02,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:02,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 01:16:02,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:02,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109067506] [2021-10-13 01:16:02,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109067506] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:16:02,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678942239] [2021-10-13 01:16:02,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:02,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:16:02,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:16:02,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:16:02,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 01:16:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:02,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 01:16:03,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:16:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 01:16:03,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678942239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:03,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:16:03,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-10-13 01:16:03,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042051764] [2021-10-13 01:16:03,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:16:03,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:16:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:16:03,658 INFO L87 Difference]: Start difference. First operand 633 states and 680 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:03,797 INFO L93 Difference]: Finished difference Result 923 states and 990 transitions. [2021-10-13 01:16:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:16:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2021-10-13 01:16:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:16:03,799 INFO L225 Difference]: With dead ends: 923 [2021-10-13 01:16:03,799 INFO L226 Difference]: Without dead ends: 537 [2021-10-13 01:16:03,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:16:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-10-13 01:16:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2021-10-13 01:16:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 534 states have (on average 1.0767790262172285) internal successors, (575), 536 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 575 transitions. [2021-10-13 01:16:03,880 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 575 transitions. Word has length 158 [2021-10-13 01:16:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:03,880 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 575 transitions. [2021-10-13 01:16:03,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2021-10-13 01:16:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-13 01:16:03,883 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:16:03,884 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:03,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 01:16:04,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:16:04,098 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:16:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1495401652, now seen corresponding path program 1 times [2021-10-13 01:16:04,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:04,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395271033] [2021-10-13 01:16:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:04,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 01:16:04,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:04,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395271033] [2021-10-13 01:16:04,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395271033] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:04,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:04,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:16:04,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975204152] [2021-10-13 01:16:04,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:16:04,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:16:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:16:04,187 INFO L87 Difference]: Start difference. First operand 537 states and 575 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:04,451 INFO L93 Difference]: Finished difference Result 1008 states and 1085 transitions. [2021-10-13 01:16:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:16:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-10-13 01:16:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:16:04,454 INFO L225 Difference]: With dead ends: 1008 [2021-10-13 01:16:04,454 INFO L226 Difference]: Without dead ends: 1006 [2021-10-13 01:16:04,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:16:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-13 01:16:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 535. [2021-10-13 01:16:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 533 states have (on average 1.0731707317073171) internal successors, (572), 534 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 572 transitions. [2021-10-13 01:16:04,603 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 572 transitions. Word has length 160 [2021-10-13 01:16:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:04,604 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 572 transitions. [2021-10-13 01:16:04,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 572 transitions. [2021-10-13 01:16:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-13 01:16:04,607 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:16:04,607 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:04,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 01:16:04,608 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:16:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 887650061, now seen corresponding path program 1 times [2021-10-13 01:16:04,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:04,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778588121] [2021-10-13 01:16:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:04,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 01:16:04,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:04,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778588121] [2021-10-13 01:16:04,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778588121] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:16:04,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:16:04,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:16:04,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83869065] [2021-10-13 01:16:04,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:16:04,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:16:04,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:16:04,724 INFO L87 Difference]: Start difference. First operand 535 states and 572 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:04,860 INFO L93 Difference]: Finished difference Result 748 states and 799 transitions. [2021-10-13 01:16:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:16:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 161 [2021-10-13 01:16:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:16:04,862 INFO L225 Difference]: With dead ends: 748 [2021-10-13 01:16:04,862 INFO L226 Difference]: Without dead ends: 644 [2021-10-13 01:16:04,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:16:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-10-13 01:16:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 527. [2021-10-13 01:16:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.0627376425855513) internal successors, (559), 526 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 559 transitions. [2021-10-13 01:16:04,912 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 559 transitions. Word has length 161 [2021-10-13 01:16:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:04,913 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 559 transitions. [2021-10-13 01:16:04,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 559 transitions. [2021-10-13 01:16:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-10-13 01:16:04,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:16:04,918 INFO L512 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:16:04,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 01:16:04,919 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 01:16:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:16:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1388250693, now seen corresponding path program 1 times [2021-10-13 01:16:04,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:16:04,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123697250] [2021-10-13 01:16:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:04,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:16:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:05,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:16:05,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123697250] [2021-10-13 01:16:05,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123697250] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:16:05,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943350598] [2021-10-13 01:16:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:16:05,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:16:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:16:05,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:16:05,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 01:16:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:16:05,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 33 conjunts are in the unsatisfiable core [2021-10-13 01:16:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:16:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:16:08,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943350598] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:16:08,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:16:08,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2021-10-13 01:16:08,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504980543] [2021-10-13 01:16:08,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 01:16:08,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:16:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 01:16:08,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:16:08,071 INFO L87 Difference]: Start difference. First operand 527 states and 559 transitions. Second operand has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:16:09,196 INFO L93 Difference]: Finished difference Result 836 states and 893 transitions. [2021-10-13 01:16:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-13 01:16:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 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 220 [2021-10-13 01:16:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:16:09,198 INFO L225 Difference]: With dead ends: 836 [2021-10-13 01:16:09,198 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 01:16:09,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 979.4ms TimeCoverageRelationStatistics Valid=329, Invalid=1563, Unknown=0, NotChecked=0, Total=1892 [2021-10-13 01:16:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 01:16:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 01:16:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 01:16:09,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2021-10-13 01:16:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:16:09,201 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 01:16:09,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:16:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 01:16:09,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 01:16:09,205 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:16:09,205 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:16:09,206 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:16:09,206 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:16:09,206 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:16:09,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-13 01:16:09,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-13 01:16:09,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 01:16:09,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:09,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:10,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:10,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:11,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:11,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:11,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:11,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:11,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:11,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:14,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:14,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:14,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:14,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:15,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:16,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:17,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:17,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:18,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:19,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:19,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:19,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:19,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:19,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:20,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:20,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:20,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:21,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:22,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:23,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:23,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:23,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:23,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:23,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:16:23,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:17:03,335 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,336 INFO L853 garLoopResultBuilder]: At program point L630-2(lines 630 658) the Hoare annotation is: (let ((.cse5 (= ~req_tt_a~0 0)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse4 (<= 50 ~s_memory0~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse10 (<= 0 ~a_t~0)) (.cse11 (<= ~s_memory0~0 50)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse18 (= ~c_empty_req~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse17 (not (= ~s_run_st~0 0))) (.cse7 (= 2 ~s_run_pc~0)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse17 (= ULTIMATE.start_s_run_~req_type~1 0) .cse5 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse9 .cse10 .cse18 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse12 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse19 .cse14 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse17 .cse7 .cse18 .cse12 .cse13 .cse19) (and .cse1 .cse3 .cse17 .cse7 .cse12 .cse13))) [2021-10-13 01:17:03,336 INFO L853 garLoopResultBuilder]: At program point L763(lines 756 800) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,337 INFO L853 garLoopResultBuilder]: At program point L697(lines 690 716) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,337 INFO L857 garLoopResultBuilder]: For program point L631(lines 630 658) no Hoare annotation was computed. [2021-10-13 01:17:03,337 INFO L857 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2021-10-13 01:17:03,337 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 119) no Hoare annotation was computed. [2021-10-13 01:17:03,338 INFO L853 garLoopResultBuilder]: At program point L896(lines 870 897) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse5 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_d~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse12 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ~a_t~0)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ~req_tt_a~0 0) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (<= ~s_memory0~0 50) .cse8 .cse9 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 01:17:03,338 INFO L857 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2021-10-13 01:17:03,338 INFO L853 garLoopResultBuilder]: At program point L104(lines 93 835) the Hoare annotation is: (let ((.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (<= ~c_req_d~0 50)) (.cse13 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse1 (= ~c_req_a~0 0)) (.cse11 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_run_pc~0 0)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 (<= 50 ~s_memory0~0) .cse11 .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse12 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse13 .cse7 (<= ~s_memory0~0 50) .cse8 .cse10 (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse4 .cse8 .cse9 .cse10 (not (= ~c_req_type~0 0))))) [2021-10-13 01:17:03,339 INFO L853 garLoopResultBuilder]: At program point L170-2(lines 170 198) the Hoare annotation is: (let ((.cse8 (= 2 ~s_run_pc~0)) (.cse19 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.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 (<= .cse19 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse19)) (.cse9 (<= 0 ~a_t~0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (not .cse8)) (.cse17 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse4 (not (= ~s_run_st~0 0))) (.cse18 (= ~s_run_pc~0 0)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ULTIMATE.start_m_run_~req_a~0 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 .cse0 .cse16 .cse1 .cse2 .cse3 .cse17 .cse18 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse4 .cse18 .cse5 .cse10 .cse12 .cse13 .cse14 .cse15)))) [2021-10-13 01:17:03,339 INFO L857 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2021-10-13 01:17:03,339 INFO L857 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2021-10-13 01:17:03,340 INFO L853 garLoopResultBuilder]: At program point L1294(lines 1287 1304) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,340 INFO L853 garLoopResultBuilder]: At program point L237(lines 230 256) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse5 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse7 (<= ~c_req_d~0 .cse16)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse0 (= ~c_req_a~0 0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 (= 2 ~s_run_pc~0) .cse8 .cse9 .cse10 .cse12 (or (and .cse11 .cse13) (and .cse11 (= ~m_run_pc~0 3))) .cse14) (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse15 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 (not (= ~c_req_type~0 0)))))) [2021-10-13 01:17:03,340 INFO L857 garLoopResultBuilder]: For program point L171(lines 170 198) no Hoare annotation was computed. [2021-10-13 01:17:03,341 INFO L853 garLoopResultBuilder]: At program point L964(lines 957 974) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (<= ~s_memory0~0 50) .cse12 .cse13 .cse15 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,341 INFO L857 garLoopResultBuilder]: For program point L1295(lines 1247 1336) no Hoare annotation was computed. [2021-10-13 01:17:03,341 INFO L857 garLoopResultBuilder]: For program point L1229(lines 1229 1233) no Hoare annotation was computed. [2021-10-13 01:17:03,341 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2021-10-13 01:17:03,341 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 118) no Hoare annotation was computed. [2021-10-13 01:17:03,342 INFO L857 garLoopResultBuilder]: For program point L965(lines 957 974) no Hoare annotation was computed. [2021-10-13 01:17:03,342 INFO L853 garLoopResultBuilder]: At program point L437(lines 430 447) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,342 INFO L857 garLoopResultBuilder]: For program point L371(lines 371 375) no Hoare annotation was computed. [2021-10-13 01:17:03,342 INFO L857 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2021-10-13 01:17:03,342 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2021-10-13 01:17:03,343 INFO L857 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2021-10-13 01:17:03,343 INFO L853 garLoopResultBuilder]: At program point L107(lines 93 835) the Hoare annotation is: false [2021-10-13 01:17:03,343 INFO L857 garLoopResultBuilder]: For program point L1164-2(lines 1162 1341) no Hoare annotation was computed. [2021-10-13 01:17:03,343 INFO L853 garLoopResultBuilder]: At program point L1032(lines 1025 1078) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse14 (= 2 ~s_run_pc~0)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v))) (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 (= ULTIMATE.start_s_run_~req_type~1 1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse11 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 01:17:03,344 INFO L857 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2021-10-13 01:17:03,344 INFO L857 garLoopResultBuilder]: For program point L438(lines 126 472) no Hoare annotation was computed. [2021-10-13 01:17:03,344 INFO L853 garLoopResultBuilder]: At program point L571(lines 564 608) the Hoare annotation is: (and (= ~c_req_type~0 0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,353 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2021-10-13 01:17:03,354 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 117) no Hoare annotation was computed. [2021-10-13 01:17:03,354 INFO L857 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2021-10-13 01:17:03,354 INFO L853 garLoopResultBuilder]: At program point L110(lines 93 835) the Hoare annotation is: false [2021-10-13 01:17:03,354 INFO L857 garLoopResultBuilder]: For program point L903(lines 903 956) no Hoare annotation was computed. [2021-10-13 01:17:03,355 INFO L853 garLoopResultBuilder]: At program point L771(lines 764 799) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,355 INFO L853 garLoopResultBuilder]: At program point L705(lines 698 715) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,355 INFO L857 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2021-10-13 01:17:03,356 INFO L860 garLoopResultBuilder]: At program point L1366(lines 1343 1368) the Hoare annotation is: true [2021-10-13 01:17:03,356 INFO L853 garLoopResultBuilder]: At program point L309(lines 279 310) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,356 INFO L857 garLoopResultBuilder]: For program point L904(lines 904 908) no Hoare annotation was computed. [2021-10-13 01:17:03,356 INFO L857 garLoopResultBuilder]: For program point L706(lines 477 829) no Hoare annotation was computed. [2021-10-13 01:17:03,357 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,357 INFO L853 garLoopResultBuilder]: At program point L1235(lines 1228 1245) 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 .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 0 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 01:17:03,357 INFO L857 garLoopResultBuilder]: For program point L1169-1(lines 1162 1341) no Hoare annotation was computed. [2021-10-13 01:17:03,357 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 116) no Hoare annotation was computed. [2021-10-13 01:17:03,357 INFO L857 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2021-10-13 01:17:03,358 INFO L857 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2021-10-13 01:17:03,358 INFO L853 garLoopResultBuilder]: At program point L377(lines 370 387) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,358 INFO L853 garLoopResultBuilder]: At program point L245(lines 238 255) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse5 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse7 (<= ~c_req_d~0 .cse16)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse0 (= ~c_req_a~0 0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 (= 2 ~s_run_pc~0) .cse8 .cse9 .cse10 .cse12 (or (and .cse11 .cse13) (and .cse11 (= ~m_run_pc~0 3))) .cse14) (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse15 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 (not (= ~c_req_type~0 0)))))) [2021-10-13 01:17:03,359 INFO L853 garLoopResultBuilder]: At program point L113(lines 93 835) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (= ~req_tt_a~0 0)) (.cse7 (<= 0 ~a_t~0)) (.cse8 (<= ~s_memory0~0 50)) (.cse12 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse15 (= ~c_empty_req~0 1)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse14 (= ULTIMATE.start_s_run_~req_type~1 0) .cse5 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 .cse15 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse9 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse11 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse13) (and .cse1 .cse14 .cse6 .cse15 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse14 .cse6 .cse9 .cse10 .cse11))) [2021-10-13 01:17:03,359 INFO L857 garLoopResultBuilder]: For program point L378(lines 370 387) no Hoare annotation was computed. [2021-10-13 01:17:03,359 INFO L857 garLoopResultBuilder]: For program point L246(lines 126 472) no Hoare annotation was computed. [2021-10-13 01:17:03,359 INFO L857 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2021-10-13 01:17:03,359 INFO L857 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2021-10-13 01:17:03,360 INFO L857 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2021-10-13 01:17:03,360 INFO L853 garLoopResultBuilder]: At program point L1040(lines 1033 1077) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse14 (= 2 ~s_run_pc~0)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v))) (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 (= ULTIMATE.start_s_run_~req_type~1 1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse11 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 01:17:03,360 INFO L853 garLoopResultBuilder]: At program point L579(lines 572 607) the Hoare annotation is: (and (= ~c_req_type~0 0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,360 INFO L857 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2021-10-13 01:17:03,361 INFO L853 garLoopResultBuilder]: At program point L910(lines 903 956) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (<= ~s_memory0~0 50) .cse12 .cse13 .cse15 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,361 INFO L857 garLoopResultBuilder]: For program point L316(lines 316 369) no Hoare annotation was computed. [2021-10-13 01:17:03,361 INFO L857 garLoopResultBuilder]: For program point L1175(lines 1175 1179) no Hoare annotation was computed. [2021-10-13 01:17:03,361 INFO L857 garLoopResultBuilder]: For program point L977(lines 977 991) no Hoare annotation was computed. [2021-10-13 01:17:03,362 INFO L853 garLoopResultBuilder]: At program point L779(lines 772 798) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,362 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2021-10-13 01:17:03,362 INFO L857 garLoopResultBuilder]: For program point L317(lines 317 321) no Hoare annotation was computed. [2021-10-13 01:17:03,362 INFO L857 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2021-10-13 01:17:03,363 INFO L853 garLoopResultBuilder]: At program point L516(lines 486 517) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (not (= ~c_m_lock~0 1)) (<= ~c_req_d~0 .cse0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~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) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= .cse0 ~c_req_d~0))) [2021-10-13 01:17:03,363 INFO L857 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2021-10-13 01:17:03,363 INFO L857 garLoopResultBuilder]: For program point L1310(lines 1310 1314) no Hoare annotation was computed. [2021-10-13 01:17:03,363 INFO L857 garLoopResultBuilder]: For program point L1112(lines 1111 1152) no Hoare annotation was computed. [2021-10-13 01:17:03,363 INFO L857 garLoopResultBuilder]: For program point L453(lines 453 457) no Hoare annotation was computed. [2021-10-13 01:17:03,364 INFO L853 garLoopResultBuilder]: At program point L123(lines 93 835) the Hoare annotation is: (let ((.cse12 (= 2 ~s_run_pc~0))) (let ((.cse1 (not .cse12)) (.cse4 (= ~s_run_pc~0 0)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~c_req_a~0 0)) (.cse11 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2021-10-13 01:17:03,364 INFO L853 garLoopResultBuilder]: At program point L1048(lines 1041 1076) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse14 (= 2 ~s_run_pc~0)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v))) (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 (= ULTIMATE.start_s_run_~req_type~1 1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse11 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 01:17:03,364 INFO L853 garLoopResultBuilder]: At program point L520-2(lines 520 548) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ~c_req_d~0 .cse0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~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) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= .cse0 ~c_req_d~0))) [2021-10-13 01:17:03,365 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 01:17:03,365 INFO L853 garLoopResultBuilder]: At program point L1181(lines 1174 1227) 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 .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 0 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 01:17:03,365 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 61) no Hoare annotation was computed. [2021-10-13 01:17:03,365 INFO L857 garLoopResultBuilder]: For program point L983(lines 983 990) no Hoare annotation was computed. [2021-10-13 01:17:03,365 INFO L853 garLoopResultBuilder]: At program point L587(lines 580 606) the Hoare annotation is: (and (= ~c_req_type~0 0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,365 INFO L857 garLoopResultBuilder]: For program point L521(lines 520 548) no Hoare annotation was computed. [2021-10-13 01:17:03,365 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 395) no Hoare annotation was computed. [2021-10-13 01:17:03,366 INFO L853 garLoopResultBuilder]: At program point L389-1(lines 389 395) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,366 INFO L853 garLoopResultBuilder]: At program point L323(lines 316 369) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,366 INFO L857 garLoopResultBuilder]: For program point L1248(line 1248) no Hoare annotation was computed. [2021-10-13 01:17:03,366 INFO L857 garLoopResultBuilder]: For program point L1116(lines 1116 1120) no Hoare annotation was computed. [2021-10-13 01:17:03,366 INFO L857 garLoopResultBuilder]: For program point L1116-1(lines 1111 1152) no Hoare annotation was computed. [2021-10-13 01:17:03,366 INFO L857 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2021-10-13 01:17:03,367 INFO L853 garLoopResultBuilder]: At program point L918(lines 911 955) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (<= ~s_memory0~0 50) .cse12 .cse13 .cse15 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,367 INFO L857 garLoopResultBuilder]: For program point L522(lines 522 526) no Hoare annotation was computed. [2021-10-13 01:17:03,367 INFO L857 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2021-10-13 01:17:03,367 INFO L853 garLoopResultBuilder]: At program point L126-2(lines 126 472) the Hoare annotation is: (let ((.cse10 (= ~s_run_pc~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 0 ~a_t~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse12 (= ~m_run_pc~0 0))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ~s_memory0~0) .cse1 (<= 50 ~c_req_d~0) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse4 .cse5 (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) .cse6 .cse7 (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse8 .cse0 .cse9 .cse10 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse10 .cse11 .cse2 .cse5 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12))) [2021-10-13 01:17:03,367 INFO L857 garLoopResultBuilder]: For program point L853(lines 853 865) no Hoare annotation was computed. [2021-10-13 01:17:03,368 INFO L853 garLoopResultBuilder]: At program point L787(lines 780 797) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,368 INFO L857 garLoopResultBuilder]: For program point L721(lines 721 725) no Hoare annotation was computed. [2021-10-13 01:17:03,368 INFO L857 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2021-10-13 01:17:03,368 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2021-10-13 01:17:03,369 INFO L853 garLoopResultBuilder]: At program point L1316(lines 1309 1326) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,369 INFO L857 garLoopResultBuilder]: For program point L127(lines 126 472) no Hoare annotation was computed. [2021-10-13 01:17:03,369 INFO L857 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2021-10-13 01:17:03,369 INFO L857 garLoopResultBuilder]: For program point L788(lines 477 829) no Hoare annotation was computed. [2021-10-13 01:17:03,370 INFO L857 garLoopResultBuilder]: For program point L1317(lines 1247 1336) no Hoare annotation was computed. [2021-10-13 01:17:03,370 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 132) no Hoare annotation was computed. [2021-10-13 01:17:03,370 INFO L857 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2021-10-13 01:17:03,370 INFO L853 garLoopResultBuilder]: At program point L459(lines 452 469) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,370 INFO L857 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2021-10-13 01:17:03,371 INFO L857 garLoopResultBuilder]: For program point L261(lines 261 265) no Hoare annotation was computed. [2021-10-13 01:17:03,371 INFO L853 garLoopResultBuilder]: At program point L63(lines 54 64) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ULTIMATE.start_s_memory_read_~i 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,371 INFO L857 garLoopResultBuilder]: For program point L856(lines 856 864) no Hoare annotation was computed. [2021-10-13 01:17:03,371 INFO L857 garLoopResultBuilder]: For program point L460(lines 452 469) no Hoare annotation was computed. [2021-10-13 01:17:03,371 INFO L853 garLoopResultBuilder]: At program point L857(lines 852 1103) the Hoare annotation is: false [2021-10-13 01:17:03,372 INFO L853 garLoopResultBuilder]: At program point L659(lines 629 660) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,372 INFO L857 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2021-10-13 01:17:03,372 INFO L853 garLoopResultBuilder]: At program point L1122(lines 1111 1152) the Hoare annotation is: (let ((.cse23 (= ~c_req_type~0 0))) (let ((.cse13 (<= 50 ~s_memory0~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse20 (<= ~s_memory0~0 50)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse26 (= ~m_run_pc~0 6)) (.cse4 (= ~s_run_pc~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse5 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_d~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse12 (not .cse23)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse27 (not (= ~c_m_lock~0 1))) (.cse16 (= ~m_run_st~0 0)) (.cse17 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ~a_t~0)) (.cse19 (= ~c_empty_req~0 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse28 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse18 .cse6 .cse19 .cse7 .cse20 .cse8 .cse10 .cse21 .cse11 .cse22) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse23 .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse14 (= ULTIMATE.start_s_run_~req_type~1 0) .cse24 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse16 .cse17 .cse25 .cse6 .cse19 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse20 .cse8 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse26 .cse21 .cse11 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse22) (and .cse17 .cse19 .cse8 .cse9 .cse10) (and .cse23 .cse0 .cse1 .cse4 .cse27 .cse6 .cse19 .cse8 .cse9 .cse28) (and .cse0 .cse14 .cse17 .cse8 .cse9 .cse10) (and .cse23 .cse0 .cse1 .cse2 .cse13 .cse24 .cse15 .cse17 .cse18 .cse25 .cse6 .cse20 .cse8 .cse9 .cse26 .cse21 .cse11 .cse22) (and .cse0 .cse14 .cse17 .cse19 .cse8 .cse9 .cse26) (and .cse0 .cse2 .cse14 .cse17 .cse8 .cse9 .cse26) (and .cse1 .cse14 .cse4 .cse8 .cse9 .cse10 .cse12) (and .cse1 .cse14 .cse4 .cse27 .cse16 .cse19 .cse8 .cse9 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse23 .cse0 .cse1 .cse14 .cse27 .cse16 .cse17 .cse6 .cse19 .cse8 .cse9 .cse28)))) [2021-10-13 01:17:03,373 INFO L853 garLoopResultBuilder]: At program point L1056(lines 1049 1075) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse14 (= 2 ~s_run_pc~0)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v))) (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 (= ULTIMATE.start_s_run_~req_type~1 1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse11 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 01:17:03,373 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 01:17:03,373 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,373 INFO L857 garLoopResultBuilder]: For program point L1255(lines 1255 1308) no Hoare annotation was computed. [2021-10-13 01:17:03,374 INFO L853 garLoopResultBuilder]: At program point L1189(lines 1182 1226) 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 .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 0 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 01:17:03,374 INFO L857 garLoopResultBuilder]: For program point L859(lines 859 863) no Hoare annotation was computed. [2021-10-13 01:17:03,374 INFO L853 garLoopResultBuilder]: At program point L727(lines 720 737) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,374 INFO L853 garLoopResultBuilder]: At program point L595(lines 588 605) the Hoare annotation is: (and (= ~c_req_type~0 0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,375 INFO L853 garLoopResultBuilder]: At program point L331(lines 324 368) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,375 INFO L857 garLoopResultBuilder]: For program point L1256(lines 1256 1260) no Hoare annotation was computed. [2021-10-13 01:17:03,375 INFO L853 garLoopResultBuilder]: At program point L199(lines 169 200) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse4 (= ~s_run_pc~0 0)) (.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)) (.cse14 (not (= ~s_run_st~0 0))) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= .cse15 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse15)) (.cse8 (<= 0 ~a_t~0)) (.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 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse14 .cse4 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 (= 2 ~s_run_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-10-13 01:17:03,375 INFO L857 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2021-10-13 01:17:03,376 INFO L853 garLoopResultBuilder]: At program point L926(lines 919 954) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (<= ~s_memory0~0 50) .cse12 .cse13 .cse15 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,376 INFO L853 garLoopResultBuilder]: At program point L860(lines 852 1103) the Hoare annotation is: (let ((.cse4 (= ~m_run_pc~0 3)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse8 (<= 0 ~a_t~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= ~c_empty_req~0 1) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 (= ~c_req_type~0 1) .cse0 (<= 50 ~c_req_d~0) .cse1 .cse8 (<= ~c_req_d~0 50) .cse2 .cse3 .cse4 .cse9) (and (= ~c_req_type~0 0) .cse5 .cse6 .cse7 (<= 50 ~s_memory0~0) .cse0 (= ~req_tt_a~0 0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (<= ~s_memory0~0 50) .cse2 .cse3 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-10-13 01:17:03,376 INFO L857 garLoopResultBuilder]: For program point L728(lines 720 737) no Hoare annotation was computed. [2021-10-13 01:17:03,376 INFO L857 garLoopResultBuilder]: For program point L596(lines 477 829) no Hoare annotation was computed. [2021-10-13 01:17:03,377 INFO L857 garLoopResultBuilder]: For program point L398(lines 398 451) no Hoare annotation was computed. [2021-10-13 01:17:03,377 INFO L857 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2021-10-13 01:17:03,377 INFO L857 garLoopResultBuilder]: For program point L68(lines 68 71) no Hoare annotation was computed. [2021-10-13 01:17:03,377 INFO L857 garLoopResultBuilder]: For program point L993-1(lines 868 1098) no Hoare annotation was computed. [2021-10-13 01:17:03,377 INFO L857 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2021-10-13 01:17:03,378 INFO L857 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2021-10-13 01:17:03,378 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 403) no Hoare annotation was computed. [2021-10-13 01:17:03,378 INFO L857 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2021-10-13 01:17:03,378 INFO L853 garLoopResultBuilder]: At program point L267(lines 260 277) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (= ~m_run_pc~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1))) (or (let ((.cse3 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse0 (<= 1 ~c_m_lock~0) (= ~c_req_type~0 1) .cse1 .cse2 (<= .cse3 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 .cse3) (<= ~c_req_d~0 .cse3) (<= 0 ~a_t~0) (= ULTIMATE.start_m_run_~req_type~0 1) .cse4 .cse5 .cse6 .cse7 (<= .cse3 ~c_req_d~0))) (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= ~c_req_type~0 0))) (and .cse8 (= 2 ~s_run_pc~0) .cse4 .cse5))) [2021-10-13 01:17:03,378 INFO L857 garLoopResultBuilder]: For program point L1126(lines 1126 1133) no Hoare annotation was computed. [2021-10-13 01:17:03,379 INFO L857 garLoopResultBuilder]: For program point L994(lines 993 1017) no Hoare annotation was computed. [2021-10-13 01:17:03,379 INFO L857 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2021-10-13 01:17:03,379 INFO L857 garLoopResultBuilder]: For program point L268(lines 260 277) no Hoare annotation was computed. [2021-10-13 01:17:03,379 INFO L857 garLoopResultBuilder]: For program point L995(lines 995 999) no Hoare annotation was computed. [2021-10-13 01:17:03,379 INFO L857 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2021-10-13 01:17:03,380 INFO L853 garLoopResultBuilder]: At program point L137-2(lines 137 165) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse14 (<= 0 ~a_t~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse15 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse0 .cse2 .cse12 .cse3 .cse13 (= 2 ~s_run_pc~0) .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse1 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8)))) [2021-10-13 01:17:03,380 INFO L857 garLoopResultBuilder]: For program point L666(lines 666 719) no Hoare annotation was computed. [2021-10-13 01:17:03,380 INFO L857 garLoopResultBuilder]: For program point L138(lines 137 165) no Hoare annotation was computed. [2021-10-13 01:17:03,380 INFO L857 garLoopResultBuilder]: For program point L667(lines 667 671) no Hoare annotation was computed. [2021-10-13 01:17:03,381 INFO L853 garLoopResultBuilder]: At program point L1262(lines 1255 1308) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,381 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2021-10-13 01:17:03,381 INFO L853 garLoopResultBuilder]: At program point L1064(lines 1057 1074) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse14 (= 2 ~s_run_pc~0)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v))) (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 (= ULTIMATE.start_s_run_~req_type~1 1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse11 .cse12 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 01:17:03,381 INFO L857 garLoopResultBuilder]: For program point L206(lines 206 259) no Hoare annotation was computed. [2021-10-13 01:17:03,382 INFO L853 garLoopResultBuilder]: At program point L1197(lines 1190 1225) 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 .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 0 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 01:17:03,382 INFO L857 garLoopResultBuilder]: For program point L1065(lines 868 1098) no Hoare annotation was computed. [2021-10-13 01:17:03,382 INFO L853 garLoopResultBuilder]: At program point L405(lines 398 451) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,382 INFO L853 garLoopResultBuilder]: At program point L339(lines 332 367) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,383 INFO L857 garLoopResultBuilder]: For program point L1330(lines 1330 1334) no Hoare annotation was computed. [2021-10-13 01:17:03,383 INFO L857 garLoopResultBuilder]: For program point L1330-1(lines 1162 1341) no Hoare annotation was computed. [2021-10-13 01:17:03,383 INFO L857 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2021-10-13 01:17:03,383 INFO L857 garLoopResultBuilder]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-10-13 01:17:03,383 INFO L857 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2021-10-13 01:17:03,384 INFO L853 garLoopResultBuilder]: At program point L934(lines 927 953) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (<= ~s_memory0~0 50) .cse12 .cse13 .cse15 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,384 INFO L853 garLoopResultBuilder]: At program point L868-1(lines 852 1103) the Hoare annotation is: (let ((.cse2 (<= 1 ~c_m_lock~0)) (.cse12 (<= 50 ~s_memory0~0)) (.cse4 (<= 50 ~c_req_d~0)) (.cse6 (<= ~c_req_d~0 50)) (.cse14 (<= ~s_memory0~0 50)) (.cse9 (= ~m_run_pc~0 3)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse11 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (<= 0 ~a_t~0)) (.cse13 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_req_type~0 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse11 .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse12 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse13 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse14 .cse7 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse15 .cse10 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse16) (and .cse0 .cse2 .cse12 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse13 .cse6 .cse14 .cse7 .cse9 .cse15 .cse10 .cse16) (and .cse11 .cse0 .cse1 .cse3 (not (= ~c_m_lock~0 1)) .cse5 .cse13 .cse7 .cse8 (= ~m_run_pc~0 0)))) [2021-10-13 01:17:03,384 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,385 INFO L857 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2021-10-13 01:17:03,385 INFO L857 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2021-10-13 01:17:03,385 INFO L853 garLoopResultBuilder]: At program point L473(lines 125 474) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,385 INFO L857 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2021-10-13 01:17:03,386 INFO L857 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2021-10-13 01:17:03,386 INFO L857 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2021-10-13 01:17:03,386 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,386 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,386 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,386 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,387 INFO L857 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,387 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-10-13 01:17:03,387 INFO L857 garLoopResultBuilder]: For program point L871-1(lines 868 1098) no Hoare annotation was computed. [2021-10-13 01:17:03,387 INFO L857 garLoopResultBuilder]: For program point L739(lines 739 745) no Hoare annotation was computed. [2021-10-13 01:17:03,388 INFO L853 garLoopResultBuilder]: At program point L739-1(lines 739 745) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,388 INFO L853 garLoopResultBuilder]: At program point L673(lines 666 719) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,388 INFO L853 garLoopResultBuilder]: At program point L13-3(lines 1 1368) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ULTIMATE.start_s_memory_read_~i 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,389 INFO L853 garLoopResultBuilder]: At program point L13-4(lines 66 74) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (= ULTIMATE.start_s_memory_write_~i 0)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= 0 ~a_t~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 3)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (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 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,389 INFO L857 garLoopResultBuilder]: For program point L872(lines 871 895) no Hoare annotation was computed. [2021-10-13 01:17:03,389 INFO L853 garLoopResultBuilder]: At program point L1137(lines 1111 1152) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0))) (let ((.cse4 (not (= ~c_m_lock~0 1))) (.cse10 (= ~m_run_pc~0 0)) (.cse20 (= ~req_tt_a~0 0)) (.cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ~m_run_pc~0 6)) (.cse11 (= ~s_run_pc~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse13 (= ~c_req_type~0 1)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse18 (not .cse0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse19 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse14 (<= 50 ~c_req_d~0)) (.cse26 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse22 (<= ~s_memory0~0 50)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse24 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse11 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse12 .cse13 .cse11 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16 .cse17 .cse18) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 .cse12 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse19 .cse3 (= ULTIMATE.start_s_run_~req_type~1 0) .cse20 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse21 .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse22 .cse8 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse23 .cse24 .cse17 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse25) (and .cse5 .cse7 .cse8 .cse9 .cse16) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse8 .cse9 .cse16) (and .cse0 .cse1 .cse2 .cse12 .cse19 .cse20 .cse26 .cse5 .cse27 .cse21 .cse6 .cse22 .cse8 .cse9 .cse23 .cse24 .cse17 .cse25) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse23) (and .cse1 .cse12 .cse3 .cse5 .cse8 .cse9 .cse23) (and .cse2 .cse3 .cse11 .cse8 .cse9 .cse16 .cse18) (and .cse1 .cse2 .cse12 .cse13 .cse14 .cse5 .cse6 .cse15 .cse8 .cse9 .cse16 .cse17 .cse18) (and .cse1 .cse12 .cse19 .cse3 .cse14 .cse26 .cse5 .cse27 .cse6 .cse7 .cse15 .cse22 .cse8 .cse16 .cse24 .cse17 .cse25)))) [2021-10-13 01:17:03,389 INFO L857 garLoopResultBuilder]: For program point L873(lines 873 877) no Hoare annotation was computed. [2021-10-13 01:17:03,390 INFO L857 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2021-10-13 01:17:03,390 INFO L853 garLoopResultBuilder]: At program point L477-2(lines 477 829) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= 0 ~a_t~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 6)) (let ((.cse8 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse0 (<= 50 ~s_memory0~0) .cse1 (= ULTIMATE.start_m_run_~a~0 0) .cse2 (<= ~c_req_d~0 .cse8) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse4 .cse5 (<= ~s_memory0~0 50) .cse6 .cse7 (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= .cse8 ~c_req_d~0))))) [2021-10-13 01:17:03,390 INFO L853 garLoopResultBuilder]: At program point L1270(lines 1263 1307) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,391 INFO L853 garLoopResultBuilder]: At program point L213(lines 206 259) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse5 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse7 (<= ~c_req_d~0 .cse16)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse0 (= ~c_req_a~0 0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 (= 2 ~s_run_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse15 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 (not (= ~c_req_type~0 0)))))) [2021-10-13 01:17:03,391 INFO L857 garLoopResultBuilder]: For program point L478(lines 477 829) no Hoare annotation was computed. [2021-10-13 01:17:03,391 INFO L860 garLoopResultBuilder]: At program point L1337(lines 1159 1342) the Hoare annotation is: true [2021-10-13 01:17:03,391 INFO L853 garLoopResultBuilder]: At program point L280-2(lines 280 308) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse12 (not .cse5)) (.cse1 (= ~c_req_a~0 0)) (.cse3 (= ~c_req_type~0 1)) (.cse13 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse14 (not (= ~c_req_type~0 0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse11 (not (= ~s_run_st~0 0))) (.cse4 (<= 50 ~c_req_d~0)) (.cse6 (<= 0 ~a_t~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse5 .cse8 .cse9) (and .cse12 .cse1 .cse11 .cse13 .cse8 .cse9 .cse14) (and .cse5 .cse15 .cse8 .cse9 .cse16) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) (and .cse0 .cse2 (<= 50 ~s_memory0~0) .cse11 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse15 .cse7 (<= ~s_memory0~0 50) .cse8 .cse16 (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v))))) [2021-10-13 01:17:03,392 INFO L853 garLoopResultBuilder]: At program point L1205(lines 1198 1224) 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 .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 0 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 01:17:03,392 INFO L853 garLoopResultBuilder]: At program point L809(lines 802 819) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,392 INFO L857 garLoopResultBuilder]: For program point L611(lines 611 615) no Hoare annotation was computed. [2021-10-13 01:17:03,392 INFO L857 garLoopResultBuilder]: For program point L479(lines 479 483) no Hoare annotation was computed. [2021-10-13 01:17:03,393 INFO L853 garLoopResultBuilder]: At program point L413(lines 406 450) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,393 INFO L853 garLoopResultBuilder]: At program point L347(lines 340 366) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,393 INFO L857 garLoopResultBuilder]: For program point L281(lines 280 308) no Hoare annotation was computed. [2021-10-13 01:17:03,393 INFO L857 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2021-10-13 01:17:03,393 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-10-13 01:17:03,394 INFO L853 garLoopResultBuilder]: At program point L942(lines 935 952) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~c_req_type~0 0) .cse0 .cse1 .cse2 (<= 50 ~s_memory0~0) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (<= ~s_memory0~0 50) .cse12 .cse13 .cse15 (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-10-13 01:17:03,394 INFO L857 garLoopResultBuilder]: For program point L810(lines 802 819) no Hoare annotation was computed. [2021-10-13 01:17:03,394 INFO L857 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2021-10-13 01:17:03,394 INFO L857 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2021-10-13 01:17:03,394 INFO L857 garLoopResultBuilder]: For program point L1141(lines 1141 1148) no Hoare annotation was computed. [2021-10-13 01:17:03,395 INFO L857 garLoopResultBuilder]: For program point L943(lines 868 1098) no Hoare annotation was computed. [2021-10-13 01:17:03,395 INFO L857 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2021-10-13 01:17:03,395 INFO L857 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-10-13 01:17:03,395 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2021-10-13 01:17:03,395 INFO L857 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2021-10-13 01:17:03,396 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 01:17:03,396 INFO L853 garLoopResultBuilder]: At program point L681(lines 674 718) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,396 INFO L853 garLoopResultBuilder]: At program point L549(lines 519 550) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ~c_req_d~0 .cse0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= .cse0 ~c_req_d~0))) [2021-10-13 01:17:03,396 INFO L857 garLoopResultBuilder]: For program point L748(lines 748 801) no Hoare annotation was computed. [2021-10-13 01:17:03,397 INFO L857 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2021-10-13 01:17:03,397 INFO L857 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2021-10-13 01:17:03,397 INFO L853 garLoopResultBuilder]: At program point L617(lines 610 627) the Hoare annotation is: (and (<= 1 ~c_m_lock~0) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) [2021-10-13 01:17:03,397 INFO L853 garLoopResultBuilder]: At program point L1278(lines 1271 1306) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,398 INFO L853 garLoopResultBuilder]: At program point L221(lines 214 258) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse5 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse7 (<= ~c_req_d~0 .cse16)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse0 (= ~c_req_a~0 0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 (= 2 ~s_run_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse15 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 (not (= ~c_req_type~0 0)))))) [2021-10-13 01:17:03,398 INFO L857 garLoopResultBuilder]: For program point L1080(lines 1080 1084) no Hoare annotation was computed. [2021-10-13 01:17:03,398 INFO L857 garLoopResultBuilder]: For program point L618(lines 610 627) no Hoare annotation was computed. [2021-10-13 01:17:03,398 INFO L853 garLoopResultBuilder]: At program point L1213(lines 1206 1223) 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 .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 0 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 01:17:03,399 INFO L857 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2021-10-13 01:17:03,399 INFO L853 garLoopResultBuilder]: At program point L421(lines 414 449) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,399 INFO L853 garLoopResultBuilder]: At program point L487-2(lines 487 515) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (not (= ~c_m_lock~0 1)) (<= ~c_req_d~0 .cse0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~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) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= .cse0 ~c_req_d~0))) [2021-10-13 01:17:03,399 INFO L853 garLoopResultBuilder]: At program point L355(lines 348 365) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,400 INFO L857 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2021-10-13 01:17:03,400 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2021-10-13 01:17:03,400 INFO L857 garLoopResultBuilder]: For program point L1214(lines 1162 1341) no Hoare annotation was computed. [2021-10-13 01:17:03,400 INFO L857 garLoopResultBuilder]: For program point L488(lines 487 515) no Hoare annotation was computed. [2021-10-13 01:17:03,400 INFO L857 garLoopResultBuilder]: For program point L356(lines 126 472) no Hoare annotation was computed. [2021-10-13 01:17:03,401 INFO L857 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2021-10-13 01:17:03,401 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-13 01:17:03,401 INFO L857 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-10-13 01:17:03,401 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2021-10-13 01:17:03,401 INFO L853 garLoopResultBuilder]: At program point L1018(lines 992 1019) the Hoare annotation is: (let ((.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= ~c_req_d~0 50)) (.cse11 (= ~m_run_pc~0 3)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse15 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse12 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= 50 ULTIMATE.start_s_memory_write_~v))) (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 (= ULTIMATE.start_s_run_~req_type~1 1) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13 .cse14) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse15 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) .cse14))) [2021-10-13 01:17:03,402 INFO L857 garLoopResultBuilder]: For program point L556(lines 556 609) no Hoare annotation was computed. [2021-10-13 01:17:03,402 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 122) no Hoare annotation was computed. [2021-10-13 01:17:03,402 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 01:17:03,402 INFO L857 garLoopResultBuilder]: For program point L821(lines 821 827) no Hoare annotation was computed. [2021-10-13 01:17:03,402 INFO L853 garLoopResultBuilder]: At program point L821-1(lines 821 827) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (not (= ~s_run_st~0 0)) (not (= ~c_m_lock~0 1)) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0)) [2021-10-13 01:17:03,403 INFO L853 garLoopResultBuilder]: At program point L755(lines 748 801) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,403 INFO L853 garLoopResultBuilder]: At program point L689(lines 682 717) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) (= 2 ~s_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (<= ~c_rsp_d~0 50) (= ~c_empty_rsp~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,403 INFO L857 garLoopResultBuilder]: For program point L557(lines 557 561) no Hoare annotation was computed. [2021-10-13 01:17:03,404 INFO L853 garLoopResultBuilder]: At program point L1086(lines 1079 1096) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse4 (<= 0 ~a_t~0)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse9 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse9) (and .cse0 .cse1 .cse2 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) (let ((.cse10 (= ~m_run_pc~0 3))) (or (and (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse5 .cse10) (and .cse3 .cse5 .cse10))) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9))) [2021-10-13 01:17:03,404 INFO L853 garLoopResultBuilder]: At program point L1153(lines 1105 1158) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,404 INFO L857 garLoopResultBuilder]: For program point L1087(lines 1079 1096) no Hoare annotation was computed. [2021-10-13 01:17:03,404 INFO L857 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2021-10-13 01:17:03,405 INFO L857 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2021-10-13 01:17:03,405 INFO L853 garLoopResultBuilder]: At program point L1286(lines 1279 1305) the Hoare annotation is: (let ((.cse9 (not (= ~c_m_lock~0 1))) (.cse11 (= ~m_run_pc~0 0)) (.cse16 (= ~m_run_pc~0 6)) (.cse8 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 50 ~s_memory0~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse10 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= ~s_memory0~0 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 50 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse11) (and .cse8 .cse0 .cse12 .cse9 .cse2 .cse3 .cse4 .cse11) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse6 .cse7 .cse8 .cse13 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse2 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse3 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 .cse17 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0) .cse19) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and .cse7 .cse13 .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse8 .cse0 .cse12 .cse3 .cse4 .cse5 (not .cse6)) (and .cse7 .cse13 .cse14 .cse0 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse2 (<= ~c_req_d~0 50) .cse15 .cse3 .cse5 .cse17 .cse18 .cse19))) [2021-10-13 01:17:03,405 INFO L853 garLoopResultBuilder]: At program point L229(lines 222 257) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse5 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse7 (<= ~c_req_d~0 .cse16)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse0 (= ~c_req_a~0 0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 (= 2 ~s_run_pc~0) .cse8 .cse9 .cse10 .cse12 (or (and .cse11 .cse13) (and .cse11 (= ~m_run_pc~0 3))) .cse14) (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse15 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 (not (= ~c_req_type~0 0)))))) [2021-10-13 01:17:03,406 INFO L857 garLoopResultBuilder]: For program point L97(lines 97 121) no Hoare annotation was computed. [2021-10-13 01:17:03,406 INFO L857 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2021-10-13 01:17:03,406 INFO L853 garLoopResultBuilder]: At program point L98(lines 93 835) the Hoare annotation is: false [2021-10-13 01:17:03,406 INFO L853 garLoopResultBuilder]: At program point L429(lines 422 448) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (<= 50 ~c_req_d~0) (not (= ~c_m_lock~0 1)) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,406 INFO L857 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2021-10-13 01:17:03,407 INFO L857 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2021-10-13 01:17:03,407 INFO L857 garLoopResultBuilder]: For program point L958(lines 958 962) no Hoare annotation was computed. [2021-10-13 01:17:03,407 INFO L853 garLoopResultBuilder]: At program point L166(lines 136 167) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse14 (<= 0 ~a_t~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse15 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse0 .cse2 .cse12 .cse3 .cse13 (= 2 ~s_run_pc~0) .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse1 .cse2 .cse12 .cse3 .cse13 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8)))) [2021-10-13 01:17:03,407 INFO L857 garLoopResultBuilder]: For program point L100(lines 100 120) no Hoare annotation was computed. [2021-10-13 01:17:03,408 INFO L857 garLoopResultBuilder]: For program point L1025(lines 1025 1078) no Hoare annotation was computed. [2021-10-13 01:17:03,408 INFO L853 garLoopResultBuilder]: At program point L563(lines 556 609) the Hoare annotation is: (and (= ~c_req_type~0 0) (= ~c_req_a~0 0) (<= 1 ~c_m_lock~0) (<= 50 ~s_memory0~0) (not (= ~s_run_st~0 0)) (= ULTIMATE.start_m_run_~a~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50) (= 2 ~s_run_pc~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (<= 50 ULTIMATE.start_s_memory_write_~v)) [2021-10-13 01:17:03,408 INFO L857 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2021-10-13 01:17:03,408 INFO L853 garLoopResultBuilder]: At program point L101(lines 93 835) the Hoare annotation is: false [2021-10-13 01:17:03,408 INFO L857 garLoopResultBuilder]: For program point L1026(lines 1026 1030) no Hoare annotation was computed. [2021-10-13 01:17:03,414 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:17:03,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:17:03 BoogieIcfgContainer [2021-10-13 01:17:03,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:17:03,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:17:03,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:17:03,562 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:17:03,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:15:41" (3/4) ... [2021-10-13 01:17:03,567 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 01:17:03,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-13 01:17:03,612 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 01:17:03,614 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 01:17:03,616 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 01:17:03,662 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((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 && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && 50 <= c_req_d) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(c_req_type == 0))) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(c_req_type == 0))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,663 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,665 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(c_req_type == 0)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && m_run_st == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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)) || ((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(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)) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) [2021-10-13 01:17:03,665 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,668 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((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) && 50 <= c_req_d) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) || (((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) [2021-10-13 01:17:03,671 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= v) [2021-10-13 01:17:03,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) [2021-10-13 01:17:03,680 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,680 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,683 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v) || ((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && ((((!(s_run_st == 0) && s_run_pc == 0) && c_empty_req == 1) && m_run_pc == 3) || ((2 == s_run_pc && c_empty_req == 1) && m_run_pc == 3))) && 50 <= req_d) && 0 <= a_t) && c_req_d <= 50) && s_memory0 <= 50) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,684 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,684 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) [2021-10-13 01:17:03,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && v <= 50) && 0 <= a) && 50 <= v) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) [2021-10-13 01:17:03,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_type == 0) && i == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= v [2021-10-13 01:17:03,686 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,686 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,688 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,688 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,688 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,689 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,689 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,689 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,689 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v [2021-10-13 01:17:03,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:17:03,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:17:03,831 INFO L168 Benchmark]: Toolchain (without parser) took 84649.69 ms. Allocated memory was 113.2 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 81.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 282.0 MB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,831 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 113.2 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:17:03,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.82 ms. Allocated memory is still 113.2 MB. Free memory was 81.5 MB in the beginning and 81.1 MB in the end (delta: 400.2 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.00 ms. Allocated memory is still 113.2 MB. Free memory was 81.1 MB in the beginning and 77.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,833 INFO L168 Benchmark]: Boogie Preprocessor took 80.55 ms. Allocated memory is still 113.2 MB. Free memory was 77.8 MB in the beginning and 74.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,834 INFO L168 Benchmark]: RCFGBuilder took 1267.89 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 40.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,834 INFO L168 Benchmark]: TraceAbstraction took 82244.61 ms. Allocated memory was 136.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 110.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,835 INFO L168 Benchmark]: Witness Printer took 267.00 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 01:17:03,837 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.18 ms. Allocated memory is still 113.2 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 670.82 ms. Allocated memory is still 113.2 MB. Free memory was 81.5 MB in the beginning and 81.1 MB in the end (delta: 400.2 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.00 ms. Allocated memory is still 113.2 MB. Free memory was 81.1 MB in the beginning and 77.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 80.55 ms. Allocated memory is still 113.2 MB. Free memory was 77.8 MB in the beginning and 74.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1267.89 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 40.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 82244.61 ms. Allocated memory was 136.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 110.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. * Witness Printer took 267.00 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 82015.8ms, OverallIterations: 22, TraceHistogramMax: 4, EmptinessCheckTime: 106.0ms, AutomataDifference: 13779.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 53912.3ms, InitialAbstractionConstructionTime: 24.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12251 SDtfs, 15806 SDslu, 22067 SDs, 0 SdLazy, 3017 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2963.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 858 GetRequests, 712 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1596.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7429occurred in iteration=13, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5621.4ms AutomataMinimizationTime, 22 MinimizatonAttempts, 40828 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 639 NumberOfFragments, 11789 HoareAnnotationTreeSize, 98 FomulaSimplifications, 24836378 FormulaSimplificationTreeSizeReduction, 14355.6ms HoareSimplificationTime, 98 FomulaSimplificationsInter, 5349584 FormulaSimplificationTreeSizeReductionInter, 39485.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 248.4ms SsaConstructionTime, 721.1ms SatisfiabilityAnalysisTime, 5634.8ms InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2614 ConstructedInterpolants, 0 QuantifiedInterpolants, 7933 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2151 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 323/447 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: 1174]: Loop Invariant Derived loop invariant: (((((((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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 0 <= a_t) && 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: 316]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_type == 0) && i == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= v - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 452]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 870]: 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)) && s_run_pc == 0) && 50 <= c_req_d) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) || ((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && 2 == s_run_pc) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1263]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && v <= 50) && req_type___0 == 0) && 50 <= v - InvariantResult [Line: 903]: 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)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) - InvariantResult [Line: 911]: 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)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 50 <= v)) || ((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((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)) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((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)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((!(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 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((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 && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && 50 <= c_req_d) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(c_req_type == 0))) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(c_req_type == 0))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 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))) || (((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(c_req_type == 0)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && m_run_st == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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)) || ((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) && !(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)) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && a + 50 <= c_req_d) || ((((((((((((((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) && 0 <= a_t) && 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 + 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)) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: (((((((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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 0 <= a_t) && 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: 690]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 1033]: 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1041]: 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 630]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && v <= 50) && 0 <= a) && 50 <= v) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && c_req_d <= a + 50) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && req_type___0 == 0) && 50 <= v) && a + 50 <= c_req_d - InvariantResult [Line: 1228]: Loop Invariant Derived loop invariant: (((((((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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 0 <= a_t) && 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: 170]: 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) && 0 <= a_t) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 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: 169]: Loop Invariant Derived loop invariant: ((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 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 && 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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: (((((((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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 0 <= a_t) && 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: 1190]: Loop Invariant Derived loop invariant: (((((((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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 0 <= a_t) && 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: 1271]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1105]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1287]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1049]: 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 556]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && req_type___0 == 0) && 50 <= v - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: (((1 <= c_m_lock && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_type == 0) && i == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 957]: 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)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && c_req_d <= a + 50) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && req_type___0 == 0) && 50 <= v) && a + 50 <= c_req_d - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 1343]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && c_req_d <= a + 50) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && req_type___0 == 0) && 50 <= v) && a + 50 <= c_req_d - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 852]: 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)) && s_run_pc == 0) && 50 <= c_req_d) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a) || (((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 1 <= a) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && c_req_d <= a + 50) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 50 <= v) && a + 50 <= c_req_d) - InvariantResult [Line: 1025]: 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && a + 50 <= c_req_d) || (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 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)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((!(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) || (((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0)) || ((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) - InvariantResult [Line: 1255]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 927]: 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)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) - InvariantResult [Line: 919]: 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)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v) || ((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && ((((!(s_run_st == 0) && s_run_pc == 0) && c_empty_req == 1) && m_run_pc == 3) || ((2 == s_run_pc && c_empty_req == 1) && m_run_pc == 3))) && 50 <= req_d) && 0 <= a_t) && c_req_d <= 50) && s_memory0 <= 50) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && c_req_d <= a + 50) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && req_type___0 == 0) && 50 <= v) && a + 50 <= c_req_d - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && a + 50 <= c_req_d) || ((((((((((((((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) && 0 <= a_t) && 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 + 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)) - InvariantResult [Line: 935]: 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)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v)) || (((((((((((((((((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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && 0 <= a) && req_type == 1) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: ((((((((((((((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) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || ((((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) && 50 <= c_req_d) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && !(c_req_type == 0))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: (((((((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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 0 <= a_t) && 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: 852]: 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)) && 50 <= c_req_d) && 2 == s_run_pc) && 0 <= a_t) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 0 <= a)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 1159]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && req_tt_a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && v <= 50) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((2 <= c_write_req_ev && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((!(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) || (((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0)) || ((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) - InvariantResult [Line: 992]: 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v)) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= v) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && req_type___0 == 0) && 50 <= v - InvariantResult [Line: 802]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 50 <= rsp_d) && 50 <= s_memory0) && 49 + req_a___0 < rsp_d___0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 50 <= v - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && a + 50 <= c_req_d) || (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 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)) - InvariantResult [Line: 1057]: 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) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 50 <= v)) || ((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && v <= 50) && req_type___0 == 0) && 50 <= v - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 50 <= v) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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) && m_run_pc == 0)) || (((((((((((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) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - InvariantResult [Line: 1309]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((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) && 0 <= a_t) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && a + 50 <= c_req_d) || ((((((((((((((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) && 0 <= a_t) && 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 + 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)) - InvariantResult [Line: 1279]: 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_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((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)) || ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && 50 <= rsp_d) && 50 <= s_memory0) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && v <= 50) && 0 <= a) && \result <= 50) && 50 <= c_rsp_d) && 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 && !(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_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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))) || ((((((((((((((((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) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v <= 50) && 0 <= a) && 50 <= v) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && 50 <= c_req_d) && i == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && 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) && 50 <= c_req_d) && i == 0) && req_d <= 50) && 50 <= req_d) && 0 <= a_t) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 0 <= a) && req_type == 1) && 50 <= v) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && v <= 50) && req_type___0 == 0) && 50 <= v - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 0 <= a_t) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a RESULT: Ultimate proved your program to be correct! [2021-10-13 01:17:04,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e352d2-081c-4e65-9764-2891581c9790/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...