./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13a2f963fb17b383a7c5451f284cefc57445bb3b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13a2f963fb17b383a7c5451f284cefc57445bb3b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:44:40,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:44:40,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:44:40,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:44:40,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:44:40,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:44:40,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:44:40,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:44:40,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:44:40,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:44:40,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:44:40,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:44:40,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:44:40,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:44:40,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:44:40,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:44:40,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:44:40,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:44:40,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:44:40,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:44:40,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:44:40,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:44:40,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:44:40,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:44:40,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:44:40,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:44:40,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:44:40,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:44:40,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:44:40,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:44:40,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:44:40,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:44:40,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:44:40,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:44:40,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:44:40,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:44:40,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:44:40,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:44:40,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:44:40,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:44:40,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:44:40,359 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:44:40,418 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:44:40,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:44:40,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:44:40,421 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:44:40,421 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:44:40,421 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:44:40,422 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:44:40,422 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:44:40,428 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:44:40,428 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:44:40,430 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:44:40,430 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:44:40,430 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:44:40,431 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:44:40,431 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:44:40,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:44:40,432 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:44:40,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:44:40,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:44:40,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:44:40,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:44:40,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:44:40,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:44:40,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:44:40,434 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:44:40,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:44:40,434 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:44:40,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:44:40,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:44:40,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:44:40,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:44:40,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:44:40,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:44:40,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:44:40,437 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:44:40,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:44:40,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:44:40,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:44:40,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:44:40,438 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> 13a2f963fb17b383a7c5451f284cefc57445bb3b [2021-10-13 07:44:40,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:44:40,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:44:40,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:44:40,741 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:44:40,742 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:44:40,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2021-10-13 07:44:40,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/1bc2ea478/197e233895ed4398989a4ca0e1772c4c/FLAGbbbc04469 [2021-10-13 07:44:41,343 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:44:41,344 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2021-10-13 07:44:41,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/1bc2ea478/197e233895ed4398989a4ca0e1772c4c/FLAGbbbc04469 [2021-10-13 07:44:41,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/1bc2ea478/197e233895ed4398989a4ca0e1772c4c [2021-10-13 07:44:41,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:44:41,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:44:41,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:44:41,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:44:41,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:44:41,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:41" (1/1) ... [2021-10-13 07:44:41,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de4cc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41, skipping insertion in model container [2021-10-13 07:44:41,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:41" (1/1) ... [2021-10-13 07:44:41,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:44:41,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:44:41,885 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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2021-10-13 07:44:42,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:44:42,022 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:44:42,045 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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2021-10-13 07:44:42,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:44:42,168 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:44:42,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42 WrapperNode [2021-10-13 07:44:42,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:44:42,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:44:42,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:44:42,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:44:42,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:44:42,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:44:42,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:44:42,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:44:42,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:44:42,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:44:42,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:44:42,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:44:42,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (1/1) ... [2021-10-13 07:44:42,362 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:44:42,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:44:42,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:44:42,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:44:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:44:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:44:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:44:42,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:44:43,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:44:43,760 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-10-13 07:44:43,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:43 BoogieIcfgContainer [2021-10-13 07:44:43,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:44:43,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:44:43,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:44:43,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:44:43,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:41" (1/3) ... [2021-10-13 07:44:43,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a702f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:43, skipping insertion in model container [2021-10-13 07:44:43,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:42" (2/3) ... [2021-10-13 07:44:43,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a702f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:43, skipping insertion in model container [2021-10-13 07:44:43,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:43" (3/3) ... [2021-10-13 07:44:43,775 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2021-10-13 07:44:43,782 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:44:43,782 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-10-13 07:44:43,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:44:43,859 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 07:44:43,860 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 07:44:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 221 states have (on average 1.7918552036199096) internal successors, (396), 226 states have internal predecessors, (396), 0 states have call successors, (0), 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 07:44:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:44:43,892 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:43,893 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] [2021-10-13 07:44:43,893 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:44:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash -345600725, now seen corresponding path program 1 times [2021-10-13 07:44:43,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:43,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510598728] [2021-10-13 07:44:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:43,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:44,106 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 07:44:44,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:44,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510598728] [2021-10-13 07:44:44,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510598728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:44,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:44,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:44:44,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462131693] [2021-10-13 07:44:44,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:44,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:44,132 INFO L87 Difference]: Start difference. First operand has 227 states, 221 states have (on average 1.7918552036199096) internal successors, (396), 226 states have internal predecessors, (396), 0 states have call successors, (0), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 07:44:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:44,579 INFO L93 Difference]: Finished difference Result 608 states and 1046 transitions. [2021-10-13 07:44:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-13 07:44:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:44,595 INFO L225 Difference]: With dead ends: 608 [2021-10-13 07:44:44,595 INFO L226 Difference]: Without dead ends: 379 [2021-10-13 07:44:44,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-10-13 07:44:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 369. [2021-10-13 07:44:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 364 states have (on average 1.5302197802197801) internal successors, (557), 368 states have internal predecessors, (557), 0 states have call successors, (0), 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 07:44:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 557 transitions. [2021-10-13 07:44:44,678 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 557 transitions. Word has length 23 [2021-10-13 07:44:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:44,680 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 557 transitions. [2021-10-13 07:44:44,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 07:44:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 557 transitions. [2021-10-13 07:44:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 07:44:44,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:44,691 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] [2021-10-13 07:44:44,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:44:44,692 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 07:44:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash 912734084, now seen corresponding path program 1 times [2021-10-13 07:44:44,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:44,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422915616] [2021-10-13 07:44:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:44,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:44,771 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 07:44:44,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:44,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422915616] [2021-10-13 07:44:44,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422915616] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:44,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:44,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:44:44,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200345714] [2021-10-13 07:44:44,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:44,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:44,775 INFO L87 Difference]: Start difference. First operand 369 states and 557 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 07:44:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:44,970 INFO L93 Difference]: Finished difference Result 959 states and 1472 transitions. [2021-10-13 07:44:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-13 07:44:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:44,976 INFO L225 Difference]: With dead ends: 959 [2021-10-13 07:44:44,977 INFO L226 Difference]: Without dead ends: 600 [2021-10-13 07:44:44,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-13 07:44:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 590. [2021-10-13 07:44:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 585 states have (on average 1.5675213675213675) internal successors, (917), 589 states have internal predecessors, (917), 0 states have call successors, (0), 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 07:44:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 917 transitions. [2021-10-13 07:44:45,045 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 917 transitions. Word has length 33 [2021-10-13 07:44:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:45,046 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 917 transitions. [2021-10-13 07:44:45,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 07:44:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 917 transitions. [2021-10-13 07:44:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 07:44:45,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:45,047 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] [2021-10-13 07:44:45,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:44:45,047 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 07:44:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash -81793111, now seen corresponding path program 1 times [2021-10-13 07:44:45,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:45,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755947803] [2021-10-13 07:44:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:45,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:45,141 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 07:44:45,142 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:45,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755947803] [2021-10-13 07:44:45,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755947803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:45,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:45,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:44:45,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109049939] [2021-10-13 07:44:45,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:45,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:45,151 INFO L87 Difference]: Start difference. First operand 590 states and 917 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 07:44:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:45,210 INFO L93 Difference]: Finished difference Result 1500 states and 2340 transitions. [2021-10-13 07:44:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-10-13 07:44:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:45,220 INFO L225 Difference]: With dead ends: 1500 [2021-10-13 07:44:45,221 INFO L226 Difference]: Without dead ends: 920 [2021-10-13 07:44:45,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-10-13 07:44:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 908. [2021-10-13 07:44:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 903 states have (on average 1.5681063122923589) internal successors, (1416), 907 states have internal predecessors, (1416), 0 states have call successors, (0), 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 07:44:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1416 transitions. [2021-10-13 07:44:45,268 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1416 transitions. Word has length 34 [2021-10-13 07:44:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:45,269 INFO L470 AbstractCegarLoop]: Abstraction has 908 states and 1416 transitions. [2021-10-13 07:44:45,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 07:44:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1416 transitions. [2021-10-13 07:44:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 07:44:45,274 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:45,274 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] [2021-10-13 07:44:45,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:44:45,275 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 07:44:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -562646768, now seen corresponding path program 1 times [2021-10-13 07:44:45,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:45,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710871091] [2021-10-13 07:44:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:45,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:45,336 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 07:44:45,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:45,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710871091] [2021-10-13 07:44:45,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710871091] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:45,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:45,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:44:45,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239893555] [2021-10-13 07:44:45,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:45,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:45,339 INFO L87 Difference]: Start difference. First operand 908 states and 1416 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:45,892 INFO L93 Difference]: Finished difference Result 3236 states and 5072 transitions. [2021-10-13 07:44:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:44:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 07:44:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:45,910 INFO L225 Difference]: With dead ends: 3236 [2021-10-13 07:44:45,910 INFO L226 Difference]: Without dead ends: 2338 [2021-10-13 07:44:45,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:44:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-10-13 07:44:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1892. [2021-10-13 07:44:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1887 states have (on average 1.571807101218866) internal successors, (2966), 1891 states have internal predecessors, (2966), 0 states have call successors, (0), 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 07:44:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2966 transitions. [2021-10-13 07:44:46,019 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2966 transitions. Word has length 39 [2021-10-13 07:44:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:46,019 INFO L470 AbstractCegarLoop]: Abstraction has 1892 states and 2966 transitions. [2021-10-13 07:44:46,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:44:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2966 transitions. [2021-10-13 07:44:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:44:46,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:46,022 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] [2021-10-13 07:44:46,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:44:46,022 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 07:44:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash -179255540, now seen corresponding path program 1 times [2021-10-13 07:44:46,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:46,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318942772] [2021-10-13 07:44:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:46,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:46,089 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 07:44:46,090 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:46,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318942772] [2021-10-13 07:44:46,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318942772] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:46,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:46,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:44:46,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204538302] [2021-10-13 07:44:46,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:46,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:46,093 INFO L87 Difference]: Start difference. First operand 1892 states and 2966 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 07:44:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:46,351 INFO L93 Difference]: Finished difference Result 5369 states and 8393 transitions. [2021-10-13 07:44:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:46,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-10-13 07:44:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:46,374 INFO L225 Difference]: With dead ends: 5369 [2021-10-13 07:44:46,374 INFO L226 Difference]: Without dead ends: 3485 [2021-10-13 07:44:46,378 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 07:44:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2021-10-13 07:44:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3415. [2021-10-13 07:44:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3410 states have (on average 1.541348973607038) internal successors, (5256), 3414 states have internal predecessors, (5256), 0 states have call successors, (0), 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 07:44:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5256 transitions. [2021-10-13 07:44:46,561 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5256 transitions. Word has length 47 [2021-10-13 07:44:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:46,563 INFO L470 AbstractCegarLoop]: Abstraction has 3415 states and 5256 transitions. [2021-10-13 07:44:46,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 07:44:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5256 transitions. [2021-10-13 07:44:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:44:46,565 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:46,565 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] [2021-10-13 07:44:46,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:44:46,565 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 07:44:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1541144444, now seen corresponding path program 1 times [2021-10-13 07:44:46,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:46,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448855977] [2021-10-13 07:44:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:46,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:46,673 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 07:44:46,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:46,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448855977] [2021-10-13 07:44:46,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448855977] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:46,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:46,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:44:46,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681439644] [2021-10-13 07:44:46,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:46,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:46,683 INFO L87 Difference]: Start difference. First operand 3415 states and 5256 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 07:44:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:46,913 INFO L93 Difference]: Finished difference Result 8143 states and 12495 transitions. [2021-10-13 07:44:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-10-13 07:44:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:46,944 INFO L225 Difference]: With dead ends: 8143 [2021-10-13 07:44:46,944 INFO L226 Difference]: Without dead ends: 4737 [2021-10-13 07:44:46,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2021-10-13 07:44:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4475. [2021-10-13 07:44:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 4470 states have (on average 1.5248322147651008) internal successors, (6816), 4474 states have internal predecessors, (6816), 0 states have call successors, (0), 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 07:44:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 6816 transitions. [2021-10-13 07:44:47,230 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 6816 transitions. Word has length 47 [2021-10-13 07:44:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:47,230 INFO L470 AbstractCegarLoop]: Abstraction has 4475 states and 6816 transitions. [2021-10-13 07:44:47,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 07:44:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 6816 transitions. [2021-10-13 07:44:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 07:44:47,233 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:47,233 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] [2021-10-13 07:44:47,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:44:47,234 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 07:44:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 42437372, now seen corresponding path program 1 times [2021-10-13 07:44:47,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:47,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333554690] [2021-10-13 07:44:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:47,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:47,278 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 07:44:47,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:47,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333554690] [2021-10-13 07:44:47,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333554690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:47,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:47,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:44:47,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589434512] [2021-10-13 07:44:47,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:47,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:47,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:47,282 INFO L87 Difference]: Start difference. First operand 4475 states and 6816 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 07:44:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:47,856 INFO L93 Difference]: Finished difference Result 10865 states and 16554 transitions. [2021-10-13 07:44:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-10-13 07:44:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:47,898 INFO L225 Difference]: With dead ends: 10865 [2021-10-13 07:44:47,898 INFO L226 Difference]: Without dead ends: 6399 [2021-10-13 07:44:47,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2021-10-13 07:44:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 5188. [2021-10-13 07:44:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 5183 states have (on average 1.4692263168049393) internal successors, (7615), 5187 states have internal predecessors, (7615), 0 states have call successors, (0), 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 07:44:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7615 transitions. [2021-10-13 07:44:48,233 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7615 transitions. Word has length 51 [2021-10-13 07:44:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:48,235 INFO L470 AbstractCegarLoop]: Abstraction has 5188 states and 7615 transitions. [2021-10-13 07:44:48,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 07:44:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7615 transitions. [2021-10-13 07:44:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:44:48,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:48,238 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] [2021-10-13 07:44:48,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:44:48,239 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 07:44:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:48,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1976303984, now seen corresponding path program 1 times [2021-10-13 07:44:48,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:48,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7014301] [2021-10-13 07:44:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:48,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:48,318 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 07:44:48,318 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:48,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7014301] [2021-10-13 07:44:48,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7014301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:48,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:48,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:44:48,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804770148] [2021-10-13 07:44:48,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:48,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:48,321 INFO L87 Difference]: Start difference. First operand 5188 states and 7615 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 07:44:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:48,621 INFO L93 Difference]: Finished difference Result 10242 states and 15064 transitions. [2021-10-13 07:44:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-10-13 07:44:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:48,664 INFO L225 Difference]: With dead ends: 10242 [2021-10-13 07:44:48,665 INFO L226 Difference]: Without dead ends: 5063 [2021-10-13 07:44:48,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 07:44:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2021-10-13 07:44:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5063. [2021-10-13 07:44:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5058 states have (on average 1.464610517991301) internal successors, (7408), 5062 states have internal predecessors, (7408), 0 states have call successors, (0), 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 07:44:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7408 transitions. [2021-10-13 07:44:49,009 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7408 transitions. Word has length 53 [2021-10-13 07:44:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:49,009 INFO L470 AbstractCegarLoop]: Abstraction has 5063 states and 7408 transitions. [2021-10-13 07:44:49,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 07:44:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7408 transitions. [2021-10-13 07:44:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 07:44:49,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:49,014 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] [2021-10-13 07:44:49,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:44:49,014 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 07:44:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash 765003872, now seen corresponding path program 1 times [2021-10-13 07:44:49,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:49,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083351459] [2021-10-13 07:44:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:49,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:49,063 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 07:44:49,064 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:49,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083351459] [2021-10-13 07:44:49,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083351459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:49,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:49,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:44:49,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493113154] [2021-10-13 07:44:49,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:49,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:49,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:49,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:49,070 INFO L87 Difference]: Start difference. First operand 5063 states and 7408 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 07:44:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:49,441 INFO L93 Difference]: Finished difference Result 11495 states and 17061 transitions. [2021-10-13 07:44:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-10-13 07:44:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:49,478 INFO L225 Difference]: With dead ends: 11495 [2021-10-13 07:44:49,478 INFO L226 Difference]: Without dead ends: 6441 [2021-10-13 07:44:49,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2021-10-13 07:44:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 3991. [2021-10-13 07:44:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3986 states have (on average 1.4904666332162568) internal successors, (5941), 3990 states have internal predecessors, (5941), 0 states have call successors, (0), 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 07:44:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 5941 transitions. [2021-10-13 07:44:49,792 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 5941 transitions. Word has length 54 [2021-10-13 07:44:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:49,792 INFO L470 AbstractCegarLoop]: Abstraction has 3991 states and 5941 transitions. [2021-10-13 07:44:49,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 07:44:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 5941 transitions. [2021-10-13 07:44:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-13 07:44:49,795 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:49,795 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 07:44:49,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:44:49,796 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 07:44:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1984281579, now seen corresponding path program 1 times [2021-10-13 07:44:49,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:49,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195837458] [2021-10-13 07:44:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:49,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:49,889 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 07:44:49,890 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:49,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195837458] [2021-10-13 07:44:49,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195837458] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:49,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:49,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:44:49,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085598405] [2021-10-13 07:44:49,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:44:49,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:49,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:44:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:44:49,894 INFO L87 Difference]: Start difference. First operand 3991 states and 5941 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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 07:44:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:51,428 INFO L93 Difference]: Finished difference Result 21773 states and 32375 transitions. [2021-10-13 07:44:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 07:44:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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 07:44:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:51,492 INFO L225 Difference]: With dead ends: 21773 [2021-10-13 07:44:51,492 INFO L226 Difference]: Without dead ends: 17852 [2021-10-13 07:44:51,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 78.0ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-13 07:44:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17852 states. [2021-10-13 07:44:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17852 to 5441. [2021-10-13 07:44:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5441 states, 5436 states have (on average 1.4876747608535688) internal successors, (8087), 5440 states have internal predecessors, (8087), 0 states have call successors, (0), 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 07:44:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5441 states to 5441 states and 8087 transitions. [2021-10-13 07:44:51,985 INFO L78 Accepts]: Start accepts. Automaton has 5441 states and 8087 transitions. Word has length 56 [2021-10-13 07:44:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:51,985 INFO L470 AbstractCegarLoop]: Abstraction has 5441 states and 8087 transitions. [2021-10-13 07:44:51,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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 07:44:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5441 states and 8087 transitions. [2021-10-13 07:44:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-13 07:44:51,987 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:51,987 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] [2021-10-13 07:44:51,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:44:51,988 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 07:44:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1364161025, now seen corresponding path program 1 times [2021-10-13 07:44:51,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:51,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060551375] [2021-10-13 07:44:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:51,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:52,043 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 07:44:52,043 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:52,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060551375] [2021-10-13 07:44:52,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060551375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:52,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:52,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:44:52,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807092570] [2021-10-13 07:44:52,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:44:52,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:52,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:44:52,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:44:52,046 INFO L87 Difference]: Start difference. First operand 5441 states and 8087 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 07:44:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:54,351 INFO L93 Difference]: Finished difference Result 39265 states and 58080 transitions. [2021-10-13 07:44:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-13 07:44:54,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-10-13 07:44:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:54,465 INFO L225 Difference]: With dead ends: 39265 [2021-10-13 07:44:54,465 INFO L226 Difference]: Without dead ends: 33894 [2021-10-13 07:44:54,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 181.0ms TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-10-13 07:44:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33894 states. [2021-10-13 07:44:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33894 to 5767. [2021-10-13 07:44:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5762 states have (on average 1.47709128774731) internal successors, (8511), 5766 states have internal predecessors, (8511), 0 states have call successors, (0), 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 07:44:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 8511 transitions. [2021-10-13 07:44:55,283 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 8511 transitions. Word has length 57 [2021-10-13 07:44:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:55,284 INFO L470 AbstractCegarLoop]: Abstraction has 5767 states and 8511 transitions. [2021-10-13 07:44:55,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 07:44:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 8511 transitions. [2021-10-13 07:44:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-13 07:44:55,287 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:55,287 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] [2021-10-13 07:44:55,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:44:55,288 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 07:44:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:55,288 INFO L82 PathProgramCache]: Analyzing trace with hash -725656635, now seen corresponding path program 1 times [2021-10-13 07:44:55,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:55,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269212636] [2021-10-13 07:44:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:55,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:55,337 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 07:44:55,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:55,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269212636] [2021-10-13 07:44:55,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269212636] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:55,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:55,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:44:55,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24615012] [2021-10-13 07:44:55,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:55,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:55,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:55,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:55,345 INFO L87 Difference]: Start difference. First operand 5767 states and 8511 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 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 07:44:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:55,787 INFO L93 Difference]: Finished difference Result 12234 states and 18006 transitions. [2021-10-13 07:44:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:55,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-10-13 07:44:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:55,807 INFO L225 Difference]: With dead ends: 12234 [2021-10-13 07:44:55,807 INFO L226 Difference]: Without dead ends: 6485 [2021-10-13 07:44:55,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6485 states. [2021-10-13 07:44:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6485 to 5817. [2021-10-13 07:44:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5817 states, 5812 states have (on average 1.4741913282863042) internal successors, (8568), 5816 states have internal predecessors, (8568), 0 states have call successors, (0), 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 07:44:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5817 states to 5817 states and 8568 transitions. [2021-10-13 07:44:56,234 INFO L78 Accepts]: Start accepts. Automaton has 5817 states and 8568 transitions. Word has length 70 [2021-10-13 07:44:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:56,234 INFO L470 AbstractCegarLoop]: Abstraction has 5817 states and 8568 transitions. [2021-10-13 07:44:56,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 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 07:44:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5817 states and 8568 transitions. [2021-10-13 07:44:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-13 07:44:56,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:56,237 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:44:56,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:44:56,238 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 07:44:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:56,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2079947985, now seen corresponding path program 1 times [2021-10-13 07:44:56,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:56,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741669174] [2021-10-13 07:44:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:56,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:56,271 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:56,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741669174] [2021-10-13 07:44:56,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741669174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:56,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:56,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:44:56,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156161791] [2021-10-13 07:44:56,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:44:56,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:44:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:44:56,273 INFO L87 Difference]: Start difference. First operand 5817 states and 8568 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 07:44:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:57,058 INFO L93 Difference]: Finished difference Result 13351 states and 19599 transitions. [2021-10-13 07:44:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:44:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-10-13 07:44:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:57,075 INFO L225 Difference]: With dead ends: 13351 [2021-10-13 07:44:57,076 INFO L226 Difference]: Without dead ends: 7544 [2021-10-13 07:44:57,083 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:44:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2021-10-13 07:44:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6684. [2021-10-13 07:44:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6684 states, 6679 states have (on average 1.4593502021260667) internal successors, (9747), 6683 states have internal predecessors, (9747), 0 states have call successors, (0), 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 07:44:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6684 states to 6684 states and 9747 transitions. [2021-10-13 07:44:57,617 INFO L78 Accepts]: Start accepts. Automaton has 6684 states and 9747 transitions. Word has length 80 [2021-10-13 07:44:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:57,618 INFO L470 AbstractCegarLoop]: Abstraction has 6684 states and 9747 transitions. [2021-10-13 07:44:57,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 07:44:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6684 states and 9747 transitions. [2021-10-13 07:44:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-13 07:44:57,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:57,621 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] [2021-10-13 07:44:57,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:44:57,621 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 07:44:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash -154540879, now seen corresponding path program 1 times [2021-10-13 07:44:57,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:57,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256112286] [2021-10-13 07:44:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:57,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:44:57,663 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:57,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256112286] [2021-10-13 07:44:57,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256112286] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:57,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:57,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:44:57,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366118789] [2021-10-13 07:44:57,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:44:57,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:44:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:57,666 INFO L87 Difference]: Start difference. First operand 6684 states and 9747 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:44:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:57,949 INFO L93 Difference]: Finished difference Result 9731 states and 14279 transitions. [2021-10-13 07:44:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:44:57,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-10-13 07:44:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:57,954 INFO L225 Difference]: With dead ends: 9731 [2021-10-13 07:44:57,954 INFO L226 Difference]: Without dead ends: 3088 [2021-10-13 07:44:57,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:44:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2021-10-13 07:44:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3058. [2021-10-13 07:44:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3053 states have (on average 1.4025548640681298) internal successors, (4282), 3057 states have internal predecessors, (4282), 0 states have call successors, (0), 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 07:44:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 4282 transitions. [2021-10-13 07:44:58,201 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 4282 transitions. Word has length 85 [2021-10-13 07:44:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:58,202 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 4282 transitions. [2021-10-13 07:44:58,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 07:44:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 4282 transitions. [2021-10-13 07:44:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-13 07:44:58,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:58,204 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] [2021-10-13 07:44:58,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:44:58,204 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 07:44:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 163292225, now seen corresponding path program 1 times [2021-10-13 07:44:58,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:58,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82688095] [2021-10-13 07:44:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:58,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:58,250 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 07:44:58,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:58,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82688095] [2021-10-13 07:44:58,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82688095] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:44:58,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:44:58,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:44:58,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239133260] [2021-10-13 07:44:58,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:44:58,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:44:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:44:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:44:58,252 INFO L87 Difference]: Start difference. First operand 3058 states and 4282 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 07:44:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:44:59,217 INFO L93 Difference]: Finished difference Result 12996 states and 18287 transitions. [2021-10-13 07:44:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:44:59,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-10-13 07:44:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:44:59,234 INFO L225 Difference]: With dead ends: 12996 [2021-10-13 07:44:59,235 INFO L226 Difference]: Without dead ends: 10073 [2021-10-13 07:44:59,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:44:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10073 states. [2021-10-13 07:44:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10073 to 3060. [2021-10-13 07:44:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3055 states have (on average 1.3983633387888708) internal successors, (4272), 3059 states have internal predecessors, (4272), 0 states have call successors, (0), 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 07:44:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4272 transitions. [2021-10-13 07:44:59,573 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4272 transitions. Word has length 90 [2021-10-13 07:44:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:44:59,574 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 4272 transitions. [2021-10-13 07:44:59,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 07:44:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4272 transitions. [2021-10-13 07:44:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-13 07:44:59,576 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:44:59,576 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] [2021-10-13 07:44:59,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:44:59,577 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 07:44:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:44:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1490863100, now seen corresponding path program 1 times [2021-10-13 07:44:59,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:44:59,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387836549] [2021-10-13 07:44:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:59,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:44:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:59,656 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 07:44:59,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:44:59,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387836549] [2021-10-13 07:44:59,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387836549] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:44:59,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979167538] [2021-10-13 07:44:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:44:59,660 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:44:59,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:44:59,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:44:59,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:44:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:44:59,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:44:59,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:00,113 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 07:45:00,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:00,394 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 07:45:00,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979167538] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:00,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:45:00,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2021-10-13 07:45:00,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561020623] [2021-10-13 07:45:00,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:00,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:00,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:45:00,397 INFO L87 Difference]: Start difference. First operand 3060 states and 4272 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 07:45:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:00,882 INFO L93 Difference]: Finished difference Result 3864 states and 5383 transitions. [2021-10-13 07:45:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:00,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 92 [2021-10-13 07:45:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:00,888 INFO L225 Difference]: With dead ends: 3864 [2021-10-13 07:45:00,888 INFO L226 Difference]: Without dead ends: 3860 [2021-10-13 07:45:00,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:45:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3860 states. [2021-10-13 07:45:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3860 to 3771. [2021-10-13 07:45:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3766 states have (on average 1.402283590015932) internal successors, (5281), 3770 states have internal predecessors, (5281), 0 states have call successors, (0), 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 07:45:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 5281 transitions. [2021-10-13 07:45:01,334 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 5281 transitions. Word has length 92 [2021-10-13 07:45:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:01,334 INFO L470 AbstractCegarLoop]: Abstraction has 3771 states and 5281 transitions. [2021-10-13 07:45:01,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 07:45:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 5281 transitions. [2021-10-13 07:45:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-13 07:45:01,338 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:01,338 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] [2021-10-13 07:45:01,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:01,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:01,553 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 07:45:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash -347771631, now seen corresponding path program 1 times [2021-10-13 07:45:01,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:01,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035688727] [2021-10-13 07:45:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:01,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:01,616 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 07:45:01,616 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:01,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035688727] [2021-10-13 07:45:01,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035688727] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:45:01,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745093451] [2021-10-13 07:45:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:01,617 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:01,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:01,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:01,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 07:45:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:01,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:01,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:02,130 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 07:45:02,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:02,441 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 07:45:02,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745093451] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:02,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:45:02,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2021-10-13 07:45:02,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820973303] [2021-10-13 07:45:02,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:02,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:02,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:02,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:45:02,444 INFO L87 Difference]: Start difference. First operand 3771 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 07:45:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:02,859 INFO L93 Difference]: Finished difference Result 7385 states and 10387 transitions. [2021-10-13 07:45:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:02,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 142 [2021-10-13 07:45:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:02,864 INFO L225 Difference]: With dead ends: 7385 [2021-10-13 07:45:02,864 INFO L226 Difference]: Without dead ends: 3771 [2021-10-13 07:45:02,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:45:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2021-10-13 07:45:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 3771. [2021-10-13 07:45:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3766 states have (on average 1.3704195432819968) internal successors, (5161), 3770 states have internal predecessors, (5161), 0 states have call successors, (0), 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 07:45:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 5161 transitions. [2021-10-13 07:45:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 5161 transitions. Word has length 142 [2021-10-13 07:45:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,207 INFO L470 AbstractCegarLoop]: Abstraction has 3771 states and 5161 transitions. [2021-10-13 07:45:03,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 07:45:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 5161 transitions. [2021-10-13 07:45:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-10-13 07:45:03,211 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,212 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] [2021-10-13 07:45:03,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:03,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 07:45:03,425 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 07:45:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1729642040, now seen corresponding path program 1 times [2021-10-13 07:45:03,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503486221] [2021-10-13 07:45:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:03,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503486221] [2021-10-13 07:45:03,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503486221] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:45:03,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868093645] [2021-10-13 07:45:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,501 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:03,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:03,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 07:45:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:03,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 07:45:04,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 07:45:04,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868093645] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:04,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:45:04,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2021-10-13 07:45:04,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585541270] [2021-10-13 07:45:04,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:04,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:04,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:04,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:45:04,542 INFO L87 Difference]: Start difference. First operand 3771 states and 5161 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 07:45:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:04,983 INFO L93 Difference]: Finished difference Result 7369 states and 10131 transitions. [2021-10-13 07:45:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:04,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 145 [2021-10-13 07:45:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:04,990 INFO L225 Difference]: With dead ends: 7369 [2021-10-13 07:45:04,990 INFO L226 Difference]: Without dead ends: 3755 [2021-10-13 07:45:04,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:45:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2021-10-13 07:45:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2021-10-13 07:45:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3750 states have (on average 1.34) internal successors, (5025), 3754 states have internal predecessors, (5025), 0 states have call successors, (0), 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 07:45:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5025 transitions. [2021-10-13 07:45:05,328 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5025 transitions. Word has length 145 [2021-10-13 07:45:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:05,329 INFO L470 AbstractCegarLoop]: Abstraction has 3755 states and 5025 transitions. [2021-10-13 07:45:05,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 07:45:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5025 transitions. [2021-10-13 07:45:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-13 07:45:05,333 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:05,333 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:05,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:05,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 07:45:05,553 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1767201759, now seen corresponding path program 1 times [2021-10-13 07:45:05,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:05,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219053546] [2021-10-13 07:45:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:05,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:05,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:05,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219053546] [2021-10-13 07:45:05,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219053546] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:45:05,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678190220] [2021-10-13 07:45:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:05,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:05,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:05,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:05,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 07:45:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:06,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:06,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 07:45:06,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-13 07:45:06,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678190220] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:06,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:45:06,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:45:06,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230506484] [2021-10-13 07:45:06,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:06,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:06,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:06,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:06,694 INFO L87 Difference]: Start difference. First operand 3755 states and 5025 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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 07:45:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:07,611 INFO L93 Difference]: Finished difference Result 9532 states and 13008 transitions. [2021-10-13 07:45:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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 146 [2021-10-13 07:45:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:07,618 INFO L225 Difference]: With dead ends: 9532 [2021-10-13 07:45:07,618 INFO L226 Difference]: Without dead ends: 5934 [2021-10-13 07:45:07,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2021-10-13 07:45:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 5190. [2021-10-13 07:45:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 5185 states have (on average 1.2956605593056896) internal successors, (6718), 5189 states have internal predecessors, (6718), 0 states have call successors, (0), 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 07:45:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6718 transitions. [2021-10-13 07:45:08,108 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6718 transitions. Word has length 146 [2021-10-13 07:45:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:08,108 INFO L470 AbstractCegarLoop]: Abstraction has 5190 states and 6718 transitions. [2021-10-13 07:45:08,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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 07:45:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6718 transitions. [2021-10-13 07:45:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-10-13 07:45:08,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:08,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:45:08,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-13 07:45:08,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:08,325 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1435109567, now seen corresponding path program 1 times [2021-10-13 07:45:08,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:08,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911488728] [2021-10-13 07:45:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:08,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:08,487 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:08,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911488728] [2021-10-13 07:45:08,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911488728] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:45:08,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276317574] [2021-10-13 07:45:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:08,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:08,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:08,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 07:45:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:08,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 07:45:08,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:09,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:10,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276317574] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:10,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [942715987] [2021-10-13 07:45:10,116 INFO L159 IcfgInterpreter]: Started Sifa with 102 locations of interest [2021-10-13 07:45:10,116 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:45:10,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:45:10,129 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:45:10,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:45:13,215 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,226 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:45:13,227 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,228 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 07:45:13,229 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:45:13,230 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,230 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:45:13,249 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 274 [2021-10-13 07:45:13,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:13,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:13,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:13,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 07:45:13,320 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,321 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:45:13,321 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,322 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:45:13,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:45:13,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:13,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,379 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:13,394 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 248 [2021-10-13 07:45:13,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:45:13,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:245, output treesize:248 [2021-10-13 07:45:13,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:13,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:13,625 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_18| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:45:13,630 INFO L168 Benchmark]: Toolchain (without parser) took 31983.02 ms. Allocated memory was 100.7 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 68.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 851.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:13,630 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 100.7 MB. Free memory is still 56.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:45:13,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.65 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 67.9 MB in the beginning and 92.2 MB in the end (delta: -24.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:13,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.08 ms. Allocated memory is still 125.8 MB. Free memory was 92.2 MB in the beginning and 89.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:13,631 INFO L168 Benchmark]: Boogie Preprocessor took 83.98 ms. Allocated memory is still 125.8 MB. Free memory was 88.7 MB in the beginning and 85.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:13,631 INFO L168 Benchmark]: RCFGBuilder took 1411.82 ms. Allocated memory is still 125.8 MB. Free memory was 85.7 MB in the beginning and 69.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:13,632 INFO L168 Benchmark]: TraceAbstraction took 29861.78 ms. Allocated memory was 125.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 69.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 828.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:13,634 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.30 ms. Allocated memory is still 100.7 MB. Free memory is still 56.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 520.65 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 67.9 MB in the beginning and 92.2 MB in the end (delta: -24.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.08 ms. Allocated memory is still 125.8 MB. Free memory was 92.2 MB in the beginning and 89.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 83.98 ms. Allocated memory is still 125.8 MB. Free memory was 88.7 MB in the beginning and 85.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1411.82 ms. Allocated memory is still 125.8 MB. Free memory was 85.7 MB in the beginning and 69.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29861.78 ms. Allocated memory was 125.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 69.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 828.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_18| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_18|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 07:45:13,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:45:16,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:45:16,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:45:16,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:45:16,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:45:16,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:45:16,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:45:16,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:45:16,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:45:16,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:45:16,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:45:16,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:45:16,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:45:16,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:45:16,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:45:16,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:45:16,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:45:16,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:45:16,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:45:16,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:45:16,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:45:16,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:45:16,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:45:16,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:45:16,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:45:16,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:45:16,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:45:16,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:45:16,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:45:16,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:45:16,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:45:16,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:45:16,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:45:16,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:45:16,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:45:16,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:45:16,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:45:16,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:45:16,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:45:16,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:45:16,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:45:16,313 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 07:45:16,362 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:45:16,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:45:16,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:45:16,365 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:45:16,365 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:45:16,365 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:45:16,366 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:45:16,366 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:45:16,366 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:45:16,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:45:16,370 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:45:16,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:45:16,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:45:16,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:45:16,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:45:16,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:45:16,372 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:45:16,372 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:45:16,372 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:45:16,373 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:45:16,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:45:16,373 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:45:16,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:45:16,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:45:16,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:45:16,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:45:16,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:16,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:45:16,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:45:16,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:45:16,376 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:45:16,376 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:16,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:45:16,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:45:16,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:45:16,378 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> 13a2f963fb17b383a7c5451f284cefc57445bb3b [2021-10-13 07:45:16,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:45:16,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:45:16,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:45:16,793 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:45:16,794 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:45:16,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2021-10-13 07:45:16,864 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/ddc501a2b/b730703ba27842c98f15e5d29dee09df/FLAGd4e42b5cb [2021-10-13 07:45:17,388 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:45:17,389 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2021-10-13 07:45:17,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/ddc501a2b/b730703ba27842c98f15e5d29dee09df/FLAGd4e42b5cb [2021-10-13 07:45:17,688 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/data/ddc501a2b/b730703ba27842c98f15e5d29dee09df [2021-10-13 07:45:17,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:45:17,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:45:17,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:17,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:45:17,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:45:17,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:17" (1/1) ... [2021-10-13 07:45:17,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d45f449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:17, skipping insertion in model container [2021-10-13 07:45:17,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:17" (1/1) ... [2021-10-13 07:45:17,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:45:17,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:45:17,969 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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2021-10-13 07:45:18,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:18,167 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:45:18,193 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_4b1e029b-ca9b-4421-954a-bcae6ecc5883/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2021-10-13 07:45:18,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:18,344 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:45:18,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18 WrapperNode [2021-10-13 07:45:18,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:18,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:18,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:45:18,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:45:18,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:18,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:45:18,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:45:18,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:45:18,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:45:18,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:45:18,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:45:18,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:45:18,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (1/1) ... [2021-10-13 07:45:18,552 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:18,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:45:18,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:45:18,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:45:18,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:45:18,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:45:18,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:45:19,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:45:19,781 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-10-13 07:45:19,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:19 BoogieIcfgContainer [2021-10-13 07:45:19,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:45:19,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:45:19,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:45:19,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:45:19,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:17" (1/3) ... [2021-10-13 07:45:19,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396194ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:19, skipping insertion in model container [2021-10-13 07:45:19,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:18" (2/3) ... [2021-10-13 07:45:19,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396194ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:19, skipping insertion in model container [2021-10-13 07:45:19,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:19" (3/3) ... [2021-10-13 07:45:19,792 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2021-10-13 07:45:19,797 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:45:19,798 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-10-13 07:45:19,847 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:45:19,852 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 07:45:19,853 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 07:45:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 266 states have (on average 1.8646616541353382) internal successors, (496), 271 states have internal predecessors, (496), 0 states have call successors, (0), 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 07:45:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:45:19,884 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:19,885 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:19,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-10-13 07:45:19,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:19,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415734249] [2021-10-13 07:45:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:19,904 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:19,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:19,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:19,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:45:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:20,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-13 07:45:20,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:20,150 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 07:45:20,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:20,237 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 07:45:20,238 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:20,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415734249] [2021-10-13 07:45:20,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415734249] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:20,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:20,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 07:45:20,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289607993] [2021-10-13 07:45:20,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 07:45:20,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 07:45:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 07:45:20,270 INFO L87 Difference]: Start difference. First operand has 272 states, 266 states have (on average 1.8646616541353382) internal successors, (496), 271 states have internal predecessors, (496), 0 states have call successors, (0), 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 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:20,336 INFO L93 Difference]: Finished difference Result 524 states and 954 transitions. [2021-10-13 07:45:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 07:45:20,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 07:45:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:20,384 INFO L225 Difference]: With dead ends: 524 [2021-10-13 07:45:20,384 INFO L226 Difference]: Without dead ends: 268 [2021-10-13 07:45:20,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 07:45:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-10-13 07:45:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-10-13 07:45:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.752851711026616) internal successors, (461), 267 states have internal predecessors, (461), 0 states have call successors, (0), 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 07:45:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 461 transitions. [2021-10-13 07:45:20,468 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 461 transitions. Word has length 28 [2021-10-13 07:45:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:20,469 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 461 transitions. [2021-10-13 07:45:20,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 461 transitions. [2021-10-13 07:45:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:45:20,477 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:20,477 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] [2021-10-13 07:45:20,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-10-13 07:45:20,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:20,689 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:20,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1685611844, now seen corresponding path program 1 times [2021-10-13 07:45:20,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:20,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011890144] [2021-10-13 07:45:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:20,691 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:20,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:20,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:20,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:45:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:20,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:20,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:20,903 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 07:45:20,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:21,011 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 07:45:21,012 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:21,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011890144] [2021-10-13 07:45:21,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011890144] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:21,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:21,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:21,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246735107] [2021-10-13 07:45:21,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:21,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:21,021 INFO L87 Difference]: Start difference. First operand 268 states and 461 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 07:45:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:21,683 INFO L93 Difference]: Finished difference Result 889 states and 1497 transitions. [2021-10-13 07:45:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 29 [2021-10-13 07:45:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:21,694 INFO L225 Difference]: With dead ends: 889 [2021-10-13 07:45:21,694 INFO L226 Difference]: Without dead ends: 626 [2021-10-13 07:45:21,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-10-13 07:45:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 594. [2021-10-13 07:45:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 589 states have (on average 1.6146010186757216) internal successors, (951), 593 states have internal predecessors, (951), 0 states have call successors, (0), 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 07:45:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 951 transitions. [2021-10-13 07:45:21,784 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 951 transitions. Word has length 29 [2021-10-13 07:45:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:21,785 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 951 transitions. [2021-10-13 07:45:21,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 07:45:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 951 transitions. [2021-10-13 07:45:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:45:21,789 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:21,789 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 07:45:21,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:21,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:21,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 07:45:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1366485519, now seen corresponding path program 1 times [2021-10-13 07:45:22,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:22,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750434519] [2021-10-13 07:45:22,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:22,001 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:22,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:22,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:45:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:22,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:22,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:22,254 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 07:45:22,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:22,383 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 07:45:22,384 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:22,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750434519] [2021-10-13 07:45:22,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750434519] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:22,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:22,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:22,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299164800] [2021-10-13 07:45:22,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:22,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:22,389 INFO L87 Difference]: Start difference. First operand 594 states and 951 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 07:45:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:22,597 INFO L93 Difference]: Finished difference Result 1609 states and 2602 transitions. [2021-10-13 07:45:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:22,598 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 07:45:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:22,605 INFO L225 Difference]: With dead ends: 1609 [2021-10-13 07:45:22,606 INFO L226 Difference]: Without dead ends: 1029 [2021-10-13 07:45:22,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-10-13 07:45:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1013. [2021-10-13 07:45:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1008 states have (on average 1.6388888888888888) internal successors, (1652), 1012 states have internal predecessors, (1652), 0 states have call successors, (0), 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 07:45:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1652 transitions. [2021-10-13 07:45:22,662 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1652 transitions. Word has length 37 [2021-10-13 07:45:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:22,663 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1652 transitions. [2021-10-13 07:45:22,663 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 07:45:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1652 transitions. [2021-10-13 07:45:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 07:45:22,667 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:22,667 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:22,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:22,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:22,884 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash -226101542, now seen corresponding path program 1 times [2021-10-13 07:45:22,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:22,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350310407] [2021-10-13 07:45:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:22,886 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:22,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:22,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:22,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:45:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:23,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:23,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:23,137 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 07:45:23,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:23,285 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 07:45:23,286 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:23,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350310407] [2021-10-13 07:45:23,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350310407] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:23,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:23,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:23,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268349183] [2021-10-13 07:45:23,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:23,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:23,291 INFO L87 Difference]: Start difference. First operand 1013 states and 1652 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:23,396 INFO L93 Difference]: Finished difference Result 2469 states and 4013 transitions. [2021-10-13 07:45:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-13 07:45:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:23,410 INFO L225 Difference]: With dead ends: 2469 [2021-10-13 07:45:23,410 INFO L226 Difference]: Without dead ends: 1481 [2021-10-13 07:45:23,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-10-13 07:45:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1468. [2021-10-13 07:45:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1463 states have (on average 1.622693096377307) internal successors, (2374), 1467 states have internal predecessors, (2374), 0 states have call successors, (0), 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 07:45:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2374 transitions. [2021-10-13 07:45:23,510 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2374 transitions. Word has length 38 [2021-10-13 07:45:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:23,511 INFO L470 AbstractCegarLoop]: Abstraction has 1468 states and 2374 transitions. [2021-10-13 07:45:23,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2374 transitions. [2021-10-13 07:45:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:45:23,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:23,514 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, 1] [2021-10-13 07:45:23,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:23,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:23,726 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 07:45:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash 325437630, now seen corresponding path program 1 times [2021-10-13 07:45:23,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:23,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403506015] [2021-10-13 07:45:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:23,727 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:23,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:23,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:23,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:45:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:23,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:23,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:23,999 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 07:45:24,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:24,127 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 07:45:24,127 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:24,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403506015] [2021-10-13 07:45:24,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403506015] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:24,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:24,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:24,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060652939] [2021-10-13 07:45:24,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:24,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:24,135 INFO L87 Difference]: Start difference. First operand 1468 states and 2374 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 07:45:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:24,308 INFO L93 Difference]: Finished difference Result 3849 states and 6218 transitions. [2021-10-13 07:45:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 47 [2021-10-13 07:45:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:24,334 INFO L225 Difference]: With dead ends: 3849 [2021-10-13 07:45:24,334 INFO L226 Difference]: Without dead ends: 2406 [2021-10-13 07:45:24,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2021-10-13 07:45:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2294. [2021-10-13 07:45:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2289 states have (on average 1.6037570991699432) internal successors, (3671), 2293 states have internal predecessors, (3671), 0 states have call successors, (0), 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 07:45:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3671 transitions. [2021-10-13 07:45:24,481 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3671 transitions. Word has length 47 [2021-10-13 07:45:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:24,483 INFO L470 AbstractCegarLoop]: Abstraction has 2294 states and 3671 transitions. [2021-10-13 07:45:24,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 07:45:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3671 transitions. [2021-10-13 07:45:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:45:24,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:24,485 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 07:45:24,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:24,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:24,698 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 07:45:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-10-13 07:45:24,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:24,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779962132] [2021-10-13 07:45:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:24,701 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:24,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:24,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:24,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:45:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:24,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:24,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:25,044 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 07:45:25,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:25,212 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 07:45:25,212 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:25,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779962132] [2021-10-13 07:45:25,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779962132] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:25,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:25,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:25,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959328106] [2021-10-13 07:45:25,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:25,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:25,215 INFO L87 Difference]: Start difference. First operand 2294 states and 3671 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 07:45:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:25,686 INFO L93 Difference]: Finished difference Result 7795 states and 12390 transitions. [2021-10-13 07:45:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:25,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 07:45:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:25,721 INFO L225 Difference]: With dead ends: 7795 [2021-10-13 07:45:25,721 INFO L226 Difference]: Without dead ends: 5520 [2021-10-13 07:45:25,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2021-10-13 07:45:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 5334. [2021-10-13 07:45:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5334 states, 5329 states have (on average 1.5528241696378307) internal successors, (8275), 5333 states have internal predecessors, (8275), 0 states have call successors, (0), 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 07:45:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 8275 transitions. [2021-10-13 07:45:26,100 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 8275 transitions. Word has length 52 [2021-10-13 07:45:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:26,101 INFO L470 AbstractCegarLoop]: Abstraction has 5334 states and 8275 transitions. [2021-10-13 07:45:26,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 07:45:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8275 transitions. [2021-10-13 07:45:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:45:26,102 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:26,103 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 07:45:26,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-13 07:45:26,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:26,314 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-10-13 07:45:26,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:26,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839938556] [2021-10-13 07:45:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:26,316 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:26,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:26,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:26,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:45:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:26,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:26,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:26,719 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 07:45:26,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:26,857 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 07:45:26,857 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:26,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839938556] [2021-10-13 07:45:26,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839938556] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:26,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:26,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:26,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416931388] [2021-10-13 07:45:26,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:26,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:26,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:26,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:26,860 INFO L87 Difference]: Start difference. First operand 5334 states and 8275 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 07:45:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:27,249 INFO L93 Difference]: Finished difference Result 11258 states and 17439 transitions. [2021-10-13 07:45:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:27,249 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 07:45:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:27,285 INFO L225 Difference]: With dead ends: 11258 [2021-10-13 07:45:27,285 INFO L226 Difference]: Without dead ends: 5993 [2021-10-13 07:45:27,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2021-10-13 07:45:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5674. [2021-10-13 07:45:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 5669 states have (on average 1.5348385958722879) internal successors, (8701), 5673 states have internal predecessors, (8701), 0 states have call successors, (0), 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 07:45:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 8701 transitions. [2021-10-13 07:45:27,698 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 8701 transitions. Word has length 52 [2021-10-13 07:45:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:27,700 INFO L470 AbstractCegarLoop]: Abstraction has 5674 states and 8701 transitions. [2021-10-13 07:45:27,700 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 07:45:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 8701 transitions. [2021-10-13 07:45:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 07:45:27,702 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:27,703 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 07:45:27,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:27,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:27,917 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 07:45:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1801885065, now seen corresponding path program 1 times [2021-10-13 07:45:27,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:27,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712806190] [2021-10-13 07:45:27,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:27,919 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:27,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:27,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:27,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:45:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:28,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:28,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:28,227 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 07:45:28,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:28,338 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 07:45:28,338 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:28,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712806190] [2021-10-13 07:45:28,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712806190] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:28,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:28,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:28,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801699926] [2021-10-13 07:45:28,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:28,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:28,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:28,341 INFO L87 Difference]: Start difference. First operand 5674 states and 8701 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 07:45:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:29,286 INFO L93 Difference]: Finished difference Result 14484 states and 22328 transitions. [2021-10-13 07:45:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:29,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 07:45:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:29,341 INFO L225 Difference]: With dead ends: 14484 [2021-10-13 07:45:29,341 INFO L226 Difference]: Without dead ends: 8879 [2021-10-13 07:45:29,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8879 states. [2021-10-13 07:45:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8879 to 8663. [2021-10-13 07:45:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8663 states, 8658 states have (on average 1.4765534765534765) internal successors, (12784), 8662 states have internal predecessors, (12784), 0 states have call successors, (0), 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 07:45:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8663 states to 8663 states and 12784 transitions. [2021-10-13 07:45:30,062 INFO L78 Accepts]: Start accepts. Automaton has 8663 states and 12784 transitions. Word has length 58 [2021-10-13 07:45:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:30,062 INFO L470 AbstractCegarLoop]: Abstraction has 8663 states and 12784 transitions. [2021-10-13 07:45:30,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 07:45:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8663 states and 12784 transitions. [2021-10-13 07:45:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-13 07:45:30,065 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:30,066 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 07:45:30,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:30,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:30,279 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 07:45:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:30,280 INFO L82 PathProgramCache]: Analyzing trace with hash -635425216, now seen corresponding path program 1 times [2021-10-13 07:45:30,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:30,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967604434] [2021-10-13 07:45:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:30,281 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:30,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:30,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 07:45:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:30,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:30,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:30,677 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 07:45:30,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:30,852 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 07:45:30,852 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:30,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967604434] [2021-10-13 07:45:30,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967604434] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:30,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:30,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:30,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467456611] [2021-10-13 07:45:30,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:30,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:30,854 INFO L87 Difference]: Start difference. First operand 8663 states and 12784 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:45:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:31,518 INFO L93 Difference]: Finished difference Result 17180 states and 25377 transitions. [2021-10-13 07:45:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:31,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:45:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:31,555 INFO L225 Difference]: With dead ends: 17180 [2021-10-13 07:45:31,555 INFO L226 Difference]: Without dead ends: 8586 [2021-10-13 07:45:31,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8586 states. [2021-10-13 07:45:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8586 to 8514. [2021-10-13 07:45:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8514 states, 8509 states have (on average 1.4593959337172406) internal successors, (12418), 8513 states have internal predecessors, (12418), 0 states have call successors, (0), 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 07:45:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8514 states to 8514 states and 12418 transitions. [2021-10-13 07:45:32,130 INFO L78 Accepts]: Start accepts. Automaton has 8514 states and 12418 transitions. Word has length 59 [2021-10-13 07:45:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:32,132 INFO L470 AbstractCegarLoop]: Abstraction has 8514 states and 12418 transitions. [2021-10-13 07:45:32,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 07:45:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8514 states and 12418 transitions. [2021-10-13 07:45:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 07:45:32,135 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:32,135 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 07:45:32,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:32,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:32,348 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 07:45:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1524089549, now seen corresponding path program 1 times [2021-10-13 07:45:32,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:32,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936801692] [2021-10-13 07:45:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:32,349 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:32,350 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:32,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:45:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:32,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:45:32,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:32,809 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 07:45:32,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:32,995 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 07:45:32,995 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:32,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936801692] [2021-10-13 07:45:32,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936801692] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:32,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:32,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-13 07:45:32,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413797240] [2021-10-13 07:45:32,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:45:32,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:45:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:45:32,997 INFO L87 Difference]: Start difference. First operand 8514 states and 12418 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:45:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:35,462 INFO L93 Difference]: Finished difference Result 47631 states and 69168 transitions. [2021-10-13 07:45:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 07:45:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:45:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:35,595 INFO L225 Difference]: With dead ends: 47631 [2021-10-13 07:45:35,595 INFO L226 Difference]: Without dead ends: 39471 [2021-10-13 07:45:35,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-10-13 07:45:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39471 states. [2021-10-13 07:45:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39471 to 11127. [2021-10-13 07:45:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11127 states, 11122 states have (on average 1.445423484984715) internal successors, (16076), 11126 states have internal predecessors, (16076), 0 states have call successors, (0), 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 07:45:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11127 states to 11127 states and 16076 transitions. [2021-10-13 07:45:36,734 INFO L78 Accepts]: Start accepts. Automaton has 11127 states and 16076 transitions. Word has length 62 [2021-10-13 07:45:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:36,735 INFO L470 AbstractCegarLoop]: Abstraction has 11127 states and 16076 transitions. [2021-10-13 07:45:36,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 07:45:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 11127 states and 16076 transitions. [2021-10-13 07:45:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 07:45:36,738 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:36,738 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:36,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:36,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:36,951 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 07:45:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 21161543, now seen corresponding path program 1 times [2021-10-13 07:45:36,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:36,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782650905] [2021-10-13 07:45:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:36,953 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:36,954 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:36,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 07:45:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:37,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:45:37,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:37,467 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 07:45:37,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:37,734 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 07:45:37,734 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:37,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782650905] [2021-10-13 07:45:37,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782650905] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:37,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:37,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-10-13 07:45:37,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550878388] [2021-10-13 07:45:37,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:45:37,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:45:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:37,737 INFO L87 Difference]: Start difference. First operand 11127 states and 16076 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:40,737 INFO L93 Difference]: Finished difference Result 47199 states and 68624 transitions. [2021-10-13 07:45:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-13 07:45:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-13 07:45:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:40,844 INFO L225 Difference]: With dead ends: 47199 [2021-10-13 07:45:40,844 INFO L226 Difference]: Without dead ends: 36093 [2021-10-13 07:45:40,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 191.7ms TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:45:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36093 states. [2021-10-13 07:45:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36093 to 7402. [2021-10-13 07:45:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 7397 states have (on average 1.4365283222928213) internal successors, (10626), 7401 states have internal predecessors, (10626), 0 states have call successors, (0), 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 07:45:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 10626 transitions. [2021-10-13 07:45:41,935 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 10626 transitions. Word has length 63 [2021-10-13 07:45:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:41,936 INFO L470 AbstractCegarLoop]: Abstraction has 7402 states and 10626 transitions. [2021-10-13 07:45:41,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 10626 transitions. [2021-10-13 07:45:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 07:45:41,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:41,944 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 07:45:41,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:42,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:42,156 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 07:45:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash -120422989, now seen corresponding path program 1 times [2021-10-13 07:45:42,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:42,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528595425] [2021-10-13 07:45:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:42,158 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:42,159 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:42,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 07:45:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:42,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:42,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:42,629 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 07:45:42,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:42,823 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 07:45:42,823 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:42,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528595425] [2021-10-13 07:45:42,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528595425] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:42,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:42,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:42,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474202259] [2021-10-13 07:45:42,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:42,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:42,826 INFO L87 Difference]: Start difference. First operand 7402 states and 10626 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 07:45:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:43,807 INFO L93 Difference]: Finished difference Result 23028 states and 32737 transitions. [2021-10-13 07:45:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 07:45:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:43,843 INFO L225 Difference]: With dead ends: 23028 [2021-10-13 07:45:43,843 INFO L226 Difference]: Without dead ends: 15385 [2021-10-13 07:45:43,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15385 states. [2021-10-13 07:45:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15385 to 10337. [2021-10-13 07:45:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10337 states, 10332 states have (on average 1.4050522648083623) internal successors, (14517), 10336 states have internal predecessors, (14517), 0 states have call successors, (0), 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 07:45:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10337 states to 10337 states and 14517 transitions. [2021-10-13 07:45:45,024 INFO L78 Accepts]: Start accepts. Automaton has 10337 states and 14517 transitions. Word has length 88 [2021-10-13 07:45:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:45,025 INFO L470 AbstractCegarLoop]: Abstraction has 10337 states and 14517 transitions. [2021-10-13 07:45:45,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 07:45:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10337 states and 14517 transitions. [2021-10-13 07:45:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 07:45:45,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:45,028 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 07:45:45,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-10-13 07:45:45,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:45,247 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 07:45:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1916611, now seen corresponding path program 1 times [2021-10-13 07:45:45,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:45,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526404708] [2021-10-13 07:45:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:45,248 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:45,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:45,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:45,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 07:45:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:45,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:45,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:45,833 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 07:45:45,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:46,048 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 07:45:46,048 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:46,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526404708] [2021-10-13 07:45:46,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526404708] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:46,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:46,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:46,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631908225] [2021-10-13 07:45:46,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:46,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:46,050 INFO L87 Difference]: Start difference. First operand 10337 states and 14517 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 07:45:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:46,483 INFO L93 Difference]: Finished difference Result 14802 states and 20858 transitions. [2021-10-13 07:45:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 07:45:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:46,491 INFO L225 Difference]: With dead ends: 14802 [2021-10-13 07:45:46,492 INFO L226 Difference]: Without dead ends: 4402 [2021-10-13 07:45:46,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2021-10-13 07:45:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4334. [2021-10-13 07:45:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 4329 states have (on average 1.3123123123123124) internal successors, (5681), 4333 states have internal predecessors, (5681), 0 states have call successors, (0), 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 07:45:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 5681 transitions. [2021-10-13 07:45:46,888 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 5681 transitions. Word has length 95 [2021-10-13 07:45:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:46,888 INFO L470 AbstractCegarLoop]: Abstraction has 4334 states and 5681 transitions. [2021-10-13 07:45:46,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 07:45:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 5681 transitions. [2021-10-13 07:45:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 07:45:46,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:46,891 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 07:45:46,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:47,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:47,104 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 07:45:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash -126414573, now seen corresponding path program 1 times [2021-10-13 07:45:47,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:47,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884612400] [2021-10-13 07:45:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:47,105 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:47,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:47,106 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:47,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 07:45:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:47,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:47,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:47,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:48,038 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 07:45:48,038 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:48,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884612400] [2021-10-13 07:45:48,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884612400] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:48,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:48,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:48,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375600196] [2021-10-13 07:45:48,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:48,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:48,040 INFO L87 Difference]: Start difference. First operand 4334 states and 5681 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 07:45:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:48,359 INFO L93 Difference]: Finished difference Result 7746 states and 10197 transitions. [2021-10-13 07:45:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:48,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 07:45:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:48,366 INFO L225 Difference]: With dead ends: 7746 [2021-10-13 07:45:48,366 INFO L226 Difference]: Without dead ends: 3423 [2021-10-13 07:45:48,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2021-10-13 07:45:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3143. [2021-10-13 07:45:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 3138 states have (on average 1.2855321861057998) internal successors, (4034), 3142 states have internal predecessors, (4034), 0 states have call successors, (0), 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 07:45:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4034 transitions. [2021-10-13 07:45:48,748 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4034 transitions. Word has length 100 [2021-10-13 07:45:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:48,749 INFO L470 AbstractCegarLoop]: Abstraction has 3143 states and 4034 transitions. [2021-10-13 07:45:48,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 07:45:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4034 transitions. [2021-10-13 07:45:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 07:45:48,751 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:48,751 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, 1] [2021-10-13 07:45:48,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:48,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:48,961 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 07:45:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 377900517, now seen corresponding path program 1 times [2021-10-13 07:45:48,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:48,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241339913] [2021-10-13 07:45:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:48,962 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:48,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:48,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-13 07:45:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:49,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:49,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:49,649 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 07:45:49,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:49,920 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 07:45:49,921 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:49,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241339913] [2021-10-13 07:45:49,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241339913] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:49,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:49,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:49,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602177676] [2021-10-13 07:45:49,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:49,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:49,923 INFO L87 Difference]: Start difference. First operand 3143 states and 4034 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:50,293 INFO L93 Difference]: Finished difference Result 5978 states and 7686 transitions. [2021-10-13 07:45:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:50,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-13 07:45:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:50,297 INFO L225 Difference]: With dead ends: 5978 [2021-10-13 07:45:50,297 INFO L226 Difference]: Without dead ends: 3004 [2021-10-13 07:45:50,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2021-10-13 07:45:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2960. [2021-10-13 07:45:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2960 states, 2955 states have (on average 1.27005076142132) internal successors, (3753), 2959 states have internal predecessors, (3753), 0 states have call successors, (0), 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 07:45:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3753 transitions. [2021-10-13 07:45:50,627 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3753 transitions. Word has length 101 [2021-10-13 07:45:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:50,628 INFO L470 AbstractCegarLoop]: Abstraction has 2960 states and 3753 transitions. [2021-10-13 07:45:50,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:45:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3753 transitions. [2021-10-13 07:45:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-13 07:45:50,632 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:50,632 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:50,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:50,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:50,859 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash 114274644, now seen corresponding path program 1 times [2021-10-13 07:45:50,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:50,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415675263] [2021-10-13 07:45:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:50,860 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:50,862 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:50,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-13 07:45:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:51,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:45:51,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:51,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:52,286 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:52,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415675263] [2021-10-13 07:45:52,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415675263] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:52,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1174358893] [2021-10-13 07:45:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:52,287 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:45:52,294 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:45:52,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2021-10-13 07:45:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:53,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:45:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:53,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:53,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1174358893] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:53,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519426346] [2021-10-13 07:45:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:53,979 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:53,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:53,981 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:53,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-13 07:45:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:54,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:45:54,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:55,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:45:55,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519426346] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:55,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:45:55,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 9 [2021-10-13 07:45:55,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573496112] [2021-10-13 07:45:55,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:45:55,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:45:55,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:45:55,638 INFO L87 Difference]: Start difference. First operand 2960 states and 3753 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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 07:45:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:57,422 INFO L93 Difference]: Finished difference Result 14274 states and 18210 transitions. [2021-10-13 07:45:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-13 07:45:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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 159 [2021-10-13 07:45:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:57,436 INFO L225 Difference]: With dead ends: 14274 [2021-10-13 07:45:57,436 INFO L226 Difference]: Without dead ends: 11483 [2021-10-13 07:45:57,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 955 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 277.2ms TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 07:45:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2021-10-13 07:45:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 4322. [2021-10-13 07:45:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 4317 states have (on average 1.2763493166550846) internal successors, (5510), 4321 states have internal predecessors, (5510), 0 states have call successors, (0), 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 07:45:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 5510 transitions. [2021-10-13 07:45:57,910 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 5510 transitions. Word has length 159 [2021-10-13 07:45:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:57,910 INFO L470 AbstractCegarLoop]: Abstraction has 4322 states and 5510 transitions. [2021-10-13 07:45:57,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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 07:45:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 5510 transitions. [2021-10-13 07:45:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-10-13 07:45:57,916 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:57,917 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:57,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:58,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:58,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2021-10-13 07:45:58,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:58,531 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:45:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1253383823, now seen corresponding path program 1 times [2021-10-13 07:45:58,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:58,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621835665] [2021-10-13 07:45:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:58,532 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:58,534 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:58,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-13 07:45:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:59,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 07:45:59,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 99 proven. 103 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:45:59,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 99 proven. 103 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:46:00,834 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:00,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621835665] [2021-10-13 07:46:00,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621835665] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:00,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1699066943] [2021-10-13 07:46:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:00,834 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:46:00,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:46:00,835 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:46:00,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-10-13 07:46:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:02,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 07:46:02,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 99 proven. 103 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:46:02,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 99 proven. 103 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:46:03,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1699066943] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:03,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286576449] [2021-10-13 07:46:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:03,688 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:46:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:46:03,693 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:46:03,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-10-13 07:46:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:04,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:46:04,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 99 proven. 107 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:46:05,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:46:07,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286576449] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 07:46:07,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 5 imperfect interpolant sequences. [2021-10-13 07:46:07,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 7, 7, 7, 12] total 22 [2021-10-13 07:46:07,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471709923] [2021-10-13 07:46:07,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:46:07,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:07,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:46:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-10-13 07:46:07,155 INFO L87 Difference]: Start difference. First operand 4322 states and 5510 transitions. Second operand has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 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 07:46:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:09,786 INFO L93 Difference]: Finished difference Result 14264 states and 18040 transitions. [2021-10-13 07:46:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-13 07:46:09,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 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 257 [2021-10-13 07:46:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:09,799 INFO L225 Difference]: With dead ends: 14264 [2021-10-13 07:46:09,799 INFO L226 Difference]: Without dead ends: 10111 [2021-10-13 07:46:09,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1571 GetRequests, 1531 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1241.8ms TimeCoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 07:46:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10111 states. [2021-10-13 07:46:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10111 to 4420. [2021-10-13 07:46:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 4415 states have (on average 1.2720271800679501) internal successors, (5616), 4419 states have internal predecessors, (5616), 0 states have call successors, (0), 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 07:46:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 5616 transitions. [2021-10-13 07:46:10,291 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 5616 transitions. Word has length 257 [2021-10-13 07:46:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:10,292 INFO L470 AbstractCegarLoop]: Abstraction has 4420 states and 5616 transitions. [2021-10-13 07:46:10,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 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 07:46:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 5616 transitions. [2021-10-13 07:46:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-10-13 07:46:10,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:10,297 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:10,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:10,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2021-10-13 07:46:10,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-10-13 07:46:10,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:10,925 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 07:46:10,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1467549623, now seen corresponding path program 1 times [2021-10-13 07:46:10,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:10,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650643181] [2021-10-13 07:46:10,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:10,926 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:10,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:10,927 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:10,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-13 07:46:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:12,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:46:12,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-13 07:46:12,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-13 07:46:13,072 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:13,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650643181] [2021-10-13 07:46:13,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650643181] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:46:13,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:46:13,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:46:13,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659965008] [2021-10-13 07:46:13,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:46:13,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:46:13,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:13,075 INFO L87 Difference]: Start difference. First operand 4420 states and 5616 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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 07:46:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:13,370 INFO L93 Difference]: Finished difference Result 5345 states and 6740 transitions. [2021-10-13 07:46:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:46:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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 257 [2021-10-13 07:46:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:13,372 INFO L225 Difference]: With dead ends: 5345 [2021-10-13 07:46:13,373 INFO L226 Difference]: Without dead ends: 913 [2021-10-13 07:46:13,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:46:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-10-13 07:46:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 733. [2021-10-13 07:46:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 730 states have (on average 1.0753424657534247) internal successors, (785), 732 states have internal predecessors, (785), 0 states have call successors, (0), 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 07:46:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 785 transitions. [2021-10-13 07:46:13,471 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 785 transitions. Word has length 257 [2021-10-13 07:46:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:13,471 INFO L470 AbstractCegarLoop]: Abstraction has 733 states and 785 transitions. [2021-10-13 07:46:13,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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 07:46:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 785 transitions. [2021-10-13 07:46:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-10-13 07:46:13,475 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:13,476 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:13,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-10-13 07:46:13,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:13,689 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:46:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1838022629, now seen corresponding path program 1 times [2021-10-13 07:46:13,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:13,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501332629] [2021-10-13 07:46:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:13,690 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:13,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:13,690 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:13,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-10-13 07:46:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:14,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:46:14,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-13 07:46:15,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-13 07:46:15,991 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:15,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501332629] [2021-10-13 07:46:15,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501332629] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:46:15,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:46:15,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-10-13 07:46:15,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302682733] [2021-10-13 07:46:15,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:46:15,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:46:15,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:46:15,993 INFO L87 Difference]: Start difference. First operand 733 states and 785 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 07:46:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:16,443 INFO L93 Difference]: Finished difference Result 1856 states and 2013 transitions. [2021-10-13 07:46:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 07:46:16,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 259 [2021-10-13 07:46:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:16,446 INFO L225 Difference]: With dead ends: 1856 [2021-10-13 07:46:16,446 INFO L226 Difference]: Without dead ends: 1659 [2021-10-13 07:46:16,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-13 07:46:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2021-10-13 07:46:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 799. [2021-10-13 07:46:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 796 states have (on average 1.0778894472361809) internal successors, (858), 798 states have internal predecessors, (858), 0 states have call successors, (0), 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 07:46:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 858 transitions. [2021-10-13 07:46:16,552 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 858 transitions. Word has length 259 [2021-10-13 07:46:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:16,553 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 858 transitions. [2021-10-13 07:46:16,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 07:46:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 858 transitions. [2021-10-13 07:46:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2021-10-13 07:46:16,555 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:16,555 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:16,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:16,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:16,756 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:46:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1163152431, now seen corresponding path program 1 times [2021-10-13 07:46:16,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:16,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634427430] [2021-10-13 07:46:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:16,757 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:16,758 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:16,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-10-13 07:46:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:18,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:46:18,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-13 07:46:18,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-13 07:46:18,979 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:18,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634427430] [2021-10-13 07:46:18,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634427430] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:46:18,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:46:18,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-13 07:46:18,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727855207] [2021-10-13 07:46:18,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:46:18,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:46:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:46:18,981 INFO L87 Difference]: Start difference. First operand 799 states and 858 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 07:46:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:19,202 INFO L93 Difference]: Finished difference Result 1162 states and 1256 transitions. [2021-10-13 07:46:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:46:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 260 [2021-10-13 07:46:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:19,204 INFO L225 Difference]: With dead ends: 1162 [2021-10-13 07:46:19,204 INFO L226 Difference]: Without dead ends: 965 [2021-10-13 07:46:19,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:46:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-10-13 07:46:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 789. [2021-10-13 07:46:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 787 states have (on average 1.0660736975857688) internal successors, (839), 788 states have internal predecessors, (839), 0 states have call successors, (0), 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 07:46:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 839 transitions. [2021-10-13 07:46:19,299 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 839 transitions. Word has length 260 [2021-10-13 07:46:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:19,300 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 839 transitions. [2021-10-13 07:46:19,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 07:46:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 839 transitions. [2021-10-13 07:46:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2021-10-13 07:46:19,302 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:19,302 INFO L512 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:19,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:19,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:46:19,503 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:46:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1173960251, now seen corresponding path program 1 times [2021-10-13 07:46:19,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:19,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182427388] [2021-10-13 07:46:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:19,506 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:19,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:19,507 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:19,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-10-13 07:46:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:20,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:46:20,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 07:46:22,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 15 proven. 143 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 07:46:23,681 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:23,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182427388] [2021-10-13 07:46:23,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182427388] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:23,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [683588968] [2021-10-13 07:46:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:23,682 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:46:23,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:46:23,683 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:46:23,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2021-10-13 07:46:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:25,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:46:25,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 07:46:27,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 15 proven. 143 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 07:46:28,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [683588968] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:28,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058756046] [2021-10-13 07:46:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:28,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:46:28,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:46:28,397 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:46:28,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-10-13 07:46:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:30,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:46:30,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 07:46:32,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 15 proven. 143 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 07:46:33,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058756046] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:33,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:46:33,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 17, 17, 17] total 26 [2021-10-13 07:46:33,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041042966] [2021-10-13 07:46:33,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-13 07:46:33,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:33,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-13 07:46:33,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:46:33,125 INFO L87 Difference]: Start difference. First operand 789 states and 839 transitions. Second operand has 26 states, 26 states have (on average 14.23076923076923) internal successors, (370), 26 states have internal predecessors, (370), 0 states have call successors, (0), 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 07:46:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:34,355 INFO L93 Difference]: Finished difference Result 1221 states and 1300 transitions. [2021-10-13 07:46:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-13 07:46:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 14.23076923076923) internal successors, (370), 26 states have internal predecessors, (370), 0 states have call successors, (0), 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 318 [2021-10-13 07:46:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:34,357 INFO L225 Difference]: With dead ends: 1221 [2021-10-13 07:46:34,357 INFO L226 Difference]: Without dead ends: 1219 [2021-10-13 07:46:34,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1935 GetRequests, 1887 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1020.7ms TimeCoverageRelationStatistics Valid=364, Invalid=2086, Unknown=0, NotChecked=0, Total=2450 [2021-10-13 07:46:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2021-10-13 07:46:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 887. [2021-10-13 07:46:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.0632768361581921) internal successors, (941), 886 states have internal predecessors, (941), 0 states have call successors, (0), 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 07:46:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 941 transitions. [2021-10-13 07:46:34,500 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 941 transitions. Word has length 318 [2021-10-13 07:46:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:34,501 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 941 transitions. [2021-10-13 07:46:34,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.23076923076923) internal successors, (370), 26 states have internal predecessors, (370), 0 states have call successors, (0), 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 07:46:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 941 transitions. [2021-10-13 07:46:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-10-13 07:46:34,505 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:34,506 INFO L512 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:34,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:34,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:34,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:35,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:46:35,133 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:46:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1814260282, now seen corresponding path program 1 times [2021-10-13 07:46:35,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:35,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170915432] [2021-10-13 07:46:35,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:35,135 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:35,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:35,136 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:35,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-10-13 07:46:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:37,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:46:37,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:46:37,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:46:38,793 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:38,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170915432] [2021-10-13 07:46:38,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170915432] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:38,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1093917744] [2021-10-13 07:46:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:38,794 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:46:38,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:46:38,801 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:46:38,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-10-13 07:46:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:42,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:46:42,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:46:43,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:46:43,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1093917744] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:43,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738889120] [2021-10-13 07:46:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:43,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:46:43,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:46:43,832 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:46:43,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-10-13 07:46:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:46,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:46:46,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:46:47,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:46:48,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738889120] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:48,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:46:48,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 9 [2021-10-13 07:46:48,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533344706] [2021-10-13 07:46:48,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:46:48,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:46:48,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:46:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:46:48,165 INFO L87 Difference]: Start difference. First operand 887 states and 941 transitions. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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 07:46:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:46:48,827 INFO L93 Difference]: Finished difference Result 1724 states and 1839 transitions. [2021-10-13 07:46:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 07:46:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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 364 [2021-10-13 07:46:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:46:48,830 INFO L225 Difference]: With dead ends: 1724 [2021-10-13 07:46:48,830 INFO L226 Difference]: Without dead ends: 1537 [2021-10-13 07:46:48,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2196 GetRequests, 2179 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 133.5ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-13 07:46:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2021-10-13 07:46:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 972. [2021-10-13 07:46:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 970 states have (on average 1.0628865979381443) internal successors, (1031), 971 states have internal predecessors, (1031), 0 states have call successors, (0), 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 07:46:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1031 transitions. [2021-10-13 07:46:49,024 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1031 transitions. Word has length 364 [2021-10-13 07:46:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:46:49,024 INFO L470 AbstractCegarLoop]: Abstraction has 972 states and 1031 transitions. [2021-10-13 07:46:49,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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 07:46:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1031 transitions. [2021-10-13 07:46:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2021-10-13 07:46:49,029 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:46:49,029 INFO L512 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:46:49,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2021-10-13 07:46:49,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-10-13 07:46:49,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-10-13 07:46:49,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:46:49,640 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:46:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:46:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash -73771068, now seen corresponding path program 1 times [2021-10-13 07:46:49,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:46:49,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944286046] [2021-10-13 07:46:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:49,642 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:46:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:46:49,642 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:46:49,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-10-13 07:46:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:46:52,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 07:46:52,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:46:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:46:54,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:46:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 20 proven. 398 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:46:56,075 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:46:56,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944286046] [2021-10-13 07:46:56,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944286046] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:46:56,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [291301634] [2021-10-13 07:46:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:46:56,076 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:46:56,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:46:56,077 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:46:56,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-10-13 07:47:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:00,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 07:47:00,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:47:02,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 20 proven. 398 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:47:03,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [291301634] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:47:03,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999991015] [2021-10-13 07:47:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:03,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:47:03,494 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:47:03,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-10-13 07:47:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:07,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 34 conjunts are in the unsatisfiable core [2021-10-13 07:47:07,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:47:10,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 199 proven. 211 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 07:47:13,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999991015] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:47:13,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:47:13,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21, 21, 24, 21] total 52 [2021-10-13 07:47:13,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585318087] [2021-10-13 07:47:13,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-10-13 07:47:13,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:47:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-10-13 07:47:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2444, Unknown=0, NotChecked=0, Total=2652 [2021-10-13 07:47:13,196 INFO L87 Difference]: Start difference. First operand 972 states and 1031 transitions. Second operand has 52 states, 52 states have (on average 19.0) internal successors, (988), 52 states have internal predecessors, (988), 0 states have call successors, (0), 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 07:47:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:20,421 INFO L93 Difference]: Finished difference Result 1652 states and 1754 transitions. [2021-10-13 07:47:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-10-13 07:47:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 19.0) internal successors, (988), 52 states have internal predecessors, (988), 0 states have call successors, (0), 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 424 [2021-10-13 07:47:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:20,426 INFO L225 Difference]: With dead ends: 1652 [2021-10-13 07:47:20,426 INFO L226 Difference]: Without dead ends: 1650 [2021-10-13 07:47:20,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2650 GetRequests, 2530 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3706 ImplicationChecksByTransitivity, 6486.6ms TimeCoverageRelationStatistics Valid=1879, Invalid=12883, Unknown=0, NotChecked=0, Total=14762 [2021-10-13 07:47:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2021-10-13 07:47:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1070. [2021-10-13 07:47:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1068 states have (on average 1.0608614232209739) internal successors, (1133), 1069 states have internal predecessors, (1133), 0 states have call successors, (0), 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 07:47:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1133 transitions. [2021-10-13 07:47:20,809 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1133 transitions. Word has length 424 [2021-10-13 07:47:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:20,809 INFO L470 AbstractCegarLoop]: Abstraction has 1070 states and 1133 transitions. [2021-10-13 07:47:20,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 19.0) internal successors, (988), 52 states have internal predecessors, (988), 0 states have call successors, (0), 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 07:47:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1133 transitions. [2021-10-13 07:47:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2021-10-13 07:47:20,813 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:47:20,814 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 07:47:20,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:21,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:21,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:21,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:21,416 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:47:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:47:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash 808735225, now seen corresponding path program 1 times [2021-10-13 07:47:21,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:47:21,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244875733] [2021-10-13 07:47:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:21,418 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:47:21,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:47:21,419 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:47:21,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-10-13 07:47:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:24,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 07:47:24,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 318 proven. 116 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-10-13 07:47:25,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 318 proven. 116 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-10-13 07:47:26,998 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:47:26,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244875733] [2021-10-13 07:47:26,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244875733] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:47:26,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [334088324] [2021-10-13 07:47:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:26,999 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:47:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:47:27,000 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:47:27,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-10-13 07:47:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:31,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 07:47:31,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 318 proven. 116 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-10-13 07:47:33,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 318 proven. 116 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-10-13 07:47:34,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [334088324] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:47:34,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949367970] [2021-10-13 07:47:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:47:34,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:47:34,351 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:47:34,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-10-13 07:47:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:47:39,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:47:39,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:47:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 318 proven. 120 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-13 07:47:40,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:47:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-10-13 07:47:41,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949367970] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 07:47:41,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 5 imperfect interpolant sequences. [2021-10-13 07:47:41,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 7, 7, 7, 12] total 22 [2021-10-13 07:47:41,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896358517] [2021-10-13 07:47:41,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:47:41,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:47:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:47:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-10-13 07:47:41,968 INFO L87 Difference]: Start difference. First operand 1070 states and 1133 transitions. Second operand has 10 states, 10 states have (on average 33.8) internal successors, (338), 10 states have internal predecessors, (338), 0 states have call successors, (0), 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 07:47:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:47:43,080 INFO L93 Difference]: Finished difference Result 1407 states and 1492 transitions. [2021-10-13 07:47:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 07:47:43,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 33.8) internal successors, (338), 10 states have internal predecessors, (338), 0 states have call successors, (0), 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 470 [2021-10-13 07:47:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:47:43,081 INFO L225 Difference]: With dead ends: 1407 [2021-10-13 07:47:43,081 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:47:43,083 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2835 GetRequests, 2801 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 909.7ms TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 07:47:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:47:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:47:43,083 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 07:47:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:47:43,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 470 [2021-10-13 07:47:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:47:43,085 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:47:43,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.8) internal successors, (338), 10 states have internal predecessors, (338), 0 states have call successors, (0), 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 07:47:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:47:43,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:47:43,088 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:47:43,089 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:47:43,089 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:47:43,089 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:47:43,089 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:47:43,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:43,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:43,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-10-13 07:47:43,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:47:43,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:47:43,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:44,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:44,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:45,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:45,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:45,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:47,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:47,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:47,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:47,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:47,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:47,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:48,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:48,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:48,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:48,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:48,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:48,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:49,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:49,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:49,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:49,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:49,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:49,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:50,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:51,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:52,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:53,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:53,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:54,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:55,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:56,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:57,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:47:59,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:00,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:01,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:01,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:03,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:03,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:03,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:03,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:03,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:03,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:04,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:05,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:05,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:05,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:06,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:07,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:07,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:48:07,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:49:01,063 WARN L207 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 419 DAG size of output: 124 [2021-10-13 07:49:10,847 WARN L207 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 397 DAG size of output: 117 [2021-10-13 07:49:34,380 WARN L207 SmtUtils]: Spent 8.56 s on a formula simplification. DAG size of input: 658 DAG size of output: 149 [2021-10-13 07:49:51,302 WARN L207 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 558 DAG size of output: 152 [2021-10-13 07:50:23,024 INFO L857 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2021-10-13 07:50:23,024 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,025 INFO L857 garLoopResultBuilder]: For program point L696(lines 696 700) no Hoare annotation was computed. [2021-10-13 07:50:23,025 INFO L853 garLoopResultBuilder]: At program point L1291(lines 1284 1310) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,026 INFO L853 garLoopResultBuilder]: At program point L234(lines 227 262) the Hoare annotation is: (let ((.cse17 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (= ~m_run_pc~0 (_ bv0 32)))) (let ((.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (or (and .cse17 .cse15) (and .cse15 .cse16))) (.cse9 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (let ((.cse14 (= ~s_run_pc~0 (_ bv0 32)))) (or (and .cse14 .cse15 .cse16) (and .cse17 .cse14 .cse15)))) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse5 (= ~c_req_type~0 (_ bv1 32))) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse11 .cse12 .cse13) (and .cse8 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse3 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse10 .cse11 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse12 (= ~s_memory0~0 (_ bv50 32))) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse12 .cse13)))) [2021-10-13 07:50:23,026 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 126) no Hoare annotation was computed. [2021-10-13 07:50:23,026 INFO L857 garLoopResultBuilder]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2021-10-13 07:50:23,026 INFO L853 garLoopResultBuilder]: At program point L103(lines 98 840) the Hoare annotation is: false [2021-10-13 07:50:23,027 INFO L853 garLoopResultBuilder]: At program point L434(lines 427 453) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse8) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse8 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,027 INFO L857 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2021-10-13 07:50:23,027 INFO L857 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2021-10-13 07:50:23,027 INFO L857 garLoopResultBuilder]: For program point L963(lines 963 967) no Hoare annotation was computed. [2021-10-13 07:50:23,027 INFO L853 garLoopResultBuilder]: At program point L171(lines 141 172) the Hoare annotation is: (let ((.cse8 (= ~s_run_pc~0 (_ bv0 32))) (.cse11 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (not (= ~c_m_lock~0 (_ bv1 32)))) (.cse12 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse13 (= (_ bv0 32) ~a_t~0)) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse10 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) .cse12 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (= (_ bv3 32) ~m_run_pc~0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse13 (not (= ~c_req_a~0 (_ bv1 32))) (= ~c_req_d~0 (_ bv50 32)) (= ~s_memory0~0 (_ bv50 32)) .cse9) (and .cse14 .cse0 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse14 .cse0 .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9 .cse10))) [2021-10-13 07:50:23,028 INFO L857 garLoopResultBuilder]: For program point L105(lines 105 125) no Hoare annotation was computed. [2021-10-13 07:50:23,028 INFO L857 garLoopResultBuilder]: For program point L1030(lines 1030 1083) no Hoare annotation was computed. [2021-10-13 07:50:23,028 INFO L853 garLoopResultBuilder]: At program point L568(lines 561 614) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv6 32) ~m_run_pc~0) .cse8 .cse9 (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse10 .cse11) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse4 .cse5 .cse6 (= (_ bv3 32) ~m_run_pc~0) .cse7 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse10 .cse11))) [2021-10-13 07:50:23,028 INFO L857 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-10-13 07:50:23,028 INFO L853 garLoopResultBuilder]: At program point L106(lines 98 840) the Hoare annotation is: false [2021-10-13 07:50:23,028 INFO L857 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2021-10-13 07:50:23,029 INFO L853 garLoopResultBuilder]: At program point L635-2(lines 635 663) the Hoare annotation is: (let ((.cse14 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse12 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32))) (.cse15 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (.cse16 (not .cse24)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~a_t~0)) (.cse20 (or (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse14)) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse23 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32))) (.cse13 (= ~s_memory0~0 (_ bv50 32))) (.cse22 (not (= (_ bv4 32) ~m_run_pc~0))) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse15) (and (or .cse16 .cse14) (let ((.cse17 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0))) (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= ~c_req_a~0 ~req_tt_a~0) .cse17 .cse12 .cse13 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse10 .cse11 .cse19 .cse17 .cse12 .cse13 .cse18))) .cse15 .cse20) (and .cse0 .cse2 .cse6 .cse8 .cse11 .cse21 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse19 (not (= ~c_req_a~0 (_ bv1 32))) .cse23 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)) .cse20) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse24 .cse23 .cse13 .cse18 .cse22) (and .cse0 .cse2 .cse6 .cse8 .cse10 .cse11 .cse18) (and .cse0 .cse2 .cse6 .cse8 .cse9 .cse10 (= ~c_m_lock~0 (_ bv0 32)) .cse18)))) [2021-10-13 07:50:23,029 INFO L853 garLoopResultBuilder]: At program point L768(lines 761 805) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,030 INFO L853 garLoopResultBuilder]: At program point L702(lines 695 721) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,030 INFO L857 garLoopResultBuilder]: For program point L636(lines 635 663) no Hoare annotation was computed. [2021-10-13 07:50:23,030 INFO L857 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2021-10-13 07:50:23,030 INFO L857 garLoopResultBuilder]: For program point L108(lines 108 124) no Hoare annotation was computed. [2021-10-13 07:50:23,031 INFO L853 garLoopResultBuilder]: At program point L901(lines 875 902) the Hoare annotation is: (let ((.cse20 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse21 (not .cse20))) (let ((.cse10 (or .cse21 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse11 (or .cse21 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse14 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse15 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse16 (= ~c_req_type~0 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse17 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse18 (= (_ bv0 32) ~a_t~0)) (.cse19 (= ~c_req_d~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse6 .cse15 .cse7 .cse16 .cse9 .cse17 .cse18 .cse19 .cse13) (and .cse0 .cse2 (not .cse1) .cse6 .cse15 .cse7 .cse20 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse16 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13) (and .cse14 .cse2 .cse6 .cse15 .cse7 .cse16 .cse9 .cse17 (= ~s_run_pc~0 (_ bv0 32)) .cse18 .cse19 .cse13))))) [2021-10-13 07:50:23,031 INFO L857 garLoopResultBuilder]: For program point L637(lines 637 641) no Hoare annotation was computed. [2021-10-13 07:50:23,031 INFO L853 garLoopResultBuilder]: At program point L109(lines 98 840) the Hoare annotation is: (let ((.cse23 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse22 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse19 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse20 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v))) (let ((.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse14 (= (_ bv0 32) ~a_t~0)) (.cse16 (= ~c_req_d~0 (_ bv50 32))) (.cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse21 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse11 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse12 (or (not .cse19) .cse20)) (.cse13 (= ~c_m_lock~0 (_ bv1 32))) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse24 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse18 (or (not .cse23) .cse22)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse8 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 .cse18) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse13 .cse5 .cse14 .cse16 .cse6) (and .cse7 .cse19 .cse1 (= ~s_memory1~0 (_ bv51 32)) .cse20 .cse8 .cse2 .cse3 .cse15 .cse10 .cse21 .cse13 .cse22 .cse23 .cse17 .cse24) (and .cse7 .cse0 .cse8 .cse2 .cse3 .cse4 .cse13 .cse14 .cse16 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse3 .cse15 .cse21 .cse4 .cse11 .cse12 .cse13 .cse17 .cse6 .cse24 .cse18) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse6)))) [2021-10-13 07:50:23,031 INFO L853 garLoopResultBuilder]: At program point L175-2(lines 175 203) the Hoare annotation is: (let ((.cse12 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse9 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse6 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse7 (= (_ bv0 32) ~a_t~0)) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse13 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) .cse2 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (= (_ bv3 32) ~m_run_pc~0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse6 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse7 (not (= ~c_req_a~0 (_ bv1 32))) (= ~c_req_d~0 (_ bv50 32)) (= ~s_memory0~0 (_ bv50 32)) .cse8) (and .cse9 .cse1 .cse3 .cse4 .cse5 .cse10 .cse11 .cse12 .cse8 .cse13) (and .cse14 .cse9 .cse15 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse0 .cse14 .cse9 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse13))) [2021-10-13 07:50:23,032 INFO L857 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2021-10-13 07:50:23,032 INFO L857 garLoopResultBuilder]: For program point L704(lines 704 708) no Hoare annotation was computed. [2021-10-13 07:50:23,032 INFO L853 garLoopResultBuilder]: At program point L1299(lines 1292 1309) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,032 INFO L853 garLoopResultBuilder]: At program point L242(lines 235 261) the Hoare annotation is: (let ((.cse17 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (= ~m_run_pc~0 (_ bv0 32)))) (let ((.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (or (and .cse17 .cse15) (and .cse15 .cse16))) (.cse9 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (let ((.cse14 (= ~s_run_pc~0 (_ bv0 32)))) (or (and .cse14 .cse15 .cse16) (and .cse17 .cse14 .cse15)))) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse5 (= ~c_req_type~0 (_ bv1 32))) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse11 .cse12 .cse13) (and .cse8 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse3 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse10 .cse11 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse12 (= ~s_memory0~0 (_ bv50 32))) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse12 .cse13)))) [2021-10-13 07:50:23,033 INFO L857 garLoopResultBuilder]: For program point L176(lines 175 203) no Hoare annotation was computed. [2021-10-13 07:50:23,033 INFO L853 garLoopResultBuilder]: At program point L969(lines 962 979) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (not .cse17))) (let ((.cse12 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse13 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse2 (not .cse1) .cse6 .cse16 .cse8 .cse17 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse18 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse19 .cse12 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 .cse19 .cse24 .cse25 .cse15) (and .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse19 .cse24 .cse25 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15))))) [2021-10-13 07:50:23,033 INFO L857 garLoopResultBuilder]: For program point L1300(lines 1252 1341) no Hoare annotation was computed. [2021-10-13 07:50:23,033 INFO L857 garLoopResultBuilder]: For program point L1234(lines 1234 1238) no Hoare annotation was computed. [2021-10-13 07:50:23,033 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 181) no Hoare annotation was computed. [2021-10-13 07:50:23,033 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 123) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point L970(lines 962 979) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L853 garLoopResultBuilder]: At program point L442(lines 435 452) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse8) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse8 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point L376(lines 376 380) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point L1169(lines 1169 1173) no Hoare annotation was computed. [2021-10-13 07:50:23,034 INFO L853 garLoopResultBuilder]: At program point L112(lines 98 840) the Hoare annotation is: false [2021-10-13 07:50:23,034 INFO L857 garLoopResultBuilder]: For program point L1169-2(lines 1167 1346) no Hoare annotation was computed. [2021-10-13 07:50:23,035 INFO L853 garLoopResultBuilder]: At program point L1037(lines 1030 1083) the Hoare annotation is: (let ((.cse23 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse14 (not .cse23)) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse15 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i))) (let ((.cse1 (not .cse15)) (.cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse11 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (not .cse24)) (.cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse9 (= (_ bv0 32) ~a_t~0)) (.cse17 (= ~c_req_type~0 (_ bv0 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse20 (= (_ bv6 32) ~m_run_pc~0)) (.cse21 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse14)) (.cse13 (= ~s_run_pc~0 (_ bv2 32))) (.cse16 (= ~s_memory1~0 (_ bv51 32))) (.cse18 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 (_ bv1 32))) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (or .cse14 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse22 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (or (and (not (= ~s_run_st~0 (_ bv0 32))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_run_pc~0 (_ bv0 32)) .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse11 .cse12) (and .cse13 .cse15 .cse0 .cse16 .cse17 .cse18 .cse2 .cse19 (= (_ bv0 32) ~req_tt_a~0) .cse5 .cse20 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse7 .cse8 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse9 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse21 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse13 .cse15 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse16 .cse17 .cse18 .cse2 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse5 (= ~c_rsp_d~0 (_ bv51 32)) .cse20 .cse7 .cse10 .cse21 .cse12 .cse22 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse13 .cse15 .cse16 .cse18 .cse2 .cse4 .cse23 .cse5 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse7 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse10 .cse24 .cse12 .cse22))))) [2021-10-13 07:50:23,035 INFO L857 garLoopResultBuilder]: For program point L971(lines 971 975) no Hoare annotation was computed. [2021-10-13 07:50:23,035 INFO L857 garLoopResultBuilder]: For program point L443(lines 131 477) no Hoare annotation was computed. [2021-10-13 07:50:23,035 INFO L853 garLoopResultBuilder]: At program point L576(lines 569 613) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv6 32) ~m_run_pc~0) .cse8 .cse9 (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse10 .cse11) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse4 .cse5 .cse6 (= (_ bv3 32) ~m_run_pc~0) .cse7 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse10 .cse11))) [2021-10-13 07:50:23,035 INFO L857 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2021-10-13 07:50:23,036 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-10-13 07:50:23,036 INFO L857 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-10-13 07:50:23,036 INFO L853 garLoopResultBuilder]: At program point L115(lines 98 840) the Hoare annotation is: false [2021-10-13 07:50:23,036 INFO L857 garLoopResultBuilder]: For program point L908(lines 908 961) no Hoare annotation was computed. [2021-10-13 07:50:23,036 INFO L853 garLoopResultBuilder]: At program point L776(lines 769 804) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,037 INFO L853 garLoopResultBuilder]: At program point L710(lines 703 720) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,037 INFO L857 garLoopResultBuilder]: For program point L578(lines 578 582) no Hoare annotation was computed. [2021-10-13 07:50:23,037 INFO L860 garLoopResultBuilder]: At program point L1371(lines 1348 1373) the Hoare annotation is: true [2021-10-13 07:50:23,037 INFO L853 garLoopResultBuilder]: At program point L314(lines 284 315) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10))) [2021-10-13 07:50:23,037 INFO L857 garLoopResultBuilder]: For program point L909(lines 909 913) no Hoare annotation was computed. [2021-10-13 07:50:23,037 INFO L857 garLoopResultBuilder]: For program point L711(lines 482 834) no Hoare annotation was computed. [2021-10-13 07:50:23,038 INFO L853 garLoopResultBuilder]: At program point L1240(lines 1233 1250) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_req~0 (_ bv1 32))) (.cse3 (= ~s_run_pc~0 (_ bv0 32))) (.cse4 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse6 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~s_run_st~0 (_ bv2 32)) .cse4 .cse5 .cse6) (and .cse0 (= ~c_req_type~0 (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) .cse1 .cse2 .cse3 (= (_ bv0 32) ~a_t~0) .cse4 .cse5 .cse6))) [2021-10-13 07:50:23,038 INFO L857 garLoopResultBuilder]: For program point L1174-1(lines 1167 1346) no Hoare annotation was computed. [2021-10-13 07:50:23,038 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-10-13 07:50:23,038 INFO L857 garLoopResultBuilder]: For program point L778(lines 778 782) no Hoare annotation was computed. [2021-10-13 07:50:23,038 INFO L857 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2021-10-13 07:50:23,038 INFO L853 garLoopResultBuilder]: At program point L382(lines 375 392) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,039 INFO L853 garLoopResultBuilder]: At program point L250(lines 243 260) the Hoare annotation is: (let ((.cse17 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (= ~m_run_pc~0 (_ bv0 32)))) (let ((.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (or (and .cse17 .cse15) (and .cse15 .cse16))) (.cse9 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (let ((.cse14 (= ~s_run_pc~0 (_ bv0 32)))) (or (and .cse14 .cse15 .cse16) (and .cse17 .cse14 .cse15)))) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse5 (= ~c_req_type~0 (_ bv1 32))) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse11 .cse12 .cse13) (and .cse8 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse3 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse4 .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse10 .cse11 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse12 (= ~s_memory0~0 (_ bv50 32))) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse12 .cse13)))) [2021-10-13 07:50:23,039 INFO L853 garLoopResultBuilder]: At program point L118(lines 98 840) the Hoare annotation is: (let ((.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse18 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse10 (= (_ bv0 32) ~req_tt_a~0)) (.cse13 (= ~c_m_lock~0 (_ bv1 32))) (.cse14 (= (_ bv0 32) ~a_t~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse16 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse7 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_req~0 (_ bv1 32))) (.cse12 (= (_ bv6 32) ~m_run_pc~0)) (.cse17 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse14 (not .cse15) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse11 (= ~c_rsp_d~0 (_ bv51 32)) .cse12 .cse13 .cse16 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse0 .cse2 .cse7 .cse9 .cse12 .cse13 .cse17) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 .cse16 .cse17) (and .cse0 .cse2 .cse7 .cse9 .cse11 .cse12 (= ~c_m_lock~0 (_ bv0 32)) .cse17))) [2021-10-13 07:50:23,039 INFO L857 garLoopResultBuilder]: For program point L383(lines 375 392) no Hoare annotation was computed. [2021-10-13 07:50:23,039 INFO L857 garLoopResultBuilder]: For program point L251(lines 131 477) no Hoare annotation was computed. [2021-10-13 07:50:23,039 INFO L857 garLoopResultBuilder]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2021-10-13 07:50:23,039 INFO L857 garLoopResultBuilder]: For program point L384(lines 384 388) no Hoare annotation was computed. [2021-10-13 07:50:23,039 INFO L857 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2021-10-13 07:50:23,039 INFO L853 garLoopResultBuilder]: At program point L1045(lines 1038 1082) the Hoare annotation is: (let ((.cse23 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse14 (not .cse23)) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse15 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i))) (let ((.cse1 (not .cse15)) (.cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse11 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (not .cse24)) (.cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse9 (= (_ bv0 32) ~a_t~0)) (.cse17 (= ~c_req_type~0 (_ bv0 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse20 (= (_ bv6 32) ~m_run_pc~0)) (.cse21 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse14)) (.cse13 (= ~s_run_pc~0 (_ bv2 32))) (.cse16 (= ~s_memory1~0 (_ bv51 32))) (.cse18 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 (_ bv1 32))) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (or .cse14 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse22 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (or (and (not (= ~s_run_st~0 (_ bv0 32))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_run_pc~0 (_ bv0 32)) .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse11 .cse12) (and .cse13 .cse15 .cse0 .cse16 .cse17 .cse18 .cse2 .cse19 (= (_ bv0 32) ~req_tt_a~0) .cse5 .cse20 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse7 .cse8 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse9 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse21 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse13 .cse15 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse16 .cse17 .cse18 .cse2 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse5 (= ~c_rsp_d~0 (_ bv51 32)) .cse20 .cse7 .cse10 .cse21 .cse12 .cse22 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse13 .cse15 .cse16 .cse18 .cse2 .cse4 .cse23 .cse5 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse7 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse10 .cse24 .cse12 .cse22))))) [2021-10-13 07:50:23,039 INFO L853 garLoopResultBuilder]: At program point L584(lines 577 612) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv6 32) ~m_run_pc~0) .cse8 .cse9 (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse10 .cse11) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (or (and (= (_ bv3 32) ~m_run_pc~0) .cse11) (and .cse11 (= ~m_run_pc~0 (_ bv0 32)))) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse10))) [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L853 garLoopResultBuilder]: At program point L915(lines 908 961) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (not .cse17))) (let ((.cse12 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse13 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse2 (not .cse1) .cse6 .cse16 .cse8 .cse17 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse18 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse19 .cse12 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 .cse19 .cse24 .cse25 .cse15) (and .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse19 .cse24 .cse25 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15))))) [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L321(lines 321 374) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L1180(lines 1180 1184) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L982(lines 982 996) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L853 garLoopResultBuilder]: At program point L784(lines 777 803) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:50:23,040 INFO L857 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L853 garLoopResultBuilder]: At program point L521(lines 491 522) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (not (= ~c_m_lock~0 (_ bv1 32)))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse7 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse8 (not (= ~m_run_pc~0 (_ bv1 32)))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse12 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= ~s_memory0~0 (_ bv50 32))) (.cse14 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= ~c_req_type~0 (_ bv0 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 .cse10 (= (_ bv6 32) ~m_run_pc~0) .cse11 (= (_ bv0 32) ~a_t~0) (not .cse12) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv3 32) ~m_run_pc~0) .cse9 .cse12 .cse10 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14))) [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L786(lines 786 790) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L1315(lines 1315 1319) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L1117(lines 1116 1157) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 64) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 462) no Hoare annotation was computed. [2021-10-13 07:50:23,041 INFO L853 garLoopResultBuilder]: At program point L128(lines 98 840) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse8 (= ~c_req_type~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse5 (= ~c_m_lock~0 (_ bv0 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse7 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and (= ~s_run_pc~0 (_ bv2 32)) .cse0 .cse1 .cse8 .cse9 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7))) [2021-10-13 07:50:23,041 INFO L853 garLoopResultBuilder]: At program point L1053(lines 1046 1081) the Hoare annotation is: (let ((.cse24 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse22 (not .cse24))) (let ((.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse13 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse22)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse17 (not (= ~c_write_rsp_ev~0 (_ bv1 32)))) (.cse2 (not .cse25)) (.cse18 (not .cse1)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse20 (= (_ bv3 32) ~m_run_pc~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse15 (or .cse22 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse23 (= ~c_req_d~0 (_ bv50 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse12 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse15 .cse13 .cse14 .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse17 .cse0 .cse2 .cse18 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse11 .cse12 .cse22 .cse23 .cse14) (and .cse17 .cse0 .cse1 .cse3 .cse5 .cse6 .cse20 .cse24 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse25 .cse14 .cse16) (and .cse17 (not (= ~s_run_st~0 (_ bv0 32))) .cse2 .cse18 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse11 (= ~s_run_pc~0 (_ bv0 32)) .cse12 .cse15 .cse23 .cse14))))) [2021-10-13 07:50:23,041 INFO L853 garLoopResultBuilder]: At program point L525-2(lines 525 553) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse7 (= ~c_req_a~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv3 32) ~m_run_pc~0) .cse6 .cse7 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13) (and .cse0 .cse1 .cse2 (not .cse11) .cse3 (= ~c_req_type~0 (_ bv0 32)) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse8 (= (_ bv6 32) ~m_run_pc~0) .cse9 .cse10 (= (_ bv0 32) ~a_t~0) (not .cse7) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13))) [2021-10-13 07:50:23,041 INFO L853 garLoopResultBuilder]: At program point L1186(lines 1179 1232) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_req~0 (_ bv1 32))) (.cse3 (= ~s_run_pc~0 (_ bv0 32))) (.cse4 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse6 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~s_run_st~0 (_ bv2 32)) .cse4 .cse5 .cse6) (and .cse0 (= ~c_req_type~0 (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) .cse1 .cse2 .cse3 (= (_ bv0 32) ~a_t~0) .cse4 .cse5 .cse6))) [2021-10-13 07:50:23,041 INFO L857 garLoopResultBuilder]: For program point L988(lines 988 995) no Hoare annotation was computed. [2021-10-13 07:50:23,042 INFO L853 garLoopResultBuilder]: At program point L592(lines 585 611) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv6 32) ~m_run_pc~0) .cse8 .cse9 (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse10 .cse11) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (or (and (= (_ bv3 32) ~m_run_pc~0) .cse11) (and .cse11 (= ~m_run_pc~0 (_ bv0 32)))) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse10))) [2021-10-13 07:50:23,042 INFO L857 garLoopResultBuilder]: For program point L526(lines 525 553) no Hoare annotation was computed. [2021-10-13 07:50:23,042 INFO L857 garLoopResultBuilder]: For program point L394(lines 394 400) no Hoare annotation was computed. [2021-10-13 07:50:23,042 INFO L853 garLoopResultBuilder]: At program point L394-1(lines 394 400) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,042 INFO L853 garLoopResultBuilder]: At program point L328(lines 321 374) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,042 INFO L857 garLoopResultBuilder]: For program point L1253(line 1253) no Hoare annotation was computed. [2021-10-13 07:50:23,042 INFO L857 garLoopResultBuilder]: For program point L1121(lines 1121 1125) no Hoare annotation was computed. [2021-10-13 07:50:23,042 INFO L857 garLoopResultBuilder]: For program point L1121-1(lines 1116 1157) no Hoare annotation was computed. [2021-10-13 07:50:23,043 INFO L857 garLoopResultBuilder]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2021-10-13 07:50:23,043 INFO L853 garLoopResultBuilder]: At program point L923(lines 916 960) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (not .cse17))) (let ((.cse12 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse13 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse2 (not .cse1) .cse6 .cse16 .cse8 .cse17 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse18 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse19 .cse12 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 .cse19 .cse24 .cse25 .cse15) (and .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse19 .cse24 .cse25 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15))))) [2021-10-13 07:50:23,043 INFO L857 garLoopResultBuilder]: For program point L527(lines 527 531) no Hoare annotation was computed. [2021-10-13 07:50:23,043 INFO L857 garLoopResultBuilder]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2021-10-13 07:50:23,043 INFO L853 garLoopResultBuilder]: At program point L131-2(lines 131 477) the Hoare annotation is: (let ((.cse15 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse12 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse13 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse16 (= (_ bv0 32) ~a_t~0)) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse17 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (not (bvslt ULTIMATE.start_m_run_~a~0 (_ bv2 32))) .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse8 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (and .cse12 .cse13 .cse3 .cse5 .cse7 .cse14 .cse15 .cse16 .cse9 .cse11 .cse17) (and .cse12 .cse2 .cse5 .cse7 .cse14 .cse15 .cse9 .cse11 .cse17) (and .cse0 .cse2 (not .cse8) (not .cse1) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse16 (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse7 .cse14 .cse16 .cse9 .cse11 .cse17))) [2021-10-13 07:50:23,044 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 07:50:23,044 INFO L857 garLoopResultBuilder]: For program point L858(lines 858 870) no Hoare annotation was computed. [2021-10-13 07:50:23,044 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,044 INFO L853 garLoopResultBuilder]: At program point L792(lines 785 802) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,044 INFO L857 garLoopResultBuilder]: For program point L726(lines 726 730) no Hoare annotation was computed. [2021-10-13 07:50:23,044 INFO L857 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2021-10-13 07:50:23,045 INFO L857 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2021-10-13 07:50:23,045 INFO L853 garLoopResultBuilder]: At program point L1321(lines 1314 1331) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,045 INFO L857 garLoopResultBuilder]: For program point L132(lines 131 477) no Hoare annotation was computed. [2021-10-13 07:50:23,045 INFO L853 garLoopResultBuilder]: At program point L66(lines 55 67) the Hoare annotation is: (let ((.cse14 (not (= ~c_req_a~0 (_ bv1 32))))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse14)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) .cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 .cse9 .cse10 (or .cse14 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))))) [2021-10-13 07:50:23,045 INFO L857 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2021-10-13 07:50:23,045 INFO L857 garLoopResultBuilder]: For program point L793(lines 482 834) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L1322(lines 1252 1341) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L853 garLoopResultBuilder]: At program point L464(lines 457 474) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse8) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse8 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L861(lines 861 869) no Hoare annotation was computed. [2021-10-13 07:50:23,046 INFO L857 garLoopResultBuilder]: For program point L465(lines 457 474) no Hoare annotation was computed. [2021-10-13 07:50:23,047 INFO L853 garLoopResultBuilder]: At program point L862(lines 857 1108) the Hoare annotation is: false [2021-10-13 07:50:23,047 INFO L853 garLoopResultBuilder]: At program point L664(lines 634 665) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,047 INFO L857 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2021-10-13 07:50:23,047 INFO L853 garLoopResultBuilder]: At program point L1127(lines 1116 1157) the Hoare annotation is: (let ((.cse26 (= ~c_req_a~0 (_ bv1 32))) (.cse38 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse32 (not .cse38)) (.cse37 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse13 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse16 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse24 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse39 (not .cse26))) (let ((.cse22 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse39)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse30 (or .cse39 .cse24)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse33 (= (_ bv0 32) ~req_tt_a~0)) (.cse34 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32))) (.cse25 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse28 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse29 (or (not .cse13) .cse16)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= ~c_req_d~0 (_ bv50 32))) (.cse31 (or .cse32 .cse37)) (.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse14 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse27 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (or .cse39 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse23 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse18 (= ~m_run_st~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~a_t~0)) (.cse36 (= ~m_run_pc~0 (_ bv0 32))) (.cse7 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse8 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_req~0 (_ bv1 32))) (.cse20 (= (_ bv6 32) ~m_run_pc~0)) (.cse35 (= ~c_m_lock~0 (_ bv0 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse7 .cse13 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse14 .cse15 .cse16 .cse8 .cse17 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse18 .cse19 (= ~c_rsp_d~0 (_ bv51 32)) .cse20 .cse9 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse7 .cse8 .cse25 .cse2 .cse3 .cse26 .cse27 .cse4 .cse28 .cse29 .cse9 .cse30 .cse21 .cse23 .cse6 .cse31) (and .cse7 .cse13 .cse1 .cse32 .cse14 .cse15 .cse16 .cse8 .cse17 .cse3 .cse33 .cse18 .cse19 .cse20 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse11 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse34 .cse22 .cse23 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse18 .cse19 .cse5 .cse35 .cse6 .cse36) (and .cse7 .cse13 .cse14 .cse15 .cse16 .cse8 .cse17 .cse3 .cse20 .cse9 .cse30 .cse21 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse23 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12 .cse6) (and .cse7 .cse0 .cse13 .cse14 .cse15 .cse16 .cse8 .cse3 .cse33 .cse20 .cse9 .cse10 .cse11 .cse37 .cse38 .cse34 .cse23 .cse6) (and .cse7 .cse1 .cse8 .cse25 .cse2 .cse3 .cse18 .cse19 .cse28 .cse29 .cse9 .cse10 .cse11 .cse39 .cse12 .cse23 .cse31) (and .cse7 .cse1 .cse8 .cse3 .cse20 .cse9 .cse6) (and .cse0 .cse15 .cse8 .cse3 .cse19 .cse5 .cse11 .cse35 .cse6 .cse36) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse2 .cse3 .cse19 .cse6) (and .cse7 .cse13 .cse1 .cse14 .cse16 .cse8 .cse2 .cse3 .cse26 .cse18 .cse19 .cse27 .cse9 .cse37 .cse21 .cse38 .cse23 .cse24) (and .cse7 .cse0 .cse1 .cse15 .cse8 .cse3 .cse18 .cse19 .cse11 .cse35 .cse6 .cse36) (and .cse7 .cse1 .cse8 .cse3 .cse19 .cse20 .cse35 .cse6))))) [2021-10-13 07:50:23,048 INFO L853 garLoopResultBuilder]: At program point L1061(lines 1054 1080) the Hoare annotation is: (let ((.cse24 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse22 (not .cse24))) (let ((.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse13 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse22)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse17 (not (= ~c_write_rsp_ev~0 (_ bv1 32)))) (.cse2 (not .cse25)) (.cse18 (not .cse1)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse20 (= (_ bv3 32) ~m_run_pc~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse15 (or .cse22 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse23 (= ~c_req_d~0 (_ bv50 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse12 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse15 .cse13 .cse14 .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse17 .cse0 .cse2 .cse18 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse11 .cse12 .cse22 .cse23 .cse14) (and .cse17 .cse0 .cse1 .cse3 .cse5 .cse6 .cse20 .cse24 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse25 .cse14 .cse16) (and .cse17 (not (= ~s_run_st~0 (_ bv0 32))) .cse2 .cse18 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse11 (= ~s_run_pc~0 (_ bv0 32)) .cse12 .cse15 .cse23 .cse14))))) [2021-10-13 07:50:23,048 INFO L857 garLoopResultBuilder]: For program point L1260(lines 1260 1313) no Hoare annotation was computed. [2021-10-13 07:50:23,048 INFO L853 garLoopResultBuilder]: At program point L1194(lines 1187 1231) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_req~0 (_ bv1 32))) (.cse3 (= ~s_run_pc~0 (_ bv0 32))) (.cse4 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse6 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~s_run_st~0 (_ bv2 32)) .cse4 .cse5 .cse6) (and .cse0 (= ~c_req_type~0 (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) .cse1 .cse2 .cse3 (= (_ bv0 32) ~a_t~0) .cse4 .cse5 .cse6))) [2021-10-13 07:50:23,048 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 76) no Hoare annotation was computed. [2021-10-13 07:50:23,048 INFO L857 garLoopResultBuilder]: For program point L864(lines 864 868) no Hoare annotation was computed. [2021-10-13 07:50:23,049 INFO L853 garLoopResultBuilder]: At program point L732(lines 725 742) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,049 INFO L853 garLoopResultBuilder]: At program point L600(lines 593 610) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv6 32) ~m_run_pc~0) .cse8 .cse9 (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse10 .cse11) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (or (and (= (_ bv3 32) ~m_run_pc~0) .cse11) (and .cse11 (= ~m_run_pc~0 (_ bv0 32)))) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse3 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse10))) [2021-10-13 07:50:23,049 INFO L853 garLoopResultBuilder]: At program point L336(lines 329 373) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,049 INFO L857 garLoopResultBuilder]: For program point L1261(lines 1261 1265) no Hoare annotation was computed. [2021-10-13 07:50:23,050 INFO L853 garLoopResultBuilder]: At program point L204(lines 174 205) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ~s_run_pc~0 (_ bv0 32))) (.cse13 (= ~m_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= (_ bv0 32) ~a_t~0)) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse14 .cse12 .cse13) (and .cse0 .cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (= (_ bv3 32) ~m_run_pc~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse9 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse11 (not (= ~c_req_a~0 (_ bv1 32))) (= ~c_req_d~0 (_ bv50 32)) (= ~s_memory0~0 (_ bv50 32)) .cse12))) [2021-10-13 07:50:23,050 INFO L857 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2021-10-13 07:50:23,050 INFO L853 garLoopResultBuilder]: At program point L931(lines 924 959) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (not .cse17))) (let ((.cse12 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse13 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse2 (not .cse1) .cse6 .cse16 .cse8 .cse17 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse18 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse19 .cse12 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 .cse19 .cse24 .cse25 .cse15) (and .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse19 .cse24 .cse25 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15))))) [2021-10-13 07:50:23,050 INFO L853 garLoopResultBuilder]: At program point L865(lines 857 1108) the Hoare annotation is: (let ((.cse19 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse20 (not .cse19))) (let ((.cse16 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (or .cse20 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse11 (or .cse20 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse14 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse17 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse18 (= (_ bv0 32) ~a_t~0)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse6 .cse15 .cse7 .cse16 .cse9 .cse17 .cse18 (= ~c_req_d~0 (_ bv50 32)) .cse13) (and .cse0 .cse2 (not .cse1) .cse6 .cse15 .cse7 .cse19 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse16 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13) (and .cse0 .cse2 .cse15 .cse7 (= ~c_empty_req~0 (_ bv1 32)) .cse13))))) [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L733(lines 725 742) no Hoare annotation was computed. [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L601(lines 482 834) no Hoare annotation was computed. [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L403(lines 403 456) no Hoare annotation was computed. [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L73(lines 73 76) no Hoare annotation was computed. [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L998-1(lines 873 1103) no Hoare annotation was computed. [2021-10-13 07:50:23,051 INFO L857 garLoopResultBuilder]: For program point L734(lines 734 738) no Hoare annotation was computed. [2021-10-13 07:50:23,052 INFO L857 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2021-10-13 07:50:23,052 INFO L857 garLoopResultBuilder]: For program point L404(lines 404 408) no Hoare annotation was computed. [2021-10-13 07:50:23,052 INFO L857 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-10-13 07:50:23,052 INFO L853 garLoopResultBuilder]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse5 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse7 (= ~s_run_pc~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32)) .cse0 .cse2 .cse3 .cse4 .cse5 (= ~c_m_lock~0 (_ bv1 32)) .cse6 .cse7 (= (_ bv0 32) ~a_t~0) (= ~c_req_d~0 (_ bv50 32)) .cse8 (not (= (_ bv4 32) ~m_run_pc~0))) (and (= ~s_run_pc~0 (_ bv2 32)) .cse1 (not (= ~c_write_req_ev~0 (_ bv1 32))) .cse2 .cse8))) [2021-10-13 07:50:23,052 INFO L857 garLoopResultBuilder]: For program point L1131(lines 1131 1138) no Hoare annotation was computed. [2021-10-13 07:50:23,052 INFO L857 garLoopResultBuilder]: For program point L999(lines 998 1022) no Hoare annotation was computed. [2021-10-13 07:50:23,053 INFO L857 garLoopResultBuilder]: For program point L933(lines 933 937) no Hoare annotation was computed. [2021-10-13 07:50:23,053 INFO L857 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2021-10-13 07:50:23,053 INFO L857 garLoopResultBuilder]: For program point L1000(lines 1000 1004) no Hoare annotation was computed. [2021-10-13 07:50:23,053 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,053 INFO L857 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2021-10-13 07:50:23,053 INFO L853 garLoopResultBuilder]: At program point L142-2(lines 142 170) the Hoare annotation is: (let ((.cse9 (= ~s_run_pc~0 (_ bv0 32))) (.cse14 (= ~s_run_pc~0 (_ bv2 32))) (.cse0 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse1 (= ~c_req_a~0 (_ bv0 32))) (.cse15 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_req~0 (_ bv1 32))) (.cse6 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse13 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (= (_ bv3 32) ~m_run_pc~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse10 (not (= ~c_req_a~0 (_ bv1 32))) (= ~c_req_d~0 (_ bv50 32)) .cse11 (= ~s_memory0~0 (_ bv50 32)) .cse12) (and .cse1 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13))) [2021-10-13 07:50:23,054 INFO L857 garLoopResultBuilder]: For program point L671(lines 671 724) no Hoare annotation was computed. [2021-10-13 07:50:23,054 INFO L857 garLoopResultBuilder]: For program point L143(lines 142 170) no Hoare annotation was computed. [2021-10-13 07:50:23,054 INFO L857 garLoopResultBuilder]: For program point L672(lines 672 676) no Hoare annotation was computed. [2021-10-13 07:50:23,054 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,054 INFO L853 garLoopResultBuilder]: At program point L1267(lines 1260 1313) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,055 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2021-10-13 07:50:23,055 INFO L853 garLoopResultBuilder]: At program point L1069(lines 1062 1079) the Hoare annotation is: (let ((.cse24 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse22 (not .cse24))) (let ((.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse13 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse22)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse17 (not (= ~c_write_rsp_ev~0 (_ bv1 32)))) (.cse2 (not .cse25)) (.cse18 (not .cse1)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse20 (= (_ bv3 32) ~m_run_pc~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse15 (or .cse22 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse23 (= ~c_req_d~0 (_ bv50 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse12 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse15 .cse13 .cse14 .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse17 .cse0 .cse2 .cse18 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse11 .cse12 .cse22 .cse23 .cse14) (and .cse17 .cse0 .cse1 .cse3 .cse5 .cse6 .cse20 .cse24 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse25 .cse14 .cse16) (and .cse17 (not (= ~s_run_st~0 (_ bv0 32))) .cse2 .cse18 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse11 (= ~s_run_pc~0 (_ bv0 32)) .cse12 .cse15 .cse23 .cse14))))) [2021-10-13 07:50:23,055 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,055 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,055 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,055 INFO L857 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,056 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-10-13 07:50:23,056 INFO L857 garLoopResultBuilder]: For program point L211(lines 211 264) no Hoare annotation was computed. [2021-10-13 07:50:23,056 INFO L853 garLoopResultBuilder]: At program point L1202(lines 1195 1230) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_req~0 (_ bv1 32))) (.cse3 (= ~s_run_pc~0 (_ bv0 32))) (.cse4 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse6 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~s_run_st~0 (_ bv2 32)) .cse4 .cse5 .cse6) (and .cse0 (= ~c_req_type~0 (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) .cse1 .cse2 .cse3 (= (_ bv0 32) ~a_t~0) .cse4 .cse5 .cse6))) [2021-10-13 07:50:23,056 INFO L857 garLoopResultBuilder]: For program point L1070(lines 873 1103) no Hoare annotation was computed. [2021-10-13 07:50:23,056 INFO L853 garLoopResultBuilder]: At program point L13-3(lines 1 1373) the Hoare annotation is: (let ((.cse14 (not (= ~c_req_a~0 (_ bv1 32))))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse14)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 .cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 .cse9 .cse10 (or .cse14 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))))) [2021-10-13 07:50:23,057 INFO L853 garLoopResultBuilder]: At program point L13-4(lines 69 79) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse20 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse19 (= ~c_req_a~0 (_ bv1 32))) (.cse17 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse18 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse3 (= (_ bv3 32) ~m_run_pc~0)) (.cse4 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_req~0 (_ bv1 32))) (.cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse7 (or (not .cse17) .cse18)) (.cse8 (or (= ~c_req_d~0 (_ bv51 32)) (not .cse19))) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not .cse21) .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse17 (= ~s_memory1~0 (_ bv51 32)) .cse18 .cse1 .cse3 .cse4 .cse19 .cse5 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse9 .cse11 .cse20 .cse21 .cse14 .cse15 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and (not (= ~s_run_st~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~s_run_pc~0 (_ bv0 32)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2021-10-13 07:50:23,057 INFO L853 garLoopResultBuilder]: At program point L410(lines 403 456) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse8) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse8 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,057 INFO L853 garLoopResultBuilder]: At program point L344(lines 337 372) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,057 INFO L857 garLoopResultBuilder]: For program point L1335(lines 1335 1339) no Hoare annotation was computed. [2021-10-13 07:50:23,057 INFO L857 garLoopResultBuilder]: For program point L1335-1(lines 1167 1346) no Hoare annotation was computed. [2021-10-13 07:50:23,058 INFO L857 garLoopResultBuilder]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2021-10-13 07:50:23,058 INFO L857 garLoopResultBuilder]: For program point L212(lines 212 216) no Hoare annotation was computed. [2021-10-13 07:50:23,058 INFO L857 garLoopResultBuilder]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2021-10-13 07:50:23,058 INFO L853 garLoopResultBuilder]: At program point L939(lines 932 958) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (not .cse17))) (let ((.cse12 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse13 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse2 (not .cse1) .cse6 .cse16 .cse8 .cse17 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse18 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse19 .cse12 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 .cse19 .cse24 .cse25 .cse15) (and .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse19 .cse24 .cse25 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15))))) [2021-10-13 07:50:23,058 INFO L853 garLoopResultBuilder]: At program point L873-1(lines 857 1108) the Hoare annotation is: (let ((.cse23 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse24 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse25 (not .cse23))) (let ((.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse25)) (.cse11 (= ~s_memory1~0 (_ bv51 32))) (.cse12 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse25 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (not (= ~s_run_pc~0 (_ bv1 32)))) (.cse20 (not .cse24)) (.cse10 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse1 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse22 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse7 (= (_ bv0 32) ~a_t~0)) (.cse26 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_m_lock~0 (_ bv0 32)) .cse8 (= ~m_run_pc~0 (_ bv0 32))) (and .cse9 .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse6 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse9 .cse10 .cse20 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 (= (_ bv0 32) ~req_tt_a~0) .cse6 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse7 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse10 .cse11 .cse12 .cse4 .cse22 .cse5 .cse23 .cse6 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse24 .cse18 .cse19) (and .cse0 .cse20 (not .cse10) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse22 .cse5 .cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse7 .cse25 .cse26 .cse18) (and .cse1 .cse2 .cse4 .cse22 .cse5 (= ~c_req_type~0 (_ bv1 32)) .cse15 .cse21 (= ~s_run_pc~0 (_ bv0 32)) .cse7 .cse26 .cse8))))) [2021-10-13 07:50:23,059 INFO L857 garLoopResultBuilder]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2021-10-13 07:50:23,059 INFO L857 garLoopResultBuilder]: For program point L808(lines 808 812) no Hoare annotation was computed. [2021-10-13 07:50:23,059 INFO L853 garLoopResultBuilder]: At program point L478(lines 130 479) the Hoare annotation is: (and (= ~s_run_pc~0 (_ bv2 32)) (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i) (not (= ~s_run_st~0 (_ bv0 32))) (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv2 32) ~c_write_req_ev~0) (not (bvslt ULTIMATE.start_m_run_~a~0 (_ bv2 32))) (= (_ bv3 32) ~m_run_pc~0) (= (_ bv2 32) ~c_write_rsp_ev~0) (= ~c_req_a~0 (_ bv1 32)) (= ~c_empty_req~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) (= ~c_m_lock~0 (_ bv0 32)) (= ~s_memory0~0 (_ bv50 32)) (= ~c_empty_rsp~0 (_ bv1 32))) [2021-10-13 07:50:23,059 INFO L857 garLoopResultBuilder]: For program point L412(lines 412 416) no Hoare annotation was computed. [2021-10-13 07:50:23,059 INFO L857 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2021-10-13 07:50:23,059 INFO L857 garLoopResultBuilder]: For program point L941(lines 941 945) no Hoare annotation was computed. [2021-10-13 07:50:23,060 INFO L857 garLoopResultBuilder]: For program point L876-1(lines 873 1103) no Hoare annotation was computed. [2021-10-13 07:50:23,060 INFO L857 garLoopResultBuilder]: For program point L744(lines 744 750) no Hoare annotation was computed. [2021-10-13 07:50:23,060 INFO L853 garLoopResultBuilder]: At program point L744-1(lines 744 750) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,060 INFO L853 garLoopResultBuilder]: At program point L678(lines 671 724) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,060 INFO L857 garLoopResultBuilder]: For program point L877(lines 876 900) no Hoare annotation was computed. [2021-10-13 07:50:23,061 INFO L853 garLoopResultBuilder]: At program point L1142(lines 1116 1157) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32))) (.cse37 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse31 (not .cse37)) (.cse36 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse13 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse16 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse23 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse38 (not .cse25))) (let ((.cse21 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse38)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse29 (or .cse38 .cse23)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse32 (= (_ bv0 32) ~req_tt_a~0)) (.cse33 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32))) (.cse24 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse27 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse28 (or (not .cse13) .cse16)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= ~c_req_d~0 (_ bv50 32))) (.cse30 (or .cse31 .cse36)) (.cse14 (= ~s_memory1~0 (_ bv51 32))) (.cse26 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse20 (or .cse38 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse22 (= ~s_memory0~0 (_ bv50 32))) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~a_t~0)) (.cse35 (= ~m_run_pc~0 (_ bv0 32))) (.cse7 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse8 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_req~0 (_ bv1 32))) (.cse19 (= (_ bv6 32) ~m_run_pc~0)) (.cse34 (= ~c_m_lock~0 (_ bv0 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse7 .cse13 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse14 .cse15 .cse16 .cse8 .cse17 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse18 (= ~c_rsp_d~0 (_ bv51 32)) .cse19 .cse9 .cse20 .cse21 .cse22 .cse23 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse7 .cse8 .cse24 .cse2 .cse3 .cse25 .cse26 .cse4 .cse27 .cse28 .cse9 .cse29 .cse20 .cse22 .cse6 .cse30) (and .cse7 .cse13 .cse1 .cse31 .cse14 .cse15 .cse16 .cse8 .cse17 .cse3 .cse32 .cse18 .cse19 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse11 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse33 .cse21 .cse22 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse7 .cse13 .cse14 .cse15 .cse16 .cse8 .cse17 .cse3 .cse19 .cse9 .cse29 .cse20 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse22 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse34 .cse6 .cse35) (and .cse7 .cse0 .cse13 .cse14 .cse15 .cse16 .cse8 .cse3 .cse32 .cse19 .cse9 .cse10 .cse11 .cse36 .cse37 .cse33 .cse22 .cse6) (and .cse7 .cse1 .cse8 .cse24 .cse2 .cse3 .cse18 .cse27 .cse28 .cse9 .cse10 .cse11 .cse38 .cse12 .cse22 .cse30) (and .cse7 .cse13 .cse1 .cse14 .cse16 .cse8 .cse2 .cse3 .cse25 .cse18 .cse26 .cse9 .cse36 .cse20 .cse37 .cse22 .cse23) (and .cse7 .cse1 .cse8 .cse3 .cse19 .cse9 .cse6) (and .cse0 .cse15 .cse8 .cse3 .cse18 .cse5 .cse11 .cse34 .cse6 .cse35) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse2 .cse3 .cse18 .cse6) (and .cse7 .cse0 .cse1 .cse15 .cse8 .cse3 .cse18 .cse11 .cse34 .cse6 .cse35) (and .cse7 .cse1 .cse8 .cse3 .cse18 .cse19 .cse34 .cse6))))) [2021-10-13 07:50:23,061 INFO L857 garLoopResultBuilder]: For program point L878(lines 878 882) no Hoare annotation was computed. [2021-10-13 07:50:23,061 INFO L857 garLoopResultBuilder]: For program point L680(lines 680 684) no Hoare annotation was computed. [2021-10-13 07:50:23,061 INFO L853 garLoopResultBuilder]: At program point L482-2(lines 482 834) the Hoare annotation is: (let ((.cse16 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse20 (= ~c_req_a~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse12 (not .cse21)) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse13 (= (_ bv6 32) ~m_run_pc~0)) (.cse15 (not .cse20)) (.cse10 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32)))) (.cse19 (= ULTIMATE.start_m_run_~rsp_d___0~0 .cse16)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= ~c_m_lock~0 (_ bv0 32))) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (let ((.cse9 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (bvslt ULTIMATE.start_m_run_~a~0 (_ bv2 32))) .cse7 .cse8 (or .cse9 .cse10) .cse11 (or .cse12 .cse9) .cse13 .cse14 (or .cse9 .cse15) (or (= ~s_memory1~0 .cse16) .cse15) .cse17 .cse18 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) .cse19)) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse11 .cse13 (= (_ bv0 32) ~a_t~0) .cse15 .cse10 .cse14 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (= (_ bv3 32) ~m_run_pc~0) .cse8 .cse20 .cse11 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse21 .cse14 .cse17 .cse18)))) [2021-10-13 07:50:23,062 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 07:50:23,062 INFO L853 garLoopResultBuilder]: At program point L1275(lines 1268 1312) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,062 INFO L853 garLoopResultBuilder]: At program point L218(lines 211 264) the Hoare annotation is: (let ((.cse11 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse13 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse8 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse6 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~c_req_d~0 (_ bv50 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse12 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (= (_ bv3 32) ~m_run_pc~0) .cse2 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse5 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse6 (= ~s_memory0~0 (_ bv50 32)) .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 .cse7 .cse12) (and .cse13 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse10 .cse11 .cse6 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse14 .cse7 .cse12))) [2021-10-13 07:50:23,062 INFO L857 garLoopResultBuilder]: For program point L483(lines 482 834) no Hoare annotation was computed. [2021-10-13 07:50:23,063 INFO L860 garLoopResultBuilder]: At program point L1342(lines 1164 1347) the Hoare annotation is: true [2021-10-13 07:50:23,063 INFO L853 garLoopResultBuilder]: At program point L285-2(lines 285 313) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse21 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse20 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse27 (not .cse17)) (.cse23 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (.cse13 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v))) (let ((.cse9 (= ~s_run_pc~0 (_ bv0 32))) (.cse5 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse11 (= ~c_req_d~0 (_ bv50 32))) (.cse14 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_empty_req~0 (_ bv1 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse24 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse19 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse6 (= ~c_req_type~0 (_ bv1 32))) (.cse25 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse26 (or (not .cse13) .cse15)) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse29 (or .cse27 .cse23)) (.cse22 (= ~s_memory0~0 (_ bv50 32))) (.cse4 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse12 (not (= (_ bv4 32) ~m_run_pc~0))) (.cse28 (or (not .cse21) .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12) (and .cse5 .cse1 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse16 .cse3 .cse17 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) .cse23) (and .cse0 .cse5 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 .cse12) (and .cse0 .cse1 .cse2 .cse24 .cse16 .cse3 .cse18 .cse25 .cse26 .cse7 .cse8 .cse10 .cse27 .cse11 .cse22 .cse28) (and .cse0 (or .cse14 (not .cse10)) .cse2 .cse24 .cse3 .cse17 .cse19 .cse6 .cse25 .cse26 .cse7 .cse29 .cse22 .cse4 .cse12 .cse28) (and .cse0 .cse16 .cse3 .cse18 .cse4) (and .cse0 .cse2 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse24 .cse3 .cse17 .cse19 .cse6 .cse25 .cse26 (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse7 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse29 .cse22 .cse4 .cse12 .cse28))))) [2021-10-13 07:50:23,063 INFO L853 garLoopResultBuilder]: At program point L1210(lines 1203 1229) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_req~0 (_ bv1 32))) (.cse3 (= ~s_run_pc~0 (_ bv0 32))) (.cse4 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse6 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~s_run_st~0 (_ bv2 32)) .cse4 .cse5 .cse6) (and .cse0 (= ~c_req_type~0 (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) .cse1 .cse2 .cse3 (= (_ bv0 32) ~a_t~0) .cse4 .cse5 .cse6))) [2021-10-13 07:50:23,063 INFO L853 garLoopResultBuilder]: At program point L814(lines 807 824) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,064 INFO L857 garLoopResultBuilder]: For program point L616(lines 616 620) no Hoare annotation was computed. [2021-10-13 07:50:23,064 INFO L857 garLoopResultBuilder]: For program point L484(lines 484 488) no Hoare annotation was computed. [2021-10-13 07:50:23,064 INFO L853 garLoopResultBuilder]: At program point L418(lines 411 455) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse8) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse8 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,064 INFO L853 garLoopResultBuilder]: At program point L352(lines 345 371) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,064 INFO L857 garLoopResultBuilder]: For program point L286(lines 285 313) no Hoare annotation was computed. [2021-10-13 07:50:23,065 INFO L857 garLoopResultBuilder]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2021-10-13 07:50:23,065 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2021-10-13 07:50:23,065 INFO L853 garLoopResultBuilder]: At program point L947(lines 940 957) the Hoare annotation is: (let ((.cse17 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (not .cse17))) (let ((.cse12 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (.cse13 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse21 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse12 .cse13 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse2 (not .cse1) .cse6 .cse16 .cse8 .cse17 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse18 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse19 .cse12 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse14 .cse15) (and .cse0 .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 .cse19 .cse24 .cse25 .cse15) (and .cse20 .cse2 .cse6 .cse21 .cse16 .cse8 .cse22 .cse9 .cse18 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse19 .cse24 .cse25 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15))))) [2021-10-13 07:50:23,065 INFO L857 garLoopResultBuilder]: For program point L815(lines 807 824) no Hoare annotation was computed. [2021-10-13 07:50:23,065 INFO L857 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2021-10-13 07:50:23,065 INFO L857 garLoopResultBuilder]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L857 garLoopResultBuilder]: For program point L1146(lines 1146 1153) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L857 garLoopResultBuilder]: For program point L948(lines 873 1103) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L857 garLoopResultBuilder]: For program point L816(lines 816 820) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L857 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L857 garLoopResultBuilder]: For program point L949(lines 949 953) no Hoare annotation was computed. [2021-10-13 07:50:23,066 INFO L853 garLoopResultBuilder]: At program point L686(lines 679 723) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,067 INFO L853 garLoopResultBuilder]: At program point L554(lines 524 555) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse7 (= ~c_req_a~0 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv3 32) ~m_run_pc~0) .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12) (and .cse0 .cse1 .cse2 (not .cse10) .cse3 (= ~c_req_type~0 (_ bv0 32)) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 (= (_ bv6 32) ~m_run_pc~0) .cse8 .cse9 (= (_ bv0 32) ~a_t~0) (not .cse7) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12))) [2021-10-13 07:50:23,067 INFO L857 garLoopResultBuilder]: For program point L753(lines 753 806) no Hoare annotation was computed. [2021-10-13 07:50:23,067 INFO L857 garLoopResultBuilder]: For program point L754(lines 754 758) no Hoare annotation was computed. [2021-10-13 07:50:23,067 INFO L857 garLoopResultBuilder]: For program point L688(lines 688 692) no Hoare annotation was computed. [2021-10-13 07:50:23,067 INFO L853 garLoopResultBuilder]: At program point L622(lines 615 632) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (not (= ~c_write_req_ev~0 (_ bv1 32)))) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_m_lock~0 (_ bv1 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv6 32) ~m_run_pc~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse5 (not (= (_ bv4 32) ~m_run_pc~0))))) [2021-10-13 07:50:23,068 INFO L853 garLoopResultBuilder]: At program point L1283(lines 1276 1311) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,068 INFO L853 garLoopResultBuilder]: At program point L226(lines 219 263) the Hoare annotation is: (let ((.cse11 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse13 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse8 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse6 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~c_req_d~0 (_ bv50 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse12 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (= (_ bv3 32) ~m_run_pc~0) .cse2 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse5 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0) .cse6 (= ~s_memory0~0 (_ bv50 32)) .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 .cse7 .cse12) (and .cse13 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse10 .cse11 .cse6 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse14 .cse7 .cse12))) [2021-10-13 07:50:23,068 INFO L857 garLoopResultBuilder]: For program point L1085(lines 1085 1089) no Hoare annotation was computed. [2021-10-13 07:50:23,068 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 07:50:23,069 INFO L857 garLoopResultBuilder]: For program point L623(lines 615 632) no Hoare annotation was computed. [2021-10-13 07:50:23,069 INFO L853 garLoopResultBuilder]: At program point L1218(lines 1211 1228) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_req~0 (_ bv1 32))) (.cse3 (= ~s_run_pc~0 (_ bv0 32))) (.cse4 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse6 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~s_run_st~0 (_ bv2 32)) .cse4 .cse5 .cse6) (and .cse0 (= ~c_req_type~0 (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) .cse1 .cse2 .cse3 (= (_ bv0 32) ~a_t~0) .cse4 .cse5 .cse6))) [2021-10-13 07:50:23,069 INFO L857 garLoopResultBuilder]: For program point L624(lines 624 628) no Hoare annotation was computed. [2021-10-13 07:50:23,069 INFO L853 garLoopResultBuilder]: At program point L426(lines 419 454) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse8) (= ~c_req_d~0 (_ bv50 32)) .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse8 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,069 INFO L853 garLoopResultBuilder]: At program point L492-2(lines 492 520) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse7 (= ~c_req_a~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv3 32) ~m_run_pc~0) .cse6 .cse7 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (not .cse10) .cse3 (= ~c_req_type~0 (_ bv0 32)) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse8 (= (_ bv6 32) ~m_run_pc~0) .cse9 (= (_ bv0 32) ~a_t~0) (not .cse7) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13))) [2021-10-13 07:50:23,070 INFO L853 garLoopResultBuilder]: At program point L360(lines 353 370) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse2 (not .cse9) (not .cse1) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse6) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11))) [2021-10-13 07:50:23,070 INFO L857 garLoopResultBuilder]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2021-10-13 07:50:23,070 INFO L857 garLoopResultBuilder]: For program point L228(lines 228 232) no Hoare annotation was computed. [2021-10-13 07:50:23,070 INFO L857 garLoopResultBuilder]: For program point L1219(lines 1167 1346) no Hoare annotation was computed. [2021-10-13 07:50:23,070 INFO L857 garLoopResultBuilder]: For program point L493(lines 492 520) no Hoare annotation was computed. [2021-10-13 07:50:23,070 INFO L857 garLoopResultBuilder]: For program point L361(lines 131 477) no Hoare annotation was computed. [2021-10-13 07:50:23,070 INFO L857 garLoopResultBuilder]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2021-10-13 07:50:23,071 INFO L857 garLoopResultBuilder]: For program point L494(lines 494 498) no Hoare annotation was computed. [2021-10-13 07:50:23,071 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-10-13 07:50:23,071 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2021-10-13 07:50:23,071 INFO L853 garLoopResultBuilder]: At program point L1023(lines 997 1024) the Hoare annotation is: (let ((.cse28 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse26 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse11 (not .cse26)) (.cse17 (not .cse28)) (.cse27 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse16 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i))) (let ((.cse1 (not .cse16)) (.cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse7 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse12 (= ~c_req_d~0 (_ bv50 32))) (.cse15 (or .cse17 .cse27)) (.cse19 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse11)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse18 (= ~s_memory1~0 (_ bv51 32))) (.cse20 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse24 (or .cse11 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse13 (= ~s_memory0~0 (_ bv50 32))) (.cse14 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse25 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse17 .cse18 .cse19 .cse20 .cse2 .cse21 .cse5 (= (_ bv0 32) ~req_tt_a~0) .cse6 .cse22 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) .cse8 .cse9 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse10 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse23 .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (not (= ~s_run_st~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 (_ bv0 32)) .cse10 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse18 .cse19 .cse20 .cse2 .cse21 .cse5 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse6 .cse22 .cse8 .cse24 .cse23 .cse13 .cse14 .cse25 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse0 .cse16 .cse18 .cse20 .cse2 .cse4 .cse5 .cse26 .cse6 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 .cse27 .cse24 .cse28 .cse13 .cse14 .cse25))))) [2021-10-13 07:50:23,071 INFO L857 garLoopResultBuilder]: For program point L561(lines 561 614) no Hoare annotation was computed. [2021-10-13 07:50:23,071 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 127) no Hoare annotation was computed. [2021-10-13 07:50:23,072 INFO L857 garLoopResultBuilder]: For program point L826(lines 826 832) no Hoare annotation was computed. [2021-10-13 07:50:23,072 INFO L853 garLoopResultBuilder]: At program point L826-1(lines 826 832) the Hoare annotation is: (let ((.cse16 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32)))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse12 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_req~0 (_ bv1 32))) (.cse13 (= (_ bv6 32) ~m_run_pc~0)) (.cse15 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse10 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32)))) (.cse14 (= ~c_m_lock~0 (_ bv0 32))) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (= ULTIMATE.start_m_run_~rsp_d___0~0 .cse16))) (or (let ((.cse9 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or .cse9 .cse10) .cse11 (or .cse12 .cse9) .cse13 .cse14 (or .cse9 .cse15) (or (= ~s_memory1~0 .cse16) .cse15) .cse17 .cse18 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) .cse19 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) .cse15 .cse10 .cse14 .cse17 .cse18 .cse19)))) [2021-10-13 07:50:23,072 INFO L853 garLoopResultBuilder]: At program point L760(lines 753 806) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))))) [2021-10-13 07:50:23,072 INFO L853 garLoopResultBuilder]: At program point L694(lines 687 722) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_m_run_~rsp_d___0~0) (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32)))))) [2021-10-13 07:50:23,073 INFO L857 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2021-10-13 07:50:23,073 INFO L853 garLoopResultBuilder]: At program point L1091(lines 1084 1101) the Hoare annotation is: (let ((.cse18 (= ~c_req_a~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse2 (not .cse21)) (.cse20 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse5 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse30 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse33 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse31 (= (_ bv3 32) ~m_run_pc~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse29 (not .cse18))) (let ((.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse13 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse29)) (.cse17 (let ((.cse34 (not (= ~c_write_rsp_ev~0 (_ bv1 32))))) (or (and .cse34 .cse30 .cse31 .cse8 .cse33) (and .cse34 .cse0 .cse31 .cse8)))) (.cse22 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse23 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse24 (or (not .cse1) .cse5)) (.cse25 (or (= ~c_req_d~0 (_ bv51 32)) .cse29)) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse27 (= ~c_req_d~0 (_ bv50 32))) (.cse28 (or .cse2 .cse20)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse19 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse26 (let ((.cse32 (= ~m_run_st~0 (_ bv0 32)))) (or (and .cse30 .cse31 .cse32 .cse8 .cse33) (and .cse0 .cse31 .cse32 .cse8)))) (.cse15 (or .cse29 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse16 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse12 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse15 .cse13 .cse14 .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse19 .cse10 .cse20 .cse15 .cse21 .cse14 .cse16) (and .cse6 .cse22 .cse23 .cse24 .cse25 .cse10 .cse11 .cse12 .cse26 .cse27 .cse14 .cse28) (and .cse6 .cse17 .cse22 .cse23 .cse24 .cse25 .cse10 .cse11 .cse12 .cse27 .cse14 .cse28) (and .cse1 .cse3 .cse5 .cse6 .cse18 .cse19 .cse10 .cse26 .cse20 .cse15 .cse21 .cse14 .cse16))))) [2021-10-13 07:50:23,073 INFO L853 garLoopResultBuilder]: At program point L1158(lines 1110 1163) the Hoare annotation is: (let ((.cse25 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse26 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (not .cse25))) (let ((.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (or (= ~s_memory1~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse27)) (.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse10 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse16 (or .cse27 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv2 32))))) (.cse19 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv2 32)))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32))) (.cse20 (not .cse26)) (.cse7 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse22 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= ~c_m_lock~0 (_ bv0 32))) (.cse5 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse4 .cse5) (and .cse6 .cse7 .cse1 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse13 (= ~c_rsp_d~0 (_ bv51 32)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32))) (and .cse6 .cse7 .cse1 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse22 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse23 .cse5 .cse24) (and .cse6 .cse7 .cse1 .cse8 .cse10 .cse11 .cse2 .cse3 .cse25 .cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse26 .cse18 .cse19) (and .cse6 .cse1 .cse11 .cse3 .cse14 .cse15 .cse5) (and .cse6 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse6 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse11 .cse3 .cse13 .cse22 .cse23 .cse5 .cse24) (and .cse6 .cse1 .cse20 (not .cse7) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse2 .cse3 .cse13 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse15 .cse21 .cse22 .cse27 (= ~c_req_d~0 (_ bv50 32)) .cse18) (and .cse6 .cse1 .cse11 .cse3 .cse13 .cse14 .cse23 .cse5))))) [2021-10-13 07:50:23,074 INFO L857 garLoopResultBuilder]: For program point L1092(lines 1084 1101) no Hoare annotation was computed. [2021-10-13 07:50:23,078 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:50:23,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:50:23 BoogieIcfgContainer [2021-10-13 07:50:23,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:50:23,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:50:23,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:50:23,253 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:50:23,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:19" (3/4) ... [2021-10-13 07:50:23,257 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:50:23,279 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-13 07:50:23,286 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 07:50:23,287 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:50:23,289 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:50:23,320 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((c_req_a == 0bv32 && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || ((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((c_req_a == 0bv32 && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,324 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,324 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(s_run_pc == 1bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((((((((((!(s_run_pc == 1bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((((((((((!(s_run_pc == 1bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,326 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((s_run_pc == 2bv32 && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32)) || ((((((((((((((((!(s_run_st == 0bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) [2021-10-13 07:50:23,332 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && s_memory0 == 50bv32) && x == 50bv32) || ((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_req_a == req_tt_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,333 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) || (((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) [2021-10-13 07:50:23,333 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) || (((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) [2021-10-13 07:50:23,336 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) [2021-10-13 07:50:23,336 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((1bv32 == i && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && (((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32))) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((2bv32 == c_write_req_ev && req_d == 50bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && (c_req_d == 51bv32 || !(c_req_a == 1bv32))) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && (((((!(s_run_st == 0bv32) && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((((((((2bv32 == c_write_req_ev && (((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32))) && req_d == 50bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && (c_req_d == 51bv32 || !(c_req_a == 1bv32))) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((1bv32 == i && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && (((((!(s_run_st == 0bv32) && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) [2021-10-13 07:50:23,336 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) [2021-10-13 07:50:23,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) [2021-10-13 07:50:23,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((!(req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a_t) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32))) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) && (!(i == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)))) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && x == 50bv32) && (!(i == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)))) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:50:23,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && x == 50bv32) [2021-10-13 07:50:23,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) [2021-10-13 07:50:23,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) [2021-10-13 07:50:23,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) [2021-10-13 07:50:23,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) [2021-10-13 07:50:23,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) [2021-10-13 07:50:23,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) [2021-10-13 07:50:23,341 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) [2021-10-13 07:50:23,341 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) [2021-10-13 07:50:23,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:50:23,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:50:23,480 INFO L168 Benchmark]: Toolchain (without parser) took 305785.37 ms. Allocated memory was 50.3 MB in the beginning and 3.5 GB in the end (delta: 3.5 GB). Free memory was 26.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,480 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 50.3 MB. Free memory was 31.3 MB in the beginning and 31.3 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:50:23,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.05 ms. Allocated memory was 50.3 MB in the beginning and 71.3 MB in the end (delta: 21.0 MB). Free memory was 26.4 MB in the beginning and 49.0 MB in the end (delta: -22.7 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.49 ms. Allocated memory is still 71.3 MB. Free memory was 49.0 MB in the beginning and 45.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,482 INFO L168 Benchmark]: Boogie Preprocessor took 115.02 ms. Allocated memory is still 71.3 MB. Free memory was 45.6 MB in the beginning and 42.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,482 INFO L168 Benchmark]: RCFGBuilder took 1240.38 ms. Allocated memory is still 71.3 MB. Free memory was 42.2 MB in the beginning and 43.5 MB in the end (delta: -1.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,483 INFO L168 Benchmark]: TraceAbstraction took 303466.41 ms. Allocated memory was 71.3 MB in the beginning and 3.5 GB in the end (delta: 3.5 GB). Free memory was 42.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,483 INFO L168 Benchmark]: Witness Printer took 225.83 ms. Allocated memory is still 3.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:50:23,485 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.20 ms. Allocated memory is still 50.3 MB. Free memory was 31.3 MB in the beginning and 31.3 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 647.05 ms. Allocated memory was 50.3 MB in the beginning and 71.3 MB in the end (delta: 21.0 MB). Free memory was 26.4 MB in the beginning and 49.0 MB in the end (delta: -22.7 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.49 ms. Allocated memory is still 71.3 MB. Free memory was 49.0 MB in the beginning and 45.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 115.02 ms. Allocated memory is still 71.3 MB. Free memory was 45.6 MB in the beginning and 42.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1240.38 ms. Allocated memory is still 71.3 MB. Free memory was 42.2 MB in the beginning and 43.5 MB in the end (delta: -1.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 303466.41 ms. Allocated memory was 71.3 MB in the beginning and 3.5 GB in the end (delta: 3.5 GB). Free memory was 42.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. * Witness Printer took 225.83 ms. Allocated memory is still 3.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 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, 272 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 303232.9ms, OverallIterations: 24, TraceHistogramMax: 9, EmptinessCheckTime: 92.4ms, AutomataDifference: 27711.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 159333.3ms, InitialAbstractionConstructionTime: 15.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 13790 SDtfs, 30410 SDslu, 54059 SDs, 0 SdLazy, 4878 SolverSat, 815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5345.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15572 GetRequests, 15202 SyntacticMatches, 0 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5196 ImplicationChecksByTransitivity, 10523.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11127occurred in iteration=10, InterpolantAutomatonStates: 307, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8846.7ms AutomataMinimizationTime, 24 MinimizatonAttempts, 78986 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 839 NumberOfFragments, 20055 HoareAnnotationTreeSize, 98 FomulaSimplifications, 1420329042 FormulaSimplificationTreeSizeReduction, 23871.7ms HoareSimplificationTime, 98 FomulaSimplificationsInter, 279207717 FormulaSimplificationTreeSizeReductionInter, 135379.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 944.9ms SsaConstructionTime, 3456.6ms SatisfiabilityAnalysisTime, 50029.5ms InterpolantComputationTime, 7661 NumberOfCodeBlocks, 7661 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 15250 ConstructedInterpolants, 0 QuantifiedInterpolants, 44365 SizeOfPredicates, 215 NumberOfNonLiveVariables, 14555 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 72 InterpolantComputations, 38 PerfectInterpolantSequences, 7360/11786 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: 924]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a == req_tt_a) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && req_a == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 0bv32 == a) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 1bv32 == req_type) && c_req_type == 1bv32) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a == req_tt_a) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && req_a == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32) || ((((((((((c_req_a == 0bv32 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || (((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32))) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((((((((((((s_run_pc == 2bv32 && (s_memory1 == 51bv32 || !(0bv32 == a_t))) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc)) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && 1bv32 == req_a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc)) && (!(req_a == 1bv32) || req_d == 51bv32)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 695]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) - InvariantResult [Line: 1211]: Loop Invariant Derived loop invariant: (((((((c_req_a == 0bv32 && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && s_run_st == 2bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) - InvariantResult [Line: 1203]: Loop Invariant Derived loop invariant: (((((((c_req_a == 0bv32 && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && s_run_st == 2bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 1030]: Loop Invariant Derived loop invariant: (((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) || (((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && x == 50bv32) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 1bv32 == req_type) && c_req_type == 1bv32) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || ((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || ((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(c_write_req_ev == 1bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1179]: Loop Invariant Derived loop invariant: (((((((c_req_a == 0bv32 && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && s_run_st == 2bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a == req_tt_a) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && req_a == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && (~bvadd64(req_tt_a, 50bv32) == s_memory1 || !(i == 1bv32))) && c_empty_req == 1bv32) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && (~bvadd64(req_tt_a, 50bv32) == s_memory1 || !(c_req_a == 1bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((!(req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a_t) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32))) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) && (!(i == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)))) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && x == 50bv32) && (!(i == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)))) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1233]: Loop Invariant Derived loop invariant: (((((((c_req_a == 0bv32 && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && s_run_st == 2bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 1276]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1046]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1084]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((1bv32 == i && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && (((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32))) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((2bv32 == c_write_req_ev && req_d == 50bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && (c_req_d == 51bv32 || !(c_req_a == 1bv32))) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && (((((!(s_run_st == 0bv32) && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((((((((2bv32 == c_write_req_ev && (((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32))) && req_d == 50bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && (c_req_d == 51bv32 || !(c_req_a == 1bv32))) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((1bv32 == i && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && (((((!(s_run_st == 0bv32) && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32) && s_run_pc == 0bv32) || (((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && m_run_st == 0bv32) && c_empty_req == 1bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && (((s_run_pc == 0bv32 && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((3bv32 == m_run_pc && s_run_pc == 0bv32) && c_empty_rsp == 1bv32))) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && 0bv32 == a) || ((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 0bv32 == a_t) && c_req_d == 50bv32)) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 1bv32 == a) && req_d == 50bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 1bv32 == req_type) && c_req_type == 1bv32) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32)) || ((((((((((req_d == 50bv32 && c_req_a == 0bv32) && (((s_run_pc == 0bv32 && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((3bv32 == m_run_pc && s_run_pc == 0bv32) && c_empty_rsp == 1bv32))) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) - InvariantResult [Line: 1195]: Loop Invariant Derived loop invariant: (((((((c_req_a == 0bv32 && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && s_run_st == 2bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: ((((((((((((((!(s_run_pc == 1bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((((((((((!(s_run_pc == 1bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((((((((((!(s_run_pc == 1bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 1062]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 482]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && !~bvslt32(a, 2bv32)) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && (~bvadd64(req_tt_a, 50bv32) == s_memory1 || !(i == 1bv32))) && c_empty_req == 1bv32) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && (~bvadd64(req_tt_a, 50bv32) == s_memory1 || !(c_req_a == 1bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32))) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 0bv32 == a) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 807]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && (((s_run_pc == 0bv32 && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((3bv32 == m_run_pc && s_run_pc == 0bv32) && c_empty_rsp == 1bv32))) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && 0bv32 == a) || ((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 0bv32 == a_t) && c_req_d == 50bv32)) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 1bv32 == a) && req_d == 50bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 1bv32 == req_type) && c_req_type == 1bv32) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32)) || ((((((((((req_d == 50bv32 && c_req_a == 0bv32) && (((s_run_pc == 0bv32 && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((3bv32 == m_run_pc && s_run_pc == 0bv32) && c_empty_rsp == 1bv32))) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a == req_tt_a) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && req_a == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && s_memory0 == 50bv32) && x == 50bv32) || ((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_req_a == req_tt_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1187]: Loop Invariant Derived loop invariant: (((((((c_req_a == 0bv32 && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && s_run_st == 2bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && !(c_m_lock == 1bv32)) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && !(m_run_pc == 1bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && !(c_m_lock == 1bv32)) && 51bv32 == v) && 2bv32 == c_write_req_ev) && !(m_run_pc == 1bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 0bv32 == a) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(c_write_req_ev == 1bv32)) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(c_write_req_ev == 1bv32)) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && v == 50bv32) && 1bv32 == req_a) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && !~bvslt32(a, 2bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) || ((((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((c_req_a == 0bv32 && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 997]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32)) || ((((((((((((((((!(s_run_st == 0bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 671]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a == req_tt_a) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && req_a == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || ((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((c_req_a == 0bv32 && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((c_req_a == 0bv32 && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && !(c_m_lock == 1bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(c_m_lock == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && v == 50bv32) && 1bv32 == req_a) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((req_d == 50bv32 && c_req_a == 0bv32) && c_req_type == 0bv32) && !(c_m_lock == 1bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && !(c_m_lock == 1bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 1bv32 == req_type) && 0bv32 == req_a) && 0bv32 == a) && 0bv32 == a_t) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || ((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((((((c_req_a == 0bv32 && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && (!(req_a == 1bv32) || req_d == 51bv32))) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((s_run_pc == 2bv32 && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1268]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1284]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && s_run_pc == 0bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && s_run_pc == 0bv32) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || ((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && c_empty_rsp == 1bv32)) || (((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_rsp == 1bv32)) || ((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 0bv32 == a_t) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) && m_run_pc == 0bv32)) || (((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 0bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && s_run_pc == 2bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) || (((((((((((((((!(c_write_rsp_ev == 1bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: (((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_d == 50bv32) && s_memory0 == 50bv32) || (((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == 0bv32) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && x == 50bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32)) || ((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) - InvariantResult [Line: 777]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && 51bv32 == rsp_d___0) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && rsp_d == 51bv32) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && rsp_d___0 == 50bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && 0bv32 == a) && rsp_d == 50bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && x == 50bv32) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && !~bvslt32(a, 2bv32)) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32 - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && (((s_run_pc == 0bv32 && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((3bv32 == m_run_pc && s_run_pc == 0bv32) && c_empty_rsp == 1bv32))) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && 0bv32 == a) || ((((((((((((s_run_pc == 2bv32 && req_d == 50bv32) && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 0bv32 == a_t) && c_req_d == 50bv32)) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !(1bv32 == i)) && 1bv32 == a) && req_d == 50bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 1bv32 == req_type) && c_req_type == 1bv32) && v == 50bv32) && 1bv32 == req_a) && c_m_lock == 1bv32) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32)) || ((((((((((req_d == 50bv32 && c_req_a == 0bv32) && (((s_run_pc == 0bv32 && c_empty_rsp == 1bv32) && m_run_pc == 0bv32) || ((3bv32 == m_run_pc && s_run_pc == 0bv32) && c_empty_rsp == 1bv32))) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && 0bv32 == req_a) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && c_req_d == 50bv32) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && (c_req_d == 51bv32 || !(c_req_a == 1bv32))) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && req_type == 1bv32) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 2bv32)) && !~bvslt32(~bvadd64(1bv32, a), 2bv32))) || (((((((((((((((((!(s_run_st == 0bv32) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && (c_req_d == 51bv32 || !(c_req_a == 1bv32))) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(req_a == 1bv32) || req_d == 51bv32)) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_a == req_tt_a) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_empty_req == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a_t), 2bv32))) && req_d == 51bv32) && (!(c_req_a == 1bv32) || !~bvslt32(~bvadd64(1bv32, a), 2bv32))) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((c_req_a == 0bv32 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && req_a == 0bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && req_a == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == req_type___0) && req_d == 51bv32) && req_a == 1bv32) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == req_type___0) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:50:23,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1e029b-ca9b-4421-954a-bcae6ecc5883/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...