./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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 8e2877807aa4495b85046b7dde4548c35f2172f1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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 8e2877807aa4495b85046b7dde4548c35f2172f1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:08:01,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:08:01,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:08:01,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:08:01,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:08:01,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:08:01,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:08:01,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:08:01,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:08:01,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:08:01,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:08:01,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:08:01,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:08:01,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:08:01,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:08:01,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:08:01,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:08:01,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:08:01,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:08:01,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:08:01,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:08:01,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:08:01,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:08:01,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:08:01,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:08:01,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:08:01,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:08:01,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:08:01,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:08:01,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:08:01,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:08:01,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:08:01,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:08:01,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:08:01,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:08:01,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:08:01,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:08:01,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:08:01,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:08:01,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:08:01,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:08:01,368 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:08:01,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:08:01,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:08:01,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:08:01,418 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:08:01,418 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:08:01,418 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:08:01,419 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:08:01,419 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:08:01,419 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:08:01,419 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:08:01,420 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:08:01,421 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:08:01,421 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:08:01,421 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:08:01,421 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:08:01,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:08:01,422 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:08:01,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:08:01,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:08:01,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:08:01,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:08:01,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:08:01,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:08:01,424 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:08:01,424 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:08:01,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:08:01,425 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:08:01,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:08:01,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:08:01,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:08:01,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:08:01,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:08:01,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:08:01,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:08:01,428 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:08:01,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:08:01,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:08:01,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:08:01,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:08:01,429 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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 -> 8e2877807aa4495b85046b7dde4548c35f2172f1 [2021-10-13 07:08:01,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:08:01,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:08:01,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:08:01,703 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:08:01,704 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:08:01,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-10-13 07:08:01,789 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/1e1beed96/83b98f8754744b5ebb6cd7bc61015c39/FLAG239e39f0d [2021-10-13 07:08:02,411 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:08:02,411 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-10-13 07:08:02,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/1e1beed96/83b98f8754744b5ebb6cd7bc61015c39/FLAG239e39f0d [2021-10-13 07:08:02,697 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/1e1beed96/83b98f8754744b5ebb6cd7bc61015c39 [2021-10-13 07:08:02,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:08:02,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:08:02,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:08:02,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:08:02,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:08:02,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:08:02" (1/1) ... [2021-10-13 07:08:02,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4d6206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:02, skipping insertion in model container [2021-10-13 07:08:02,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:08:02" (1/1) ... [2021-10-13 07:08:02,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:08:02,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:08:02,956 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-10-13 07:08:03,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:08:03,079 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:08:03,090 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-10-13 07:08:03,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:08:03,198 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:08:03,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03 WrapperNode [2021-10-13 07:08:03,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:08:03,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:08:03,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:08:03,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:08:03,208 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:08:03" (1/1) ... [2021-10-13 07:08:03,222 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:08:03" (1/1) ... [2021-10-13 07:08:03,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:08:03,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:08:03,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:08:03,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:08:03,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:08:03,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:08:03,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:08:03,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:08:03,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (1/1) ... [2021-10-13 07:08:03,401 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:08:03,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:08:03,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:08:03,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:08:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:08:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:08:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:08:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:08:04,873 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:08:04,874 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-10-13 07:08:04,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:08:04 BoogieIcfgContainer [2021-10-13 07:08:04,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:08:04,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:08:04,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:08:04,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:08:04,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:08:02" (1/3) ... [2021-10-13 07:08:04,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347ffe76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:08:04, skipping insertion in model container [2021-10-13 07:08:04,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:03" (2/3) ... [2021-10-13 07:08:04,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347ffe76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:08:04, skipping insertion in model container [2021-10-13 07:08:04,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:08:04" (3/3) ... [2021-10-13 07:08:04,888 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2021-10-13 07:08:04,895 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:08:04,895 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-10-13 07:08:04,956 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:08:04,962 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:08:04,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 07:08:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 223 states have (on average 1.7937219730941705) internal successors, (400), 228 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have 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:08:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:08:04,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:04,997 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:08:04,998 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:08:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash 46164531, now seen corresponding path program 1 times [2021-10-13 07:08:05,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:05,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203036233] [2021-10-13 07:08:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:05,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:05,197 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:08:05,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:05,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203036233] [2021-10-13 07:08:05,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203036233] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:05,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:05,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:08:05,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971027929] [2021-10-13 07:08:05,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:05,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:05,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:05,240 INFO L87 Difference]: Start difference. First operand has 229 states, 223 states have (on average 1.7937219730941705) internal successors, (400), 228 states have internal predecessors, (400), 0 states have call successors, (0), 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:08:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:05,677 INFO L93 Difference]: Finished difference Result 620 states and 1070 transitions. [2021-10-13 07:08:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:05,679 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:08:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:05,704 INFO L225 Difference]: With dead ends: 620 [2021-10-13 07:08:05,705 INFO L226 Difference]: Without dead ends: 389 [2021-10-13 07:08:05,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-10-13 07:08:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2021-10-13 07:08:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 374 states have (on average 1.5294117647058822) internal successors, (572), 378 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 572 transitions. [2021-10-13 07:08:05,817 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 572 transitions. Word has length 23 [2021-10-13 07:08:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:05,817 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 572 transitions. [2021-10-13 07:08:05,817 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:08:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 572 transitions. [2021-10-13 07:08:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 07:08:05,821 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:05,821 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:08:05,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:08:05,822 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:08:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1396815497, now seen corresponding path program 1 times [2021-10-13 07:08:05,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:05,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457050294] [2021-10-13 07:08:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:05,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:05,941 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:08:05,941 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:05,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457050294] [2021-10-13 07:08:05,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457050294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:05,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:05,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:08:05,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493297240] [2021-10-13 07:08:05,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:05,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:05,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:05,945 INFO L87 Difference]: Start difference. First operand 379 states and 572 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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:08:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:06,108 INFO L93 Difference]: Finished difference Result 983 states and 1510 transitions. [2021-10-13 07:08:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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:08:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:06,113 INFO L225 Difference]: With dead ends: 983 [2021-10-13 07:08:06,113 INFO L226 Difference]: Without dead ends: 614 [2021-10-13 07:08:06,118 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:08:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-10-13 07:08:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 604. [2021-10-13 07:08:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 599 states have (on average 1.5692821368948247) internal successors, (940), 603 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have 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:08:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 940 transitions. [2021-10-13 07:08:06,160 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 940 transitions. Word has length 34 [2021-10-13 07:08:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:06,161 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 940 transitions. [2021-10-13 07:08:06,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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:08:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 940 transitions. [2021-10-13 07:08:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 07:08:06,165 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:06,165 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] [2021-10-13 07:08:06,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:08:06,166 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:08:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1265531410, now seen corresponding path program 1 times [2021-10-13 07:08:06,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:06,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443586335] [2021-10-13 07:08:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:06,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:06,224 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:08:06,224 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:06,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443586335] [2021-10-13 07:08:06,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443586335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:06,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:06,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:08:06,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29174303] [2021-10-13 07:08:06,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:06,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:06,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:06,227 INFO L87 Difference]: Start difference. First operand 604 states and 940 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:08:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:06,278 INFO L93 Difference]: Finished difference Result 1534 states and 2393 transitions. [2021-10-13 07:08:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:06,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-13 07:08:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:06,287 INFO L225 Difference]: With dead ends: 1534 [2021-10-13 07:08:06,287 INFO L226 Difference]: Without dead ends: 940 [2021-10-13 07:08:06,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2021-10-13 07:08:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 928. [2021-10-13 07:08:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 923 states have (on average 1.5666305525460456) internal successors, (1446), 927 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have 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:08:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1446 transitions. [2021-10-13 07:08:06,345 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1446 transitions. Word has length 35 [2021-10-13 07:08:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:06,345 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 1446 transitions. [2021-10-13 07:08:06,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:08:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1446 transitions. [2021-10-13 07:08:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 07:08:06,348 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:06,348 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:08:06,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:08:06,349 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:08:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:06,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1424035153, now seen corresponding path program 1 times [2021-10-13 07:08:06,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:06,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747807530] [2021-10-13 07:08:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:06,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:08:06,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:06,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747807530] [2021-10-13 07:08:06,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747807530] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:06,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:06,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:08:06,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691922606] [2021-10-13 07:08:06,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:06,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:06,406 INFO L87 Difference]: Start difference. First operand 928 states and 1446 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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:08:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:06,486 INFO L93 Difference]: Finished difference Result 2486 states and 3890 transitions. [2021-10-13 07:08:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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:08:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:06,498 INFO L225 Difference]: With dead ends: 2486 [2021-10-13 07:08:06,498 INFO L226 Difference]: Without dead ends: 1568 [2021-10-13 07:08:06,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:08:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2021-10-13 07:08:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1466. [2021-10-13 07:08:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1461 states have (on average 1.5592060232717317) internal successors, (2278), 1465 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have 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:08:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2278 transitions. [2021-10-13 07:08:06,564 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2278 transitions. Word has length 39 [2021-10-13 07:08:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:06,565 INFO L470 AbstractCegarLoop]: Abstraction has 1466 states and 2278 transitions. [2021-10-13 07:08:06,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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:08:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2278 transitions. [2021-10-13 07:08:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:08:06,571 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:06,571 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:08:06,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:08:06,572 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:08:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2019081335, now seen corresponding path program 1 times [2021-10-13 07:08:06,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:06,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63290813] [2021-10-13 07:08:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:06,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:06,680 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:08:06,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:06,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63290813] [2021-10-13 07:08:06,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63290813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:06,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:06,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:08:06,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962851153] [2021-10-13 07:08:06,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:06,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:06,683 INFO L87 Difference]: Start difference. First operand 1466 states and 2278 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:08:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:06,905 INFO L93 Difference]: Finished difference Result 4181 states and 6483 transitions. [2021-10-13 07:08:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:06,906 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:08:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:06,923 INFO L225 Difference]: With dead ends: 4181 [2021-10-13 07:08:06,923 INFO L226 Difference]: Without dead ends: 2723 [2021-10-13 07:08:06,926 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:08:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2021-10-13 07:08:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2667. [2021-10-13 07:08:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2662 states have (on average 1.5326821938392186) internal successors, (4080), 2666 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have 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:08:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4080 transitions. [2021-10-13 07:08:07,080 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4080 transitions. Word has length 47 [2021-10-13 07:08:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:07,081 INFO L470 AbstractCegarLoop]: Abstraction has 2667 states and 4080 transitions. [2021-10-13 07:08:07,081 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:08:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4080 transitions. [2021-10-13 07:08:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:08:07,083 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:07,083 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:08:07,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:08:07,083 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:08:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1756772577, now seen corresponding path program 1 times [2021-10-13 07:08:07,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:07,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132389973] [2021-10-13 07:08:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:07,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:08:07,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:07,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132389973] [2021-10-13 07:08:07,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132389973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:07,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:07,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:08:07,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913095193] [2021-10-13 07:08:07,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:07,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:07,167 INFO L87 Difference]: Start difference. First operand 2667 states and 4080 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:08:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:07,337 INFO L93 Difference]: Finished difference Result 6263 states and 9547 transitions. [2021-10-13 07:08:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:07,338 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:08:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:07,361 INFO L225 Difference]: With dead ends: 6263 [2021-10-13 07:08:07,361 INFO L226 Difference]: Without dead ends: 3605 [2021-10-13 07:08:07,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2021-10-13 07:08:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3457. [2021-10-13 07:08:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3457 states, 3452 states have (on average 1.515063731170336) internal successors, (5230), 3456 states have internal predecessors, (5230), 0 states have call successors, (0), 0 states have 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:08:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 5230 transitions. [2021-10-13 07:08:07,578 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 5230 transitions. Word has length 47 [2021-10-13 07:08:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:07,579 INFO L470 AbstractCegarLoop]: Abstraction has 3457 states and 5230 transitions. [2021-10-13 07:08:07,579 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:08:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 5230 transitions. [2021-10-13 07:08:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:08:07,581 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:07,582 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:08:07,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:08:07,582 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:08:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1140987107, now seen corresponding path program 1 times [2021-10-13 07:08:07,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:07,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982661292] [2021-10-13 07:08:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:07,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:07,627 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:08:07,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:07,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982661292] [2021-10-13 07:08:07,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982661292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:07,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:07,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:08:07,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393024315] [2021-10-13 07:08:07,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:07,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:07,630 INFO L87 Difference]: Start difference. First operand 3457 states and 5230 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:08:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:08,103 INFO L93 Difference]: Finished difference Result 8357 states and 12684 transitions. [2021-10-13 07:08:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:08,103 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:08:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:08,134 INFO L225 Difference]: With dead ends: 8357 [2021-10-13 07:08:08,134 INFO L226 Difference]: Without dead ends: 4909 [2021-10-13 07:08:08,140 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:08:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2021-10-13 07:08:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4830. [2021-10-13 07:08:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4830 states, 4825 states have (on average 1.484559585492228) internal successors, (7163), 4829 states have internal predecessors, (7163), 0 states have call successors, (0), 0 states have 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:08:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7163 transitions. [2021-10-13 07:08:08,424 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7163 transitions. Word has length 52 [2021-10-13 07:08:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:08,427 INFO L470 AbstractCegarLoop]: Abstraction has 4830 states and 7163 transitions. [2021-10-13 07:08:08,427 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:08:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7163 transitions. [2021-10-13 07:08:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 07:08:08,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:08,429 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:08:08,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:08:08,430 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:08:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -297633457, now seen corresponding path program 1 times [2021-10-13 07:08:08,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:08,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3999666] [2021-10-13 07:08:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:08,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:08,506 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:08:08,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:08,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3999666] [2021-10-13 07:08:08,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3999666] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:08,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:08,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:08:08,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811772621] [2021-10-13 07:08:08,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:08,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:08,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:08,509 INFO L87 Difference]: Start difference. First operand 4830 states and 7163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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:08:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:08,786 INFO L93 Difference]: Finished difference Result 9651 states and 14317 transitions. [2021-10-13 07:08:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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:08:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:08,816 INFO L225 Difference]: With dead ends: 9651 [2021-10-13 07:08:08,816 INFO L226 Difference]: Without dead ends: 4830 [2021-10-13 07:08:08,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2021-10-13 07:08:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4830. [2021-10-13 07:08:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4830 states, 4825 states have (on average 1.4696373056994818) internal successors, (7091), 4829 states have internal predecessors, (7091), 0 states have call successors, (0), 0 states have 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:08:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7091 transitions. [2021-10-13 07:08:09,105 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7091 transitions. Word has length 54 [2021-10-13 07:08:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:09,106 INFO L470 AbstractCegarLoop]: Abstraction has 4830 states and 7091 transitions. [2021-10-13 07:08:09,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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:08:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7091 transitions. [2021-10-13 07:08:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-13 07:08:09,108 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:09,108 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] [2021-10-13 07:08:09,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:08:09,108 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:08:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1779368046, now seen corresponding path program 1 times [2021-10-13 07:08:09,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:09,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040084281] [2021-10-13 07:08:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:09,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:09,179 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:08:09,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:09,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040084281] [2021-10-13 07:08:09,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040084281] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:09,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:09,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:08:09,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190985533] [2021-10-13 07:08:09,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:09,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:09,188 INFO L87 Difference]: Start difference. First operand 4830 states and 7091 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:08:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:09,747 INFO L93 Difference]: Finished difference Result 10974 states and 16083 transitions. [2021-10-13 07:08:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-10-13 07:08:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:09,785 INFO L225 Difference]: With dead ends: 10974 [2021-10-13 07:08:09,786 INFO L226 Difference]: Without dead ends: 6153 [2021-10-13 07:08:09,793 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:08:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2021-10-13 07:08:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 6067. [2021-10-13 07:08:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6067 states, 6062 states have (on average 1.4302210491586935) internal successors, (8670), 6066 states have internal predecessors, (8670), 0 states have call successors, (0), 0 states have 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:08:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6067 states to 6067 states and 8670 transitions. [2021-10-13 07:08:10,206 INFO L78 Accepts]: Start accepts. Automaton has 6067 states and 8670 transitions. Word has length 55 [2021-10-13 07:08:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:10,207 INFO L470 AbstractCegarLoop]: Abstraction has 6067 states and 8670 transitions. [2021-10-13 07:08:10,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:08:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6067 states and 8670 transitions. [2021-10-13 07:08:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-13 07:08:10,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:10,210 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:08:10,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:08:10,211 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:08:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1611869876, now seen corresponding path program 1 times [2021-10-13 07:08:10,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:10,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556684957] [2021-10-13 07:08:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:10,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:10,291 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:08:10,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:10,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556684957] [2021-10-13 07:08:10,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556684957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:10,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:10,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:08:10,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025263372] [2021-10-13 07:08:10,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:08:10,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:08:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:08:10,293 INFO L87 Difference]: Start difference. First operand 6067 states and 8670 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 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:08:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:11,813 INFO L93 Difference]: Finished difference Result 31355 states and 44614 transitions. [2021-10-13 07:08:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 07:08:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 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:08:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:11,908 INFO L225 Difference]: With dead ends: 31355 [2021-10-13 07:08:11,908 INFO L226 Difference]: Without dead ends: 25297 [2021-10-13 07:08:11,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 87.7ms TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-10-13 07:08:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25297 states. [2021-10-13 07:08:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25297 to 8379. [2021-10-13 07:08:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8379 states, 8374 states have (on average 1.4184380224504418) internal successors, (11878), 8378 states have internal predecessors, (11878), 0 states have call successors, (0), 0 states have 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:08:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 11878 transitions. [2021-10-13 07:08:12,618 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 11878 transitions. Word has length 57 [2021-10-13 07:08:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:12,620 INFO L470 AbstractCegarLoop]: Abstraction has 8379 states and 11878 transitions. [2021-10-13 07:08:12,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 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:08:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 11878 transitions. [2021-10-13 07:08:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 07:08:12,623 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:12,623 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:08:12,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:08:12,624 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:08:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 853756561, now seen corresponding path program 1 times [2021-10-13 07:08:12,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:12,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624486988] [2021-10-13 07:08:12,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:12,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:12,664 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:08:12,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:12,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624486988] [2021-10-13 07:08:12,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624486988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:12,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:12,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:08:12,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297903148] [2021-10-13 07:08:12,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:12,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:12,669 INFO L87 Difference]: Start difference. First operand 8379 states and 11878 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:13,151 INFO L93 Difference]: Finished difference Result 15946 states and 22728 transitions. [2021-10-13 07:08:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:13,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-13 07:08:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:13,171 INFO L225 Difference]: With dead ends: 15946 [2021-10-13 07:08:13,171 INFO L226 Difference]: Without dead ends: 7576 [2021-10-13 07:08:13,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7576 states. [2021-10-13 07:08:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7576 to 5064. [2021-10-13 07:08:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5064 states, 5059 states have (on average 1.4109507807867168) internal successors, (7138), 5063 states have internal predecessors, (7138), 0 states have call successors, (0), 0 states have 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:08:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5064 states to 5064 states and 7138 transitions. [2021-10-13 07:08:13,471 INFO L78 Accepts]: Start accepts. Automaton has 5064 states and 7138 transitions. Word has length 58 [2021-10-13 07:08:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:13,471 INFO L470 AbstractCegarLoop]: Abstraction has 5064 states and 7138 transitions. [2021-10-13 07:08:13,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5064 states and 7138 transitions. [2021-10-13 07:08:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 07:08:13,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:13,473 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:08:13,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:08:13,474 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:08:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1985646857, now seen corresponding path program 1 times [2021-10-13 07:08:13,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:13,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569128438] [2021-10-13 07:08:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:13,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:13,532 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:08:13,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:13,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569128438] [2021-10-13 07:08:13,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569128438] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:13,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:13,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:08:13,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352907286] [2021-10-13 07:08:13,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:08:13,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:13,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:08:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:08:13,535 INFO L87 Difference]: Start difference. First operand 5064 states and 7138 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:15,711 INFO L93 Difference]: Finished difference Result 34546 states and 48771 transitions. [2021-10-13 07:08:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-13 07:08:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-13 07:08:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:15,790 INFO L225 Difference]: With dead ends: 34546 [2021-10-13 07:08:15,791 INFO L226 Difference]: Without dead ends: 29596 [2021-10-13 07:08:15,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 202.8ms TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-10-13 07:08:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29596 states. [2021-10-13 07:08:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29596 to 5376. [2021-10-13 07:08:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5376 states, 5371 states have (on average 1.4038354123999255) internal successors, (7540), 5375 states have internal predecessors, (7540), 0 states have call successors, (0), 0 states have 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:08:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 7540 transitions. [2021-10-13 07:08:16,384 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 7540 transitions. Word has length 58 [2021-10-13 07:08:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:16,385 INFO L470 AbstractCegarLoop]: Abstraction has 5376 states and 7540 transitions. [2021-10-13 07:08:16,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 7540 transitions. [2021-10-13 07:08:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-13 07:08:16,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:16,390 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:08:16,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:08:16,390 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:08:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 130503803, now seen corresponding path program 1 times [2021-10-13 07:08:16,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:16,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314609750] [2021-10-13 07:08:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:16,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:16,429 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:08:16,429 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:16,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314609750] [2021-10-13 07:08:16,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314609750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:16,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:16,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:08:16,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202486714] [2021-10-13 07:08:16,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:16,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:16,433 INFO L87 Difference]: Start difference. First operand 5376 states and 7540 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:08:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:16,837 INFO L93 Difference]: Finished difference Result 11356 states and 15887 transitions. [2021-10-13 07:08:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:16,838 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:08:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:16,850 INFO L225 Difference]: With dead ends: 11356 [2021-10-13 07:08:16,850 INFO L226 Difference]: Without dead ends: 6009 [2021-10-13 07:08:16,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2021-10-13 07:08:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5421. [2021-10-13 07:08:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5421 states, 5416 states have (on average 1.4017725258493352) internal successors, (7592), 5420 states have internal predecessors, (7592), 0 states have call successors, (0), 0 states have 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:08:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 7592 transitions. [2021-10-13 07:08:17,263 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 7592 transitions. Word has length 70 [2021-10-13 07:08:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:17,264 INFO L470 AbstractCegarLoop]: Abstraction has 5421 states and 7592 transitions. [2021-10-13 07:08:17,264 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:08:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 7592 transitions. [2021-10-13 07:08:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-13 07:08:17,270 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:17,270 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:08:17,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:08:17,271 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:08:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash -89388067, now seen corresponding path program 1 times [2021-10-13 07:08:17,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:17,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838037620] [2021-10-13 07:08:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:17,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:17,315 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:08:17,316 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:17,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838037620] [2021-10-13 07:08:17,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838037620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:17,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:17,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:08:17,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368525876] [2021-10-13 07:08:17,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:08:17,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:08:17,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:17,318 INFO L87 Difference]: Start difference. First operand 5421 states and 7592 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:08:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:17,769 INFO L93 Difference]: Finished difference Result 12963 states and 18091 transitions. [2021-10-13 07:08:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:08:17,770 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:08:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:17,784 INFO L225 Difference]: With dead ends: 12963 [2021-10-13 07:08:17,784 INFO L226 Difference]: Without dead ends: 7494 [2021-10-13 07:08:17,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:08:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7494 states. [2021-10-13 07:08:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7494 to 6188. [2021-10-13 07:08:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6188 states, 6183 states have (on average 1.3897784247129226) internal successors, (8593), 6187 states have internal predecessors, (8593), 0 states have call successors, (0), 0 states have 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:08:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8593 transitions. [2021-10-13 07:08:18,332 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8593 transitions. Word has length 80 [2021-10-13 07:08:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:18,333 INFO L470 AbstractCegarLoop]: Abstraction has 6188 states and 8593 transitions. [2021-10-13 07:08:18,333 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:08:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8593 transitions. [2021-10-13 07:08:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-13 07:08:18,335 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:18,335 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:08:18,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:08:18,336 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:08:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1020519040, now seen corresponding path program 1 times [2021-10-13 07:08:18,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:18,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453129994] [2021-10-13 07:08:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:18,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:18,376 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:08:18,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:18,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453129994] [2021-10-13 07:08:18,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453129994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:18,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:18,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:08:18,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653129787] [2021-10-13 07:08:18,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:18,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:18,379 INFO L87 Difference]: Start difference. First operand 6188 states and 8593 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:08:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:18,660 INFO L93 Difference]: Finished difference Result 9069 states and 12683 transitions. [2021-10-13 07:08:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:18,660 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:08:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:18,664 INFO L225 Difference]: With dead ends: 9069 [2021-10-13 07:08:18,664 INFO L226 Difference]: Without dead ends: 2847 [2021-10-13 07:08:18,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:08:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2021-10-13 07:08:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2811. [2021-10-13 07:08:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2806 states have (on average 1.3389166072701355) internal successors, (3757), 2810 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have 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:08:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 3757 transitions. [2021-10-13 07:08:18,881 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 3757 transitions. Word has length 85 [2021-10-13 07:08:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:18,882 INFO L470 AbstractCegarLoop]: Abstraction has 2811 states and 3757 transitions. [2021-10-13 07:08:18,882 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:08:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3757 transitions. [2021-10-13 07:08:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-13 07:08:18,883 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:18,884 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:08:18,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:08:18,884 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:08:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash -527991633, now seen corresponding path program 1 times [2021-10-13 07:08:18,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:18,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684062093] [2021-10-13 07:08:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:18,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:18,926 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:08:18,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:18,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684062093] [2021-10-13 07:08:18,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684062093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:18,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:18,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:08:18,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029367558] [2021-10-13 07:08:18,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:08:18,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:08:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:08:18,929 INFO L87 Difference]: Start difference. First operand 2811 states and 3757 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:08:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:19,737 INFO L93 Difference]: Finished difference Result 11237 states and 15142 transitions. [2021-10-13 07:08:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:08:19,738 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:08:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:19,750 INFO L225 Difference]: With dead ends: 11237 [2021-10-13 07:08:19,750 INFO L226 Difference]: Without dead ends: 8544 [2021-10-13 07:08:19,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 24.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:08:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2021-10-13 07:08:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 2813. [2021-10-13 07:08:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2808 states have (on average 1.335826210826211) internal successors, (3751), 2812 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have 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:08:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3751 transitions. [2021-10-13 07:08:20,057 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3751 transitions. Word has length 90 [2021-10-13 07:08:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:20,057 INFO L470 AbstractCegarLoop]: Abstraction has 2813 states and 3751 transitions. [2021-10-13 07:08:20,057 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:08:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3751 transitions. [2021-10-13 07:08:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-13 07:08:20,059 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:20,059 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:08:20,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:08:20,059 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:08:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash -982544054, now seen corresponding path program 1 times [2021-10-13 07:08:20,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:20,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381260644] [2021-10-13 07:08:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:20,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:20,141 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:08:20,141 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:20,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381260644] [2021-10-13 07:08:20,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381260644] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:08:20,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935039257] [2021-10-13 07:08:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:20,143 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:08:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:08:20,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:08:20,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:08:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:20,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:20,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:20,611 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:08:20,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:20,893 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:08:20,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935039257] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:20,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:08:20,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2021-10-13 07:08:20,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360961819] [2021-10-13 07:08:20,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:20,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:08:20,896 INFO L87 Difference]: Start difference. First operand 2813 states and 3751 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:08:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:21,288 INFO L93 Difference]: Finished difference Result 2831 states and 3765 transitions. [2021-10-13 07:08:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:21,289 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:08:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:21,293 INFO L225 Difference]: With dead ends: 2831 [2021-10-13 07:08:21,294 INFO L226 Difference]: Without dead ends: 2827 [2021-10-13 07:08:21,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:08:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2021-10-13 07:08:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2813. [2021-10-13 07:08:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2808 states have (on average 1.3304843304843306) internal successors, (3736), 2812 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have 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:08:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3736 transitions. [2021-10-13 07:08:21,635 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3736 transitions. Word has length 92 [2021-10-13 07:08:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:21,635 INFO L470 AbstractCegarLoop]: Abstraction has 2813 states and 3736 transitions. [2021-10-13 07:08:21,636 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:08:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3736 transitions. [2021-10-13 07:08:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-13 07:08:21,640 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:21,640 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:08:21,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:21,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 07:08:21,866 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:08:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash -116038196, now seen corresponding path program 1 times [2021-10-13 07:08:21,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:21,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908346999] [2021-10-13 07:08:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:21,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:08:21,934 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:21,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908346999] [2021-10-13 07:08:21,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908346999] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:08:21,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184694396] [2021-10-13 07:08:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:21,935 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:08:21,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:08:21,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:08:21,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 07:08:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:22,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:22,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:08:22,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:08:23,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184694396] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:23,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:08:23,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2021-10-13 07:08:23,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33293208] [2021-10-13 07:08:23,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:23,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:08:23,020 INFO L87 Difference]: Start difference. First operand 2813 states and 3736 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have 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:08:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:23,346 INFO L93 Difference]: Finished difference Result 5486 states and 7320 transitions. [2021-10-13 07:08:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:23,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:08:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:23,352 INFO L225 Difference]: With dead ends: 5486 [2021-10-13 07:08:23,352 INFO L226 Difference]: Without dead ends: 2813 [2021-10-13 07:08:23,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:08:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-10-13 07:08:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2813. [2021-10-13 07:08:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2808 states have (on average 1.2991452991452992) internal successors, (3648), 2812 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3648 transitions. [2021-10-13 07:08:23,626 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3648 transitions. Word has length 146 [2021-10-13 07:08:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:23,627 INFO L470 AbstractCegarLoop]: Abstraction has 2813 states and 3648 transitions. [2021-10-13 07:08:23,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have 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:08:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3648 transitions. [2021-10-13 07:08:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-13 07:08:23,631 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:23,631 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:08:23,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:23,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 07:08:23,858 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:08:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash -944002485, now seen corresponding path program 1 times [2021-10-13 07:08:23,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:23,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197836589] [2021-10-13 07:08:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:23,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:08:23,951 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:23,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197836589] [2021-10-13 07:08:23,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197836589] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:08:23,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865389132] [2021-10-13 07:08:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:23,952 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:08:23,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:08:23,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:08:23,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 07:08:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:24,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:24,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 07:08:24,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 07:08:24,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865389132] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:24,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:08:24,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2021-10-13 07:08:24,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591669388] [2021-10-13 07:08:24,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:24,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:08:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:08:24,872 INFO L87 Difference]: Start difference. First operand 2813 states and 3648 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:08:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:25,192 INFO L93 Difference]: Finished difference Result 5486 states and 7144 transitions. [2021-10-13 07:08:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:25,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 149 [2021-10-13 07:08:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:25,197 INFO L225 Difference]: With dead ends: 5486 [2021-10-13 07:08:25,198 INFO L226 Difference]: Without dead ends: 2813 [2021-10-13 07:08:25,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:08:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-10-13 07:08:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2813. [2021-10-13 07:08:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2808 states have (on average 1.2813390313390314) internal successors, (3598), 2812 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have 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:08:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3598 transitions. [2021-10-13 07:08:25,468 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3598 transitions. Word has length 149 [2021-10-13 07:08:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:25,468 INFO L470 AbstractCegarLoop]: Abstraction has 2813 states and 3598 transitions. [2021-10-13 07:08:25,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:08:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3598 transitions. [2021-10-13 07:08:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-13 07:08:25,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:25,472 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, 1] [2021-10-13 07:08:25,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-10-13 07:08:25,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:08:25,686 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:08:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash 148803528, now seen corresponding path program 1 times [2021-10-13 07:08:25,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:08:25,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587349390] [2021-10-13 07:08:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:25,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:08:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:25,835 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:08:25,836 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:08:25,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587349390] [2021-10-13 07:08:25,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587349390] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:08:25,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839287840] [2021-10-13 07:08:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:25,837 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:08:25,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:08:25,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:08:25,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 07:08:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:26,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 07:08:26,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:26,820 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:08:26,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:27,335 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:08:27,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839287840] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:08:27,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [958491946] [2021-10-13 07:08:27,361 INFO L159 IcfgInterpreter]: Started Sifa with 103 locations of interest [2021-10-13 07:08:27,362 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:08:27,367 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:08:27,373 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:08:27,373 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:08:33,862 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:33,871 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:08:33,872 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:33,873 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 07:08:33,874 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:08:33,875 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:33,875 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:08:33,895 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 277 [2021-10-13 07:08:33,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:08:33,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:08:33,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:08:33,950 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:08:33,951 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:33,952 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:08:33,953 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:33,953 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:08:33,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:08:33,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:08:33,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:34,007 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:08:34,023 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 251 [2021-10-13 07:08:34,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:08:34,024 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:248, output treesize:251 [2021-10-13 07:08:34,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:34,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:08:34,246 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:08:34,250 INFO L168 Benchmark]: Toolchain (without parser) took 31549.05 ms. Allocated memory was 100.7 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 66.0 MB in the beginning and 3.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 610.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:08:34,251 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 100.7 MB. Free memory is still 53.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:08:34,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.96 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 65.7 MB in the beginning and 92.5 MB in the end (delta: -26.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:08:34,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.63 ms. Allocated memory is still 125.8 MB. Free memory was 92.5 MB in the beginning and 89.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:08:34,252 INFO L168 Benchmark]: Boogie Preprocessor took 69.73 ms. Allocated memory is still 125.8 MB. Free memory was 89.0 MB in the beginning and 85.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:08:34,252 INFO L168 Benchmark]: RCFGBuilder took 1505.59 ms. Allocated memory is still 125.8 MB. Free memory was 85.5 MB in the beginning and 81.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:08:34,252 INFO L168 Benchmark]: TraceAbstraction took 29370.28 ms. Allocated memory was 125.8 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 80.8 MB in the beginning and 3.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 599.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:08:34,260 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 100.7 MB. Free memory is still 53.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 495.96 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 65.7 MB in the beginning and 92.5 MB in the end (delta: -26.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 86.63 ms. Allocated memory is still 125.8 MB. Free memory was 92.5 MB in the beginning and 89.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.73 ms. Allocated memory is still 125.8 MB. Free memory was 89.0 MB in the beginning and 85.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1505.59 ms. Allocated memory is still 125.8 MB. Free memory was 85.5 MB in the beginning and 81.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29370.28 ms. Allocated memory was 125.8 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 80.8 MB in the beginning and 3.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 599.2 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:08:34,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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:08:36,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:08:36,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:08:36,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:08:36,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:08:36,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:08:36,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:08:36,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:08:36,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:08:36,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:08:36,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:08:36,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:08:36,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:08:36,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:08:36,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:08:36,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:08:36,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:08:36,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:08:36,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:08:36,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:08:36,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:08:36,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:08:36,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:08:36,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:08:36,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:08:37,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:08:37,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:08:37,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:08:37,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:08:37,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:08:37,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:08:37,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:08:37,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:08:37,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:08:37,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:08:37,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:08:37,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:08:37,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:08:37,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:08:37,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:08:37,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:08:37,025 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 07:08:37,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:08:37,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:08:37,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:08:37,079 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:08:37,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:08:37,080 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:08:37,080 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:08:37,080 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:08:37,080 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:08:37,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:08:37,083 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:08:37,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:08:37,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:08:37,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:08:37,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:08:37,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:08:37,085 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:08:37,085 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:08:37,085 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:08:37,085 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:08:37,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:08:37,086 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:08:37,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:08:37,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:08:37,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:08:37,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:08:37,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:08:37,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:08:37,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:08:37,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:08:37,088 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:08:37,088 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:08:37,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:08:37,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:08:37,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:08:37,089 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/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 -> 8e2877807aa4495b85046b7dde4548c35f2172f1 [2021-10-13 07:08:37,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:08:37,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:08:37,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:08:37,554 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:08:37,554 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:08:37,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-10-13 07:08:37,654 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/6c9e33aeb/9f2130a278944d1ca3439e4b9acb695f/FLAG88119ee6a [2021-10-13 07:08:38,322 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:08:38,323 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2021-10-13 07:08:38,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/6c9e33aeb/9f2130a278944d1ca3439e4b9acb695f/FLAG88119ee6a [2021-10-13 07:08:38,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/data/6c9e33aeb/9f2130a278944d1ca3439e4b9acb695f [2021-10-13 07:08:38,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:08:38,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:08:38,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:08:38,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:08:38,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:08:38,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:08:38" (1/1) ... [2021-10-13 07:08:38,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27eedd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:38, skipping insertion in model container [2021-10-13 07:08:38,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:08:38" (1/1) ... [2021-10-13 07:08:38,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:08:38,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:08:38,806 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-10-13 07:08:39,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:08:39,028 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:08:39,040 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_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c[341,354] [2021-10-13 07:08:39,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:08:39,136 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:08:39,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39 WrapperNode [2021-10-13 07:08:39,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:08:39,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:08:39,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:08:39,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:08:39,146 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:08:39" (1/1) ... [2021-10-13 07:08:39,168 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:08:39" (1/1) ... [2021-10-13 07:08:39,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:08:39,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:08:39,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:08:39,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:08:39,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:08:39,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:08:39,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:08:39,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:08:39,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (1/1) ... [2021-10-13 07:08:39,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:08:39,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:08:39,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:08:39,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:08:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:08:39,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:08:39,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:08:39,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:08:40,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:08:40,378 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-10-13 07:08:40,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:08:40 BoogieIcfgContainer [2021-10-13 07:08:40,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:08:40,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:08:40,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:08:40,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:08:40,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:08:38" (1/3) ... [2021-10-13 07:08:40,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd2b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:08:40, skipping insertion in model container [2021-10-13 07:08:40,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:08:39" (2/3) ... [2021-10-13 07:08:40,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd2b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:08:40, skipping insertion in model container [2021-10-13 07:08:40,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:08:40" (3/3) ... [2021-10-13 07:08:40,390 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2021-10-13 07:08:40,395 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:08:40,395 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-10-13 07:08:40,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:08:40,456 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:08:40,456 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-13 07:08:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 268 states have (on average 1.8656716417910448) internal successors, (500), 273 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:08:40,490 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:40,491 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:08:40,492 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:08:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-10-13 07:08:40,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:40,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629723248] [2021-10-13 07:08:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:40,513 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:40,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:40,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:40,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:08:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:40,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-13 07:08:40,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:40,749 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:08:40,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:40,815 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:08:40,816 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:40,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629723248] [2021-10-13 07:08:40,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629723248] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:40,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:40,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 07:08:40,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405560949] [2021-10-13 07:08:40,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 07:08:40,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 07:08:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 07:08:40,842 INFO L87 Difference]: Start difference. First operand has 274 states, 268 states have (on average 1.8656716417910448) internal successors, (500), 273 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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:08:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:40,891 INFO L93 Difference]: Finished difference Result 528 states and 962 transitions. [2021-10-13 07:08:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 07:08:40,893 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:08:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:40,906 INFO L225 Difference]: With dead ends: 528 [2021-10-13 07:08:40,907 INFO L226 Difference]: Without dead ends: 270 [2021-10-13 07:08:40,911 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:08:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-13 07:08:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 07:08:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.7547169811320755) internal successors, (465), 269 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have 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:08:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 465 transitions. [2021-10-13 07:08:40,969 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 465 transitions. Word has length 28 [2021-10-13 07:08:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:40,969 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 465 transitions. [2021-10-13 07:08:40,970 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:08:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 465 transitions. [2021-10-13 07:08:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:08:40,973 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:40,973 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:08:40,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:41,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:41,186 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:08:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1685611844, now seen corresponding path program 1 times [2021-10-13 07:08:41,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:41,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181689414] [2021-10-13 07:08:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:41,188 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:41,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:41,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:08:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:41,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:41,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:41,396 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:08:41,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:41,496 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:08:41,497 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:41,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181689414] [2021-10-13 07:08:41,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181689414] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:41,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:41,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:08:41,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469131719] [2021-10-13 07:08:41,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:08:41,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:08:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:41,503 INFO L87 Difference]: Start difference. First operand 270 states and 465 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:08:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:42,094 INFO L93 Difference]: Finished difference Result 897 states and 1513 transitions. [2021-10-13 07:08:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:08:42,095 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:08:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:42,101 INFO L225 Difference]: With dead ends: 897 [2021-10-13 07:08:42,101 INFO L226 Difference]: Without dead ends: 632 [2021-10-13 07:08:42,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-13 07:08:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 600. [2021-10-13 07:08:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.6184873949579832) internal successors, (963), 599 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have 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:08:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 963 transitions. [2021-10-13 07:08:42,180 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 963 transitions. Word has length 29 [2021-10-13 07:08:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:42,184 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 963 transitions. [2021-10-13 07:08:42,184 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:08:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 963 transitions. [2021-10-13 07:08:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 07:08:42,192 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:42,193 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:08:42,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:42,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:42,404 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:08:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2021-10-13 07:08:42,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:42,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587701636] [2021-10-13 07:08:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:42,406 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:42,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:42,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:42,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:08:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:42,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:42,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:42,617 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:08:42,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:42,736 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:08:42,736 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:42,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587701636] [2021-10-13 07:08:42,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587701636] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:42,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:42,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:08:42,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799732223] [2021-10-13 07:08:42,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:42,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:42,739 INFO L87 Difference]: Start difference. First operand 600 states and 963 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:08:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:42,902 INFO L93 Difference]: Finished difference Result 1627 states and 2638 transitions. [2021-10-13 07:08:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:42,902 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:08:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:42,909 INFO L225 Difference]: With dead ends: 1627 [2021-10-13 07:08:42,910 INFO L226 Difference]: Without dead ends: 1041 [2021-10-13 07:08:42,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-10-13 07:08:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1025. [2021-10-13 07:08:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.6431372549019607) internal successors, (1676), 1024 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:08:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1676 transitions. [2021-10-13 07:08:42,961 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1676 transitions. Word has length 38 [2021-10-13 07:08:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:42,962 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1676 transitions. [2021-10-13 07:08:42,962 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:08:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1676 transitions. [2021-10-13 07:08:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 07:08:42,964 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:42,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:08:42,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:43,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:43,176 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:08:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2021-10-13 07:08:43,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:43,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15973885] [2021-10-13 07:08:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:43,178 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:43,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:43,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:08:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:43,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:43,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:43,436 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:08:43,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:43,554 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:08:43,555 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:43,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15973885] [2021-10-13 07:08:43,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15973885] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:43,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:43,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:08:43,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124777840] [2021-10-13 07:08:43,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:43,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:43,561 INFO L87 Difference]: Start difference. First operand 1025 states and 1676 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:43,651 INFO L93 Difference]: Finished difference Result 2493 states and 4061 transitions. [2021-10-13 07:08:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:43,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 07:08:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:43,663 INFO L225 Difference]: With dead ends: 2493 [2021-10-13 07:08:43,663 INFO L226 Difference]: Without dead ends: 1493 [2021-10-13 07:08:43,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-10-13 07:08:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1480. [2021-10-13 07:08:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1475 states have (on average 1.6257627118644067) internal successors, (2398), 1479 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have 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:08:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2398 transitions. [2021-10-13 07:08:43,767 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2398 transitions. Word has length 39 [2021-10-13 07:08:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:43,767 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 2398 transitions. [2021-10-13 07:08:43,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:08:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2398 transitions. [2021-10-13 07:08:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 07:08:43,769 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:43,770 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:08:43,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:43,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:43,973 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:08:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:43,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1856020536, now seen corresponding path program 1 times [2021-10-13 07:08:43,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:43,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556949910] [2021-10-13 07:08:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:43,974 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:43,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:43,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:43,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:08:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:44,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:44,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:44,264 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:08:44,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:44,421 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:08:44,421 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:44,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556949910] [2021-10-13 07:08:44,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556949910] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:44,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:44,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:08:44,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530644410] [2021-10-13 07:08:44,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:08:44,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:08:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:44,424 INFO L87 Difference]: Start difference. First operand 1480 states and 2398 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:08:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:44,570 INFO L93 Difference]: Finished difference Result 3885 states and 6290 transitions. [2021-10-13 07:08:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:08:44,571 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:08:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:44,586 INFO L225 Difference]: With dead ends: 3885 [2021-10-13 07:08:44,587 INFO L226 Difference]: Without dead ends: 2430 [2021-10-13 07:08:44,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2021-10-13 07:08:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2318. [2021-10-13 07:08:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2313 states have (on average 1.6078685689580632) internal successors, (3719), 2317 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states have 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:08:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3719 transitions. [2021-10-13 07:08:44,726 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3719 transitions. Word has length 47 [2021-10-13 07:08:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:44,727 INFO L470 AbstractCegarLoop]: Abstraction has 2318 states and 3719 transitions. [2021-10-13 07:08:44,727 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:08:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3719 transitions. [2021-10-13 07:08:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:08:44,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:44,729 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:08:44,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:44,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:44,941 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:08:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-10-13 07:08:44,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:44,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800131337] [2021-10-13 07:08:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:44,943 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:44,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:44,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:08:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:45,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:45,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:45,276 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:08:45,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:45,442 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:08:45,442 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:45,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800131337] [2021-10-13 07:08:45,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800131337] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:45,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:45,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:08:45,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739015832] [2021-10-13 07:08:45,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:08:45,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:08:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:45,445 INFO L87 Difference]: Start difference. First operand 2318 states and 3719 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:08:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:45,893 INFO L93 Difference]: Finished difference Result 7891 states and 12582 transitions. [2021-10-13 07:08:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:08:45,894 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:08:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:45,927 INFO L225 Difference]: With dead ends: 7891 [2021-10-13 07:08:45,927 INFO L226 Difference]: Without dead ends: 5592 [2021-10-13 07:08:45,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5592 states. [2021-10-13 07:08:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5592 to 5406. [2021-10-13 07:08:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5406 states, 5401 states have (on average 1.558785410109239) internal successors, (8419), 5405 states have internal predecessors, (8419), 0 states have call successors, (0), 0 states have 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:08:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 8419 transitions. [2021-10-13 07:08:46,322 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 8419 transitions. Word has length 52 [2021-10-13 07:08:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:46,323 INFO L470 AbstractCegarLoop]: Abstraction has 5406 states and 8419 transitions. [2021-10-13 07:08:46,323 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:08:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 8419 transitions. [2021-10-13 07:08:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:08:46,325 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:46,325 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:08:46,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-13 07:08:46,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:46,537 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:08:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-10-13 07:08:46,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:46,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796914462] [2021-10-13 07:08:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:46,545 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:46,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:46,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:08:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:46,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:46,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:46,871 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:08:46,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:47,037 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:08:47,037 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:47,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796914462] [2021-10-13 07:08:47,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796914462] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:47,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:47,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:08:47,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344775109] [2021-10-13 07:08:47,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:08:47,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:47,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:08:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:47,039 INFO L87 Difference]: Start difference. First operand 5406 states and 8419 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:08:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:47,388 INFO L93 Difference]: Finished difference Result 11426 states and 17775 transitions. [2021-10-13 07:08:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:08:47,389 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:08:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:47,424 INFO L225 Difference]: With dead ends: 11426 [2021-10-13 07:08:47,424 INFO L226 Difference]: Without dead ends: 6089 [2021-10-13 07:08:47,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:08:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2021-10-13 07:08:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 5770. [2021-10-13 07:08:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 5765 states have (on average 1.5425845620121423) internal successors, (8893), 5769 states have internal predecessors, (8893), 0 states have call successors, (0), 0 states have 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:08:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 8893 transitions. [2021-10-13 07:08:47,820 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 8893 transitions. Word has length 52 [2021-10-13 07:08:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:47,821 INFO L470 AbstractCegarLoop]: Abstraction has 5770 states and 8893 transitions. [2021-10-13 07:08:47,821 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:08:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 8893 transitions. [2021-10-13 07:08:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-13 07:08:47,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:47,823 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:08:47,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:48,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:48,036 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:08:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash 23863415, now seen corresponding path program 1 times [2021-10-13 07:08:48,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:48,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376999417] [2021-10-13 07:08:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:48,040 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:48,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:48,043 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:48,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:08:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:48,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:48,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:48,369 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:08:48,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:48,478 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:08:48,478 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:48,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376999417] [2021-10-13 07:08:48,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376999417] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:48,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:48,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:08:48,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356856558] [2021-10-13 07:08:48,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:08:48,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:48,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:08:48,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:48,481 INFO L87 Difference]: Start difference. First operand 5770 states and 8893 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:08:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:49,412 INFO L93 Difference]: Finished difference Result 14740 states and 22840 transitions. [2021-10-13 07:08:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:08:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:08:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:49,483 INFO L225 Difference]: With dead ends: 14740 [2021-10-13 07:08:49,483 INFO L226 Difference]: Without dead ends: 9039 [2021-10-13 07:08:49,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2021-10-13 07:08:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 8823. [2021-10-13 07:08:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8823 states, 8818 states have (on average 1.486051258788841) internal successors, (13104), 8822 states have internal predecessors, (13104), 0 states have call successors, (0), 0 states have 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:08:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 13104 transitions. [2021-10-13 07:08:50,128 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 13104 transitions. Word has length 59 [2021-10-13 07:08:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:50,130 INFO L470 AbstractCegarLoop]: Abstraction has 8823 states and 13104 transitions. [2021-10-13 07:08:50,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:08:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 13104 transitions. [2021-10-13 07:08:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 07:08:50,133 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:50,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:08:50,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:50,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:50,347 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:08:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2021-10-13 07:08:50,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:50,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722650352] [2021-10-13 07:08:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:50,348 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:50,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:50,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:50,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 07:08:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:50,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:08:50,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:50,803 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:08:50,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:50,970 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:08:50,970 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:50,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722650352] [2021-10-13 07:08:50,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722650352] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:50,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:50,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:08:50,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076508483] [2021-10-13 07:08:50,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:08:50,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:08:50,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:50,972 INFO L87 Difference]: Start difference. First operand 8823 states and 13104 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:08:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:51,545 INFO L93 Difference]: Finished difference Result 17500 states and 26017 transitions. [2021-10-13 07:08:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:08:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-13 07:08:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:51,566 INFO L225 Difference]: With dead ends: 17500 [2021-10-13 07:08:51,567 INFO L226 Difference]: Without dead ends: 8746 [2021-10-13 07:08:51,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:08:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8746 states. [2021-10-13 07:08:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8746 to 8674. [2021-10-13 07:08:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8674 states, 8669 states have (on average 1.469373630176491) internal successors, (12738), 8673 states have internal predecessors, (12738), 0 states have call successors, (0), 0 states have 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:08:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 12738 transitions. [2021-10-13 07:08:52,119 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 12738 transitions. Word has length 60 [2021-10-13 07:08:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:52,120 INFO L470 AbstractCegarLoop]: Abstraction has 8674 states and 12738 transitions. [2021-10-13 07:08:52,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:08:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 12738 transitions. [2021-10-13 07:08:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 07:08:52,123 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:52,123 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:08:52,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:08:52,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:52,335 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:08:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2021-10-13 07:08:52,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:52,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681156413] [2021-10-13 07:08:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:52,337 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:52,338 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:52,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:08:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:52,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:08:52,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:52,788 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:08:52,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:52,964 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:08:52,964 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:52,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681156413] [2021-10-13 07:08:52,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681156413] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:52,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:52,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-13 07:08:52,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752622756] [2021-10-13 07:08:52,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:08:52,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:08:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:08:52,967 INFO L87 Difference]: Start difference. First operand 8674 states and 12738 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:08:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:08:55,362 INFO L93 Difference]: Finished difference Result 48135 states and 70176 transitions. [2021-10-13 07:08:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 07:08:55,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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:08:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:08:55,476 INFO L225 Difference]: With dead ends: 48135 [2021-10-13 07:08:55,476 INFO L226 Difference]: Without dead ends: 39815 [2021-10-13 07:08:55,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-10-13 07:08:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2021-10-13 07:08:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 11287. [2021-10-13 07:08:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11287 states, 11282 states have (on average 1.453288424038291) internal successors, (16396), 11286 states have internal predecessors, (16396), 0 states have call successors, (0), 0 states have 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:08:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11287 states to 11287 states and 16396 transitions. [2021-10-13 07:08:56,639 INFO L78 Accepts]: Start accepts. Automaton has 11287 states and 16396 transitions. Word has length 63 [2021-10-13 07:08:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:08:56,640 INFO L470 AbstractCegarLoop]: Abstraction has 11287 states and 16396 transitions. [2021-10-13 07:08:56,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:08:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11287 states and 16396 transitions. [2021-10-13 07:08:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 07:08:56,644 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:08:56,645 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:08:56,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-10-13 07:08:56,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:08:56,858 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:08:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:08:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2021-10-13 07:08:56,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:08:56,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945074110] [2021-10-13 07:08:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:08:56,859 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:08:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:08:56,860 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:08:56,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 07:08:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:08:57,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:08:57,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:08:57,332 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:08:57,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:08:57,511 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:08:57,511 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:08:57,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945074110] [2021-10-13 07:08:57,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945074110] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:08:57,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:08:57,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-10-13 07:08:57,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587153464] [2021-10-13 07:08:57,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:08:57,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:08:57,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:08:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:08:57,514 INFO L87 Difference]: Start difference. First operand 11287 states and 16396 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:09:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:00,384 INFO L93 Difference]: Finished difference Result 47647 states and 69520 transitions. [2021-10-13 07:09:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-13 07:09:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-13 07:09:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:00,475 INFO L225 Difference]: With dead ends: 47647 [2021-10-13 07:09:00,475 INFO L226 Difference]: Without dead ends: 36381 [2021-10-13 07:09:00,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 192.1ms TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:09:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36381 states. [2021-10-13 07:09:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36381 to 7498. [2021-10-13 07:09:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7498 states, 7493 states have (on average 1.4437474976644868) internal successors, (10818), 7497 states have internal predecessors, (10818), 0 states have call successors, (0), 0 states have 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:09:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 10818 transitions. [2021-10-13 07:09:01,371 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 10818 transitions. Word has length 64 [2021-10-13 07:09:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:01,372 INFO L470 AbstractCegarLoop]: Abstraction has 7498 states and 10818 transitions. [2021-10-13 07:09:01,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:09:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 10818 transitions. [2021-10-13 07:09:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 07:09:01,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:01,376 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:09:01,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:01,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:01,590 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:09:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2021-10-13 07:09:01,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:01,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137330898] [2021-10-13 07:09:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:01,591 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:01,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:01,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 07:09:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:01,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:09:01,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:02,107 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:09:02,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:02,316 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:09:02,316 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:02,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137330898] [2021-10-13 07:09:02,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137330898] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:09:02,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:09:02,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:09:02,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860085760] [2021-10-13 07:09:02,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:09:02,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:02,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:09:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:02,319 INFO L87 Difference]: Start difference. First operand 7498 states and 10818 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:09:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:03,579 INFO L93 Difference]: Finished difference Result 23292 states and 33265 transitions. [2021-10-13 07:09:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:09:03,579 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:09:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:03,610 INFO L225 Difference]: With dead ends: 23292 [2021-10-13 07:09:03,610 INFO L226 Difference]: Without dead ends: 15553 [2021-10-13 07:09:03,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15553 states. [2021-10-13 07:09:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15553 to 10433. [2021-10-13 07:09:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10433 states, 10428 states have (on average 1.410529344073648) internal successors, (14709), 10432 states have internal predecessors, (14709), 0 states have call successors, (0), 0 states have 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:09:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10433 states to 10433 states and 14709 transitions. [2021-10-13 07:09:04,525 INFO L78 Accepts]: Start accepts. Automaton has 10433 states and 14709 transitions. Word has length 88 [2021-10-13 07:09:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:04,526 INFO L470 AbstractCegarLoop]: Abstraction has 10433 states and 14709 transitions. [2021-10-13 07:09:04,526 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:09:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 10433 states and 14709 transitions. [2021-10-13 07:09:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-13 07:09:04,528 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:04,528 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:09:04,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:04,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:04,729 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:09:04,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2021-10-13 07:09:04,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:04,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317148355] [2021-10-13 07:09:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:04,731 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:04,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:04,732 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:04,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 07:09:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:05,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:09:05,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:05,337 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:09:05,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:05,564 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:09:05,565 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:05,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317148355] [2021-10-13 07:09:05,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317148355] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:09:05,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:09:05,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:09:05,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929230919] [2021-10-13 07:09:05,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:09:05,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:09:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:05,567 INFO L87 Difference]: Start difference. First operand 10433 states and 14709 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:09:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:05,935 INFO L93 Difference]: Finished difference Result 14922 states and 21098 transitions. [2021-10-13 07:09:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:09:05,935 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:09:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:05,942 INFO L225 Difference]: With dead ends: 14922 [2021-10-13 07:09:05,942 INFO L226 Difference]: Without dead ends: 4426 [2021-10-13 07:09:05,954 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 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:09:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2021-10-13 07:09:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4358. [2021-10-13 07:09:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4358 states, 4353 states have (on average 1.3161038364346427) internal successors, (5729), 4357 states have internal predecessors, (5729), 0 states have call successors, (0), 0 states have 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:09:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4358 states to 4358 states and 5729 transitions. [2021-10-13 07:09:06,435 INFO L78 Accepts]: Start accepts. Automaton has 4358 states and 5729 transitions. Word has length 95 [2021-10-13 07:09:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:06,435 INFO L470 AbstractCegarLoop]: Abstraction has 4358 states and 5729 transitions. [2021-10-13 07:09:06,435 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:09:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4358 states and 5729 transitions. [2021-10-13 07:09:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 07:09:06,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:06,437 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:09:06,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:06,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:06,650 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:09:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1620290344, now seen corresponding path program 1 times [2021-10-13 07:09:06,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:06,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435642733] [2021-10-13 07:09:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:06,652 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:06,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:06,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:06,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 07:09:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:07,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:09:07,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:07,322 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:09:07,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:07,552 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:09:07,552 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:07,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435642733] [2021-10-13 07:09:07,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435642733] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:09:07,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:09:07,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:09:07,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872434213] [2021-10-13 07:09:07,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:09:07,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:09:07,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:07,554 INFO L87 Difference]: Start difference. First operand 4358 states and 5729 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:09:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:07,804 INFO L93 Difference]: Finished difference Result 7794 states and 10293 transitions. [2021-10-13 07:09:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:09:07,805 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:09:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:07,809 INFO L225 Difference]: With dead ends: 7794 [2021-10-13 07:09:07,809 INFO L226 Difference]: Without dead ends: 3447 [2021-10-13 07:09:07,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 196 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:09:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2021-10-13 07:09:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3167. [2021-10-13 07:09:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3162 states have (on average 1.290955091714105) internal successors, (4082), 3166 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have 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:09:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4082 transitions. [2021-10-13 07:09:08,024 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4082 transitions. Word has length 100 [2021-10-13 07:09:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:08,024 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 4082 transitions. [2021-10-13 07:09:08,024 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:09:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4082 transitions. [2021-10-13 07:09:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 07:09:08,026 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:08,026 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:09:08,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:08,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:08,233 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:09:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1312391872, now seen corresponding path program 1 times [2021-10-13 07:09:08,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:08,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368541415] [2021-10-13 07:09:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:08,235 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:08,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:08,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:08,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-13 07:09:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:08,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:09:08,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:08,933 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:09:08,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:09,182 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:09:09,183 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:09,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368541415] [2021-10-13 07:09:09,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368541415] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:09:09,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:09:09,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:09:09,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104526054] [2021-10-13 07:09:09,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:09:09,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:09:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:09,185 INFO L87 Difference]: Start difference. First operand 3167 states and 4082 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:09:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:09,482 INFO L93 Difference]: Finished difference Result 6026 states and 7782 transitions. [2021-10-13 07:09:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:09:09,482 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:09:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:09,486 INFO L225 Difference]: With dead ends: 6026 [2021-10-13 07:09:09,486 INFO L226 Difference]: Without dead ends: 3028 [2021-10-13 07:09:09,489 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:09:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2021-10-13 07:09:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2984. [2021-10-13 07:09:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2979 states have (on average 1.2759315206445117) internal successors, (3801), 2983 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have 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:09:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3801 transitions. [2021-10-13 07:09:09,783 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3801 transitions. Word has length 101 [2021-10-13 07:09:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:09,783 INFO L470 AbstractCegarLoop]: Abstraction has 2984 states and 3801 transitions. [2021-10-13 07:09:09,784 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:09:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3801 transitions. [2021-10-13 07:09:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-13 07:09:09,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:09,787 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:09:09,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:09,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:09,989 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:09:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2021-10-13 07:09:09,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:09,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726928348] [2021-10-13 07:09:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:09,993 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:09,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:09,995 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:09,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-13 07:09:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:10,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:09:10,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:11,039 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:09:11,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:11,477 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:09:11,477 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:11,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726928348] [2021-10-13 07:09:11,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726928348] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:11,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [479351529] [2021-10-13 07:09:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:11,477 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:09:11,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:09:11,479 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:09:11,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2021-10-13 07:09:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:12,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:09:12,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:12,702 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:09:12,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:13,166 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:09:13,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [479351529] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:13,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903654034] [2021-10-13 07:09:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:13,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:09:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:09:13,174 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:09:13,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-13 07:09:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:13,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:09:13,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:14,413 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:09:14,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:14,856 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:09:14,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903654034] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:14,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:09:14,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 9 [2021-10-13 07:09:14,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595358708] [2021-10-13 07:09:14,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:09:14,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:09:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:09:14,860 INFO L87 Difference]: Start difference. First operand 2984 states and 3801 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:09:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:16,915 INFO L93 Difference]: Finished difference Result 14382 states and 18426 transitions. [2021-10-13 07:09:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-13 07:09:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-10-13 07:09:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:16,930 INFO L225 Difference]: With dead ends: 14382 [2021-10-13 07:09:16,930 INFO L226 Difference]: Without dead ends: 11567 [2021-10-13 07:09:16,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 275.6ms TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 07:09:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11567 states. [2021-10-13 07:09:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11567 to 4358. [2021-10-13 07:09:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4358 states, 4353 states have (on average 1.2823340225132094) internal successors, (5582), 4357 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have 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:09:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4358 states to 4358 states and 5582 transitions. [2021-10-13 07:09:17,517 INFO L78 Accepts]: Start accepts. Automaton has 4358 states and 5582 transitions. Word has length 160 [2021-10-13 07:09:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:17,518 INFO L470 AbstractCegarLoop]: Abstraction has 4358 states and 5582 transitions. [2021-10-13 07:09:17,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:09:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4358 states and 5582 transitions. [2021-10-13 07:09:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-10-13 07:09:17,524 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:17,524 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:09:17,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2021-10-13 07:09:17,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:17,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:18,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:09:18,129 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:09:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2021-10-13 07:09:18,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:18,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576113924] [2021-10-13 07:09:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:18,130 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:18,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:18,131 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:18,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-13 07:09:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:18,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 07:09:18,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:09:19,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:09:20,372 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:20,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576113924] [2021-10-13 07:09:20,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576113924] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:20,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616312323] [2021-10-13 07:09:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:20,373 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:09:20,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:09:20,374 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:09:20,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-10-13 07:09:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:21,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:09:21,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:09:22,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:09:22,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1616312323] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:22,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176804090] [2021-10-13 07:09:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:22,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:09:22,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:09:22,952 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:09:22,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-10-13 07:09:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:24,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 07:09:24,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 196 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:09:25,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 194 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:09:26,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176804090] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:26,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:09:26,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 16, 14] total 21 [2021-10-13 07:09:26,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189905346] [2021-10-13 07:09:26,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-13 07:09:26,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-13 07:09:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-10-13 07:09:26,124 INFO L87 Difference]: Start difference. First operand 4358 states and 5582 transitions. Second operand has 21 states, 21 states have (on average 20.333333333333332) internal successors, (427), 21 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have 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:09:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:33,977 INFO L93 Difference]: Finished difference Result 28956 states and 36919 transitions. [2021-10-13 07:09:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2021-10-13 07:09:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 20.333333333333332) internal successors, (427), 21 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2021-10-13 07:09:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:34,012 INFO L225 Difference]: With dead ends: 28956 [2021-10-13 07:09:34,013 INFO L226 Difference]: Without dead ends: 24767 [2021-10-13 07:09:34,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1791 GetRequests, 1635 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9983 ImplicationChecksByTransitivity, 3292.7ms TimeCoverageRelationStatistics Valid=2599, Invalid=22207, Unknown=0, NotChecked=0, Total=24806 [2021-10-13 07:09:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2021-10-13 07:09:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 5695. [2021-10-13 07:09:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 5690 states have (on average 1.2840070298769772) internal successors, (7306), 5694 states have internal predecessors, (7306), 0 states have call successors, (0), 0 states have 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:09:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7306 transitions. [2021-10-13 07:09:34,737 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7306 transitions. Word has length 258 [2021-10-13 07:09:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:34,737 INFO L470 AbstractCegarLoop]: Abstraction has 5695 states and 7306 transitions. [2021-10-13 07:09:34,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.333333333333332) internal successors, (427), 21 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have 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:09:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7306 transitions. [2021-10-13 07:09:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2021-10-13 07:09:34,744 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:34,744 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:09:34,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:34,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:35,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2021-10-13 07:09:35,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:09:35,358 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:09:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1870192825, now seen corresponding path program 1 times [2021-10-13 07:09:35,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:35,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914598768] [2021-10-13 07:09:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:35,359 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:35,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:35,360 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:35,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-13 07:09:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:36,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:09:36,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 153 proven. 310 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:09:37,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 153 proven. 310 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:09:38,898 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:38,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914598768] [2021-10-13 07:09:38,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914598768] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:38,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1788291782] [2021-10-13 07:09:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:38,898 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:09:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:09:38,902 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:09:38,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2021-10-13 07:09:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:40,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:09:40,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 153 proven. 310 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:09:41,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 153 proven. 310 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-13 07:09:42,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1788291782] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:09:42,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520540760] [2021-10-13 07:09:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:42,811 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:09:42,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:09:42,833 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:09:42,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-10-13 07:09:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:44,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:09:44,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 153 proven. 314 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 07:09:45,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-10-13 07:09:46,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520540760] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 07:09:46,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 5 imperfect interpolant sequences. [2021-10-13 07:09:46,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 9, 9, 9, 14] total 26 [2021-10-13 07:09:46,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847242799] [2021-10-13 07:09:46,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:09:46,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:09:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:09:46,841 INFO L87 Difference]: Start difference. First operand 5695 states and 7306 transitions. Second operand has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have 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:09:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:49,838 INFO L93 Difference]: Finished difference Result 18748 states and 23838 transitions. [2021-10-13 07:09:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-13 07:09:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 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 357 [2021-10-13 07:09:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:49,857 INFO L225 Difference]: With dead ends: 18748 [2021-10-13 07:09:49,857 INFO L226 Difference]: Without dead ends: 13222 [2021-10-13 07:09:49,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2168 GetRequests, 2124 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1234.0ms TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2021-10-13 07:09:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13222 states. [2021-10-13 07:09:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13222 to 5791. [2021-10-13 07:09:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5786 states have (on average 1.2803318354649154) internal successors, (7408), 5790 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:09:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 7408 transitions. [2021-10-13 07:09:50,571 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 7408 transitions. Word has length 357 [2021-10-13 07:09:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:50,572 INFO L470 AbstractCegarLoop]: Abstraction has 5791 states and 7408 transitions. [2021-10-13 07:09:50,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have 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:09:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 7408 transitions. [2021-10-13 07:09:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2021-10-13 07:09:50,580 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:50,580 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:09:50,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:50,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:51,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2021-10-13 07:09:51,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:09:51,198 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:09:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash -228519270, now seen corresponding path program 1 times [2021-10-13 07:09:51,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:51,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247906325] [2021-10-13 07:09:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:51,199 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:51,200 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:51,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-10-13 07:09:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:52,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:09:52,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 07:09:53,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 07:09:54,035 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:54,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247906325] [2021-10-13 07:09:54,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247906325] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:09:54,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:09:54,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:09:54,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416952848] [2021-10-13 07:09:54,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:09:54,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:09:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:54,039 INFO L87 Difference]: Start difference. First operand 5791 states and 7408 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:09:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:54,395 INFO L93 Difference]: Finished difference Result 7168 states and 9094 transitions. [2021-10-13 07:09:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:09:54,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 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 357 [2021-10-13 07:09:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:54,398 INFO L225 Difference]: With dead ends: 7168 [2021-10-13 07:09:54,398 INFO L226 Difference]: Without dead ends: 1293 [2021-10-13 07:09:54,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:09:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2021-10-13 07:09:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 914. [2021-10-13 07:09:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 911 states have (on average 1.0746432491767288) internal successors, (979), 913 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have 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:09:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 979 transitions. [2021-10-13 07:09:54,536 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 979 transitions. Word has length 357 [2021-10-13 07:09:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:54,536 INFO L470 AbstractCegarLoop]: Abstraction has 914 states and 979 transitions. [2021-10-13 07:09:54,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:09:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 979 transitions. [2021-10-13 07:09:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-10-13 07:09:54,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:54,540 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:09:54,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:54,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:54,758 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:09:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:54,759 INFO L82 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2021-10-13 07:09:54,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:54,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483127032] [2021-10-13 07:09:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:54,760 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:54,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:54,761 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:54,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-10-13 07:09:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:09:56,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:09:56,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:09:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 07:09:57,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:09:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 07:09:57,687 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:09:57,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483127032] [2021-10-13 07:09:57,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483127032] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:09:57,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:09:57,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-10-13 07:09:57,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685511976] [2021-10-13 07:09:57,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:09:57,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:09:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:09:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:09:57,690 INFO L87 Difference]: Start difference. First operand 914 states and 979 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:09:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:09:58,163 INFO L93 Difference]: Finished difference Result 2047 states and 2227 transitions. [2021-10-13 07:09:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 07:09:58,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2021-10-13 07:09:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:09:58,166 INFO L225 Difference]: With dead ends: 2047 [2021-10-13 07:09:58,167 INFO L226 Difference]: Without dead ends: 1846 [2021-10-13 07:09:58,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-13 07:09:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2021-10-13 07:09:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 980. [2021-10-13 07:09:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 977 states have (on average 1.076765609007165) internal successors, (1052), 979 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have 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:09:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1052 transitions. [2021-10-13 07:09:58,372 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1052 transitions. Word has length 359 [2021-10-13 07:09:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:09:58,373 INFO L470 AbstractCegarLoop]: Abstraction has 980 states and 1052 transitions. [2021-10-13 07:09:58,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:09:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1052 transitions. [2021-10-13 07:09:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-10-13 07:09:58,376 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:09:58,377 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:09:58,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-10-13 07:09:58,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:09:58,583 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:09:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:09:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2021-10-13 07:09:58,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:09:58,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849138389] [2021-10-13 07:09:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:09:58,585 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:09:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:09:58,585 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:09:58,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-10-13 07:10:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:00,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:10:00,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 07:10:01,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-10-13 07:10:01,664 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:10:01,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849138389] [2021-10-13 07:10:01,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849138389] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:10:01,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:10:01,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-13 07:10:01,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034026876] [2021-10-13 07:10:01,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:10:01,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:10:01,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:10:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:10:01,666 INFO L87 Difference]: Start difference. First operand 980 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:10:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:10:01,899 INFO L93 Difference]: Finished difference Result 1347 states and 1458 transitions. [2021-10-13 07:10:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:10:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2021-10-13 07:10:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:10:01,901 INFO L225 Difference]: With dead ends: 1347 [2021-10-13 07:10:01,901 INFO L226 Difference]: Without dead ends: 1146 [2021-10-13 07:10:01,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:10:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-13 07:10:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 968. [2021-10-13 07:10:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 966 states have (on average 1.065217391304348) internal successors, (1029), 967 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have 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:10:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1029 transitions. [2021-10-13 07:10:02,088 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1029 transitions. Word has length 360 [2021-10-13 07:10:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:10:02,089 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1029 transitions. [2021-10-13 07:10:02,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:10:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1029 transitions. [2021-10-13 07:10:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-10-13 07:10:02,092 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:10:02,093 INFO L512 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:10:02,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-10-13 07:10:02,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:10:02,301 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:10:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:10:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2021-10-13 07:10:02,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:10:02,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770760972] [2021-10-13 07:10:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:02,304 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:10:02,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:10:02,305 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:10:02,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-10-13 07:10:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:04,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:10:04,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2021-10-13 07:10:05,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2021-10-13 07:10:05,716 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:10:05,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770760972] [2021-10-13 07:10:05,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770760972] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:10:05,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:10:05,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:10:05,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485368531] [2021-10-13 07:10:05,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:10:05,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:10:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:10:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:10:05,719 INFO L87 Difference]: Start difference. First operand 968 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:10:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:10:05,847 INFO L93 Difference]: Finished difference Result 1553 states and 1649 transitions. [2021-10-13 07:10:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:10:05,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 417 [2021-10-13 07:10:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:10:05,850 INFO L225 Difference]: With dead ends: 1553 [2021-10-13 07:10:05,850 INFO L226 Difference]: Without dead ends: 843 [2021-10-13 07:10:05,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 831 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:10:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-10-13 07:10:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 673. [2021-10-13 07:10:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 671 states have (on average 1.068554396423249) internal successors, (717), 672 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have 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:10:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 717 transitions. [2021-10-13 07:10:05,948 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 717 transitions. Word has length 417 [2021-10-13 07:10:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:10:05,948 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 717 transitions. [2021-10-13 07:10:05,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:10:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 717 transitions. [2021-10-13 07:10:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-10-13 07:10:05,951 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:10:05,951 INFO L512 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:10:05,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-10-13 07:10:06,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:10:06,154 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:10:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:10:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2021-10-13 07:10:06,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:10:06,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171868475] [2021-10-13 07:10:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:06,155 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:10:06,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:10:06,156 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:10:06,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-10-13 07:10:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:08,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:10:08,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 07:10:09,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 07:10:11,265 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:10:11,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171868475] [2021-10-13 07:10:11,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171868475] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:11,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1399371526] [2021-10-13 07:10:11,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:11,266 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:10:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:10:11,267 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:10:11,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2021-10-13 07:10:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:14,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:10:14,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 07:10:16,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 07:10:17,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1399371526] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:17,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68455554] [2021-10-13 07:10:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:17,490 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:10:17,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:10:17,491 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:10:17,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-10-13 07:10:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:20,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:10:20,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 07:10:22,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-10-13 07:10:23,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68455554] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:23,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:10:23,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 17, 17, 17] total 26 [2021-10-13 07:10:23,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397458300] [2021-10-13 07:10:23,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-13 07:10:23,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:10:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-13 07:10:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:10:23,647 INFO L87 Difference]: Start difference. First operand 673 states and 717 transitions. Second operand has 26 states, 26 states have (on average 14.307692307692308) internal successors, (372), 26 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:10:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:10:24,925 INFO L93 Difference]: Finished difference Result 918 states and 980 transitions. [2021-10-13 07:10:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-13 07:10:24,925 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 14.307692307692308) internal successors, (372), 26 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 417 [2021-10-13 07:10:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:10:24,928 INFO L225 Difference]: With dead ends: 918 [2021-10-13 07:10:24,928 INFO L226 Difference]: Without dead ends: 916 [2021-10-13 07:10:24,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2529 GetRequests, 2481 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 962.8ms TimeCoverageRelationStatistics Valid=364, Invalid=2086, Unknown=0, NotChecked=0, Total=2450 [2021-10-13 07:10:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-10-13 07:10:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 734. [2021-10-13 07:10:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 732 states have (on average 1.064207650273224) internal successors, (779), 733 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:10:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 779 transitions. [2021-10-13 07:10:25,104 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 779 transitions. Word has length 417 [2021-10-13 07:10:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:10:25,104 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 779 transitions. [2021-10-13 07:10:25,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.307692307692308) internal successors, (372), 26 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:10:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 779 transitions. [2021-10-13 07:10:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2021-10-13 07:10:25,108 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:10:25,108 INFO L512 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:10:25,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-10-13 07:10:25,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2021-10-13 07:10:25,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-10-13 07:10:25,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:10:25,719 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:10:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:10:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2021-10-13 07:10:25,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:10:25,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099407817] [2021-10-13 07:10:25,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:25,720 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:10:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:10:25,721 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:10:25,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-10-13 07:10:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:28,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:10:28,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:10:29,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:10:30,315 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:10:30,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099407817] [2021-10-13 07:10:30,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099407817] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:30,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1047366698] [2021-10-13 07:10:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:30,316 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:10:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:10:30,316 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:10:30,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-10-13 07:10:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:34,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:10:34,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:10:35,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:10:36,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1047366698] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:36,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661718512] [2021-10-13 07:10:36,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:36,301 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:10:36,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:10:36,301 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:10:36,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-10-13 07:10:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:40,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:10:40,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:10:41,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:10:42,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661718512] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:42,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:10:42,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 9 [2021-10-13 07:10:42,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949551410] [2021-10-13 07:10:42,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:10:42,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:10:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:10:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:10:42,165 INFO L87 Difference]: Start difference. First operand 734 states and 779 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:10:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:10:42,676 INFO L93 Difference]: Finished difference Result 1281 states and 1367 transitions. [2021-10-13 07:10:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 07:10:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 464 [2021-10-13 07:10:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:10:42,679 INFO L225 Difference]: With dead ends: 1281 [2021-10-13 07:10:42,679 INFO L226 Difference]: Without dead ends: 1151 [2021-10-13 07:10:42,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2796 GetRequests, 2779 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 122.9ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-13 07:10:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-10-13 07:10:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 798. [2021-10-13 07:10:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 796 states have (on average 1.065326633165829) internal successors, (848), 797 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:10:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 848 transitions. [2021-10-13 07:10:42,860 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 848 transitions. Word has length 464 [2021-10-13 07:10:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:10:42,860 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 848 transitions. [2021-10-13 07:10:42,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:10:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 848 transitions. [2021-10-13 07:10:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2021-10-13 07:10:42,864 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:10:42,865 INFO L512 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:10:42,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-10-13 07:10:43,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2021-10-13 07:10:43,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-10-13 07:10:43,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:10:43,488 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:10:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:10:43,488 INFO L82 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2021-10-13 07:10:43,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:10:43,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355188331] [2021-10-13 07:10:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:43,489 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:10:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:10:43,490 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:10:43,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-10-13 07:10:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:46,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 07:10:46,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 07:10:49,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 25 proven. 639 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 07:10:50,902 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:10:50,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355188331] [2021-10-13 07:10:50,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355188331] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:50,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [107238046] [2021-10-13 07:10:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:50,903 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:10:50,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:10:50,904 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:10:50,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2021-10-13 07:10:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:10:56,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 07:10:56,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:10:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 07:10:58,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:10:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 25 proven. 639 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 07:10:59,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [107238046] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:10:59,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693178755] [2021-10-13 07:10:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:10:59,537 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:10:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:10:59,538 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:10:59,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-10-13 07:11:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:11:04,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 34 conjunts are in the unsatisfiable core [2021-10-13 07:11:04,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:11:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-10-13 07:11:07,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:11:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 306 proven. 350 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-10-13 07:11:09,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693178755] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:11:09,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:11:09,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21, 21, 24, 21] total 52 [2021-10-13 07:11:09,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479603179] [2021-10-13 07:11:09,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-10-13 07:11:09,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:11:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-10-13 07:11:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2444, Unknown=0, NotChecked=0, Total=2652 [2021-10-13 07:11:09,915 INFO L87 Difference]: Start difference. First operand 798 states and 848 transitions. Second operand has 52 states, 52 states have (on average 19.846153846153847) internal successors, (1032), 52 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:11:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:11:17,090 INFO L93 Difference]: Finished difference Result 1251 states and 1333 transitions. [2021-10-13 07:11:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-10-13 07:11:17,091 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 19.846153846153847) internal successors, (1032), 52 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 523 [2021-10-13 07:11:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:11:17,093 INFO L225 Difference]: With dead ends: 1251 [2021-10-13 07:11:17,093 INFO L226 Difference]: Without dead ends: 1249 [2021-10-13 07:11:17,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3261 GetRequests, 3132 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4511 ImplicationChecksByTransitivity, 6110.7ms TimeCoverageRelationStatistics Valid=1937, Invalid=15093, Unknown=0, NotChecked=0, Total=17030 [2021-10-13 07:11:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2021-10-13 07:11:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 859. [2021-10-13 07:11:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 857 states have (on average 1.0618436406067677) internal successors, (910), 858 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have 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:11:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 910 transitions. [2021-10-13 07:11:17,259 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 910 transitions. Word has length 523 [2021-10-13 07:11:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:11:17,259 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 910 transitions. [2021-10-13 07:11:17,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 19.846153846153847) internal successors, (1032), 52 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:11:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 910 transitions. [2021-10-13 07:11:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2021-10-13 07:11:17,263 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:11:17,263 INFO L512 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:11:17,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-10-13 07:11:17,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-10-13 07:11:17,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2021-10-13 07:11:17,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:11:17,878 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:11:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:11:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2021-10-13 07:11:17,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:11:17,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634094871] [2021-10-13 07:11:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:11:17,879 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:11:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:11:17,880 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:11:17,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-10-13 07:11:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:11:22,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 07:11:22,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:11:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-10-13 07:11:23,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:11:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-10-13 07:11:24,696 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:11:24,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634094871] [2021-10-13 07:11:24,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634094871] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:11:24,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1567690153] [2021-10-13 07:11:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:11:24,696 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:11:24,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:11:24,697 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:11:24,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-10-13 07:11:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:11:31,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:11:31,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:11:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-10-13 07:11:32,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:11:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-10-13 07:11:33,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1567690153] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:11:33,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119339129] [2021-10-13 07:11:33,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:11:33,320 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:11:33,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:11:33,321 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:11:33,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-10-13 07:11:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:11:39,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 07:11:39,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:11:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 212 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-10-13 07:11:40,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:11:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 406 proven. 4 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2021-10-13 07:11:41,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119339129] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:11:41,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:11:41,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 16, 14] total 21 [2021-10-13 07:11:41,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187881271] [2021-10-13 07:11:41,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-13 07:11:41,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:11:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-13 07:11:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-10-13 07:11:41,683 INFO L87 Difference]: Start difference. First operand 859 states and 910 transitions. Second operand has 21 states, 21 states have (on average 25.285714285714285) internal successors, (531), 21 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:11:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:11:44,152 INFO L93 Difference]: Finished difference Result 1838 states and 1966 transitions. [2021-10-13 07:11:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-10-13 07:11:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 25.285714285714285) internal successors, (531), 21 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 570 [2021-10-13 07:11:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:11:44,154 INFO L225 Difference]: With dead ends: 1838 [2021-10-13 07:11:44,154 INFO L226 Difference]: Without dead ends: 1647 [2021-10-13 07:11:44,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3506 GetRequests, 3427 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 1533.2ms TimeCoverageRelationStatistics Valid=973, Invalid=5507, Unknown=0, NotChecked=0, Total=6480 [2021-10-13 07:11:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2021-10-13 07:11:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 924. [2021-10-13 07:11:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 922 states have (on average 1.0629067245119306) internal successors, (980), 923 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:11:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 980 transitions. [2021-10-13 07:11:44,338 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 980 transitions. Word has length 570 [2021-10-13 07:11:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:11:44,338 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 980 transitions. [2021-10-13 07:11:44,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 25.285714285714285) internal successors, (531), 21 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:11:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 980 transitions. [2021-10-13 07:11:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2021-10-13 07:11:44,342 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:11:44,342 INFO L512 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:11:44,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-10-13 07:11:44,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2021-10-13 07:11:44,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-10-13 07:11:44,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:11:44,943 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:11:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:11:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2021-10-13 07:11:44,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:11:44,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557339849] [2021-10-13 07:11:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:11:44,946 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:11:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:11:44,947 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:11:44,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-10-13 07:11:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:11:50,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 29 conjunts are in the unsatisfiable core [2021-10-13 07:11:50,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:11:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 07:11:52,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:11:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 30 proven. 1056 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 07:11:55,448 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:11:55,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557339849] [2021-10-13 07:11:55,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557339849] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:11:55,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [217973909] [2021-10-13 07:11:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:11:55,449 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:11:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:11:55,449 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:11:55,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2021-10-13 07:12:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:12:03,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 29 conjunts are in the unsatisfiable core [2021-10-13 07:12:03,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:12:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 07:12:05,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:12:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 30 proven. 1056 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 07:12:07,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [217973909] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:12:07,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895800212] [2021-10-13 07:12:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:12:07,953 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:12:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:12:07,953 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:12:07,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-10-13 07:12:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:12:15,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 40 conjunts are in the unsatisfiable core [2021-10-13 07:12:15,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:12:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 07:12:18,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:12:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 489 proven. 482 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-10-13 07:12:21,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895800212] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:12:21,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:12:21,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 25, 28, 23] total 60 [2021-10-13 07:12:21,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251707983] [2021-10-13 07:12:21,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-10-13 07:12:21,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:12:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-10-13 07:12:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3270, Unknown=0, NotChecked=0, Total=3540 [2021-10-13 07:12:21,407 INFO L87 Difference]: Start difference. First operand 924 states and 980 transitions. Second operand has 60 states, 60 states have (on average 23.616666666666667) internal successors, (1417), 60 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have 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:12:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:12:29,753 INFO L93 Difference]: Finished difference Result 1510 states and 1604 transitions. [2021-10-13 07:12:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-10-13 07:12:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 23.616666666666667) internal successors, (1417), 60 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 630 [2021-10-13 07:12:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:12:29,756 INFO L225 Difference]: With dead ends: 1510 [2021-10-13 07:12:29,756 INFO L226 Difference]: Without dead ends: 1508 [2021-10-13 07:12:29,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3901 GetRequests, 3757 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5535 ImplicationChecksByTransitivity, 6933.8ms TimeCoverageRelationStatistics Valid=2388, Invalid=18782, Unknown=0, NotChecked=0, Total=21170 [2021-10-13 07:12:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-10-13 07:12:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 985. [2021-10-13 07:12:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 983 states have (on average 1.0600203458799593) internal successors, (1042), 984 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have 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:12:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1042 transitions. [2021-10-13 07:12:29,976 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1042 transitions. Word has length 630 [2021-10-13 07:12:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:12:29,976 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1042 transitions. [2021-10-13 07:12:29,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 23.616666666666667) internal successors, (1417), 60 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have 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:12:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1042 transitions. [2021-10-13 07:12:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2021-10-13 07:12:29,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:12:29,981 INFO L512 BasicCegarLoop]: trace histogram [13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:12:30,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-10-13 07:12:30,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2021-10-13 07:12:30,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2021-10-13 07:12:30,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:12:30,582 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-10-13 07:12:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:12:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash -16317840, now seen corresponding path program 1 times [2021-10-13 07:12:30,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:12:30,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041951838] [2021-10-13 07:12:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:12:30,584 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:12:30,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:12:30,585 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:12:30,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2021-10-13 07:12:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:12:37,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:12:37,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:12:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 619 proven. 344 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-10-13 07:12:38,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:12:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 619 proven. 344 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-10-13 07:12:40,109 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:12:40,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041951838] [2021-10-13 07:12:40,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041951838] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:12:40,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [622048945] [2021-10-13 07:12:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:12:40,110 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:12:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:12:40,110 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:12:40,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2021-10-13 07:12:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:12:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 07:12:49,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:12:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 619 proven. 344 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-10-13 07:12:50,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:12:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 619 proven. 344 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-10-13 07:12:52,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [622048945] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:12:52,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869232508] [2021-10-13 07:12:52,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:12:52,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:12:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:12:52,352 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:12:52,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-10-13 07:13:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:13:00,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:13:00,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:13:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 619 proven. 348 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-10-13 07:13:02,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:13:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2021-10-13 07:13:03,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869232508] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 07:13:03,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 5 imperfect interpolant sequences. [2021-10-13 07:13:03,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 9, 9, 9, 14] total 26 [2021-10-13 07:13:03,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642172052] [2021-10-13 07:13:03,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:13:03,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:13:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:13:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:13:03,746 INFO L87 Difference]: Start difference. First operand 985 states and 1042 transitions. Second operand has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:13:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:13:04,742 INFO L93 Difference]: Finished difference Result 1358 states and 1440 transitions. [2021-10-13 07:13:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 07:13:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 677 [2021-10-13 07:13:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:13:04,743 INFO L225 Difference]: With dead ends: 1358 [2021-10-13 07:13:04,743 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:13:04,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4076 GetRequests, 4038 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 885.0ms TimeCoverageRelationStatistics Valid=254, Invalid=1306, Unknown=0, NotChecked=0, Total=1560 [2021-10-13 07:13:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:13:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:13:04,745 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:13:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:13:04,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 677 [2021-10-13 07:13:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:13:04,745 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:13:04,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:13:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:13:04,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:13:04,747 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:04,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:04,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:04,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:04,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:13:04,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-10-13 07:13:04,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2021-10-13 07:13:05,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2021-10-13 07:13:05,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:13:05,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:13:05,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:05,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:06,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:06,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:08,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:08,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:08,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:08,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:09,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:09,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:11,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:11,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:12,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,038 WARN L207 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 1311 DAG size of output: 975 [2021-10-13 07:13:17,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:17,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:18,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:18,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:18,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:18,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:19,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:20,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:20,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:21,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:21,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:21,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:22,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:22,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:22,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:22,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:23,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:23,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:23,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:23,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:23,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:24,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:29,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:29,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:30,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:30,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:30,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:31,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:31,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:31,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:32,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:32,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:32,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:33,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:34,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:34,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:34,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:34,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:36,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:36,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:36,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:37,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:38,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:38,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:38,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:38,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:39,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:40,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:40,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:40,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:40,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:41,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:43,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:44,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:44,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:45,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:46,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:13:52,857 WARN L207 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 420 DAG size of output: 125 [2021-10-13 07:14:06,259 WARN L207 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 511 DAG size of output: 149 [2021-10-13 07:14:29,225 WARN L207 SmtUtils]: Spent 19.51 s on a formula simplification. DAG size of input: 917 DAG size of output: 197 [2021-10-13 07:14:50,029 WARN L207 SmtUtils]: Spent 6.77 s on a formula simplification. DAG size of input: 414 DAG size of output: 161 [2021-10-13 07:15:01,295 WARN L207 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 420 DAG size of output: 125 [2021-10-13 07:15:10,213 WARN L207 SmtUtils]: Spent 5.92 s on a formula simplification. DAG size of input: 420 DAG size of output: 125 [2021-10-13 07:15:53,251 WARN L207 SmtUtils]: Spent 22.70 s on a formula simplification. DAG size of input: 909 DAG size of output: 197 [2021-10-13 07:15:59,985 WARN L207 SmtUtils]: Spent 5.83 s on a formula simplification. DAG size of input: 416 DAG size of output: 125 [2021-10-13 07:16:15,833 WARN L207 SmtUtils]: Spent 6.50 s on a formula simplification. DAG size of input: 436 DAG size of output: 153 [2021-10-13 07:16:40,880 WARN L207 SmtUtils]: Spent 8.01 s on a formula simplification. DAG size of input: 511 DAG size of output: 149 [2021-10-13 07:17:08,450 WARN L207 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 372 DAG size of output: 122 [2021-10-13 07:17:21,937 WARN L207 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 431 DAG size of output: 145 [2021-10-13 07:17:31,954 WARN L207 SmtUtils]: Spent 10.01 s on a formula simplification. DAG size of input: 556 DAG size of output: 145 [2021-10-13 07:17:43,050 WARN L207 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 420 DAG size of output: 125 [2021-10-13 07:17:47,588 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,588 INFO L857 garLoopResultBuilder]: For program point L498(lines 497 525) no Hoare annotation was computed. [2021-10-13 07:17:47,588 INFO L857 garLoopResultBuilder]: For program point L366(lines 136 482) no Hoare annotation was computed. [2021-10-13 07:17:47,588 INFO L857 garLoopResultBuilder]: For program point L1225(lines 1225 1229) no Hoare annotation was computed. [2021-10-13 07:17:47,589 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2021-10-13 07:17:47,589 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 437) no Hoare annotation was computed. [2021-10-13 07:17:47,589 INFO L857 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2021-10-13 07:17:47,590 INFO L853 garLoopResultBuilder]: At program point L1028(lines 1002 1029) the Hoare annotation is: (let ((.cse37 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse39 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse38 (= ~c_req_d~0 (_ bv52 32))) (.cse24 (= ~c_req_a~0 (_ bv1 32))) (.cse16 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse21 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse29 (not .cse39)) (.cse40 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0)) (.cse36 (not .cse37))) (let ((.cse1 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse15 (or .cse40 .cse36)) (.cse28 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse22 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse20 (or .cse29 .cse40)) (.cse2 (not .cse25)) (.cse30 (not .cse21)) (.cse31 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse32 (not .cse16)) (.cse33 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= (_ bv0 32) ~a_t~0)) (.cse17 (not .cse24)) (.cse34 (or .cse38 .cse29)) (.cse35 (= ~c_req_d~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse23 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= ~s_memory2~0 (_ bv52 32))) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse26 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse29)) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse27 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse19 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse14 .cse15 .cse16 .cse17 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse18 .cse19 .cse20 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse21 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse5 .cse22 (= (_ bv1 32) ~a_t~0) .cse23 .cse8 .cse24 .cse9 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse25 .cse18 .cse19) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse13 .cse27 .cse16 .cse17 (or (= ~s_memory2~0 .cse28) .cse29) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse18 .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse2 .cse30 .cse5 .cse31 .cse23 .cse8 .cse9 .cse32 .cse33 .cse11 .cse12 .cse14 .cse17 .cse34 .cse35 .cse18 .cse36 .cse19) (and .cse0 (= |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 .cse10 .cse11 .cse13 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse28) .cse17) .cse18 (or .cse22 .cse17) .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse20) (and (not (= ~s_run_st~0 (_ bv0 32))) .cse2 .cse30 .cse5 .cse31 .cse23 .cse8 .cse9 .cse32 .cse33 .cse11 .cse12 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse17 .cse34 .cse35 .cse18 .cse36 .cse19) (and .cse0 .cse3 .cse5 .cse23 .cse7 .cse8 .cse37 .cse9 .cse38 .cse11 .cse26 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse39 .cse13 .cse27 .cse16 .cse18 .cse19))))) [2021-10-13 07:17:47,590 INFO L857 garLoopResultBuilder]: For program point L566(lines 566 619) no Hoare annotation was computed. [2021-10-13 07:17:47,590 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 132) no Hoare annotation was computed. [2021-10-13 07:17:47,590 INFO L857 garLoopResultBuilder]: For program point L831(lines 831 837) no Hoare annotation was computed. [2021-10-13 07:17:47,591 INFO L853 garLoopResultBuilder]: At program point L831-1(lines 831 837) the Hoare annotation is: (let ((.cse32 (bvadd ~req_tt_a~0 (_ bv50 32)))) (let ((.cse25 (not (= (_ bv2 32) ~c_req_a~0))) (.cse30 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse26 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse29 (= .cse32 ~s_memory2~0)) (.cse28 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (.cse24 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse31 (= .cse32 ~s_memory1~0)) (.cse27 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (or .cse31 .cse27)) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (or .cse24 .cse31)) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (or (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse29 .cse28)) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse23 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i))) (.cse16 (= ~c_m_lock~0 (_ bv0 32))) (.cse17 (or .cse31 .cse26)) (.cse18 (or (= ~s_memory1~0 .cse30) .cse26)) (.cse19 (= ~s_memory0~0 (_ bv50 32))) (.cse20 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_m_run_~rsp_d___0~0 .cse30)) (.cse22 (or .cse25 .cse29))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse25 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= (_ bv0 32) ~a_t~0) .cse15 .cse26 .cse27 .cse16 .cse19 .cse28 .cse20 .cse21) (and .cse0 .cse1 .cse24 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse14 .cse15 .cse26 (or .cse23 .cse29) (or (= ~s_memory2~0 .cse30) .cse25) .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))))) [2021-10-13 07:17:47,591 INFO L853 garLoopResultBuilder]: At program point L765(lines 758 811) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse19 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (= (_ 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) .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse19 .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (not .cse18) .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)))))) [2021-10-13 07:17:47,592 INFO L853 garLoopResultBuilder]: At program point L699(lines 692 727) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,592 INFO L857 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-10-13 07:17:47,592 INFO L853 garLoopResultBuilder]: At program point L1096(lines 1089 1106) the Hoare annotation is: (let ((.cse30 (= ~c_req_a~0 (_ bv1 32))) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse7 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse31 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse26 (not .cse7)) (.cse33 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0)) (.cse29 (not .cse4)) (.cse21 (not .cse30)) (.cse13 (= ~s_run_pc~0 (_ bv2 32))) (.cse16 (= ~m_run_st~0 (_ bv0 32))) (.cse17 (= ~c_empty_req~0 (_ bv1 32)))) (let ((.cse25 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse10 (let ((.cse34 (= (_ bv3 32) ~m_run_pc~0))) (or (and (not (= ~s_run_st~0 (_ bv0 32))) .cse34 .cse16 .cse17 (= ~s_run_pc~0 (_ bv0 32))) (and .cse13 .cse34 .cse16 .cse17)))) (.cse22 (or (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse21)) (.cse27 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse28 (= (_ bv0 32) ~a_t~0)) (.cse19 (or .cse33 .cse29)) (.cse23 (or .cse26 .cse33)) (.cse24 (not .cse31)) (.cse0 (= ~s_memory1~0 (_ bv51 32))) (.cse14 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= ~c_write_rsp_ev~0 (_ bv1 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse32 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse3 (= ~s_memory2~0 (_ bv52 32))) (.cse18 (= (_ bv6 32) ~m_run_pc~0)) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse26)) (.cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse9 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse20 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_req_d~0 (_ bv52 32)) .cse5 .cse6 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse0 .cse14 .cse1 .cse2 .cse15 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse16 .cse17 (= ~c_rsp_d~0 (_ bv51 32)) .cse18 .cse5 .cse8 .cse19 .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse20) .cse21) .cse12 .cse22 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse23) (and .cse24 .cse1 (not .cse25) .cse2 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) (not .cse11) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse26 .cse5 .cse27 .cse28 .cse10 .cse21 (= ~c_req_d~0 (_ bv50 32)) .cse12 .cse29) (and .cse25 .cse0 .cse1 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse2 .cse30 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse5 .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse31 (= ~a_t~0 ULTIMATE.start_s_memory_write_~i) .cse12 .cse22) (and .cse13 (not .cse32) .cse24 .cse0 .cse14 .cse1 .cse2 .cse15 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse16 .cse17 .cse18 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse5 .cse27 .cse8 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse28 .cse19 .cse11 .cse21 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse23 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse13 .cse24 .cse0 .cse14 .cse1 (= ~c_rsp_d~0 (_ bv52 32)) .cse2 .cse15 .cse32 .cse3 .cse16 .cse17 .cse18 .cse5 .cse6 .cse8 .cse9 .cse11 .cse21 (or (= ~s_memory2~0 .cse20) .cse26) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse12 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)))))) [2021-10-13 07:17:47,593 INFO L853 garLoopResultBuilder]: At program point L1163(lines 1115 1168) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,593 INFO L857 garLoopResultBuilder]: For program point L1097(lines 1089 1106) no Hoare annotation was computed. [2021-10-13 07:17:47,593 INFO L857 garLoopResultBuilder]: For program point L767(lines 767 771) no Hoare annotation was computed. [2021-10-13 07:17:47,593 INFO L857 garLoopResultBuilder]: For program point L701(lines 701 705) no Hoare annotation was computed. [2021-10-13 07:17:47,594 INFO L853 garLoopResultBuilder]: At program point L1296(lines 1289 1315) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,594 INFO L853 garLoopResultBuilder]: At program point L239(lines 232 267) the Hoare annotation is: (let ((.cse20 (= ~m_run_pc~0 (_ bv0 32))) (.cse18 (= (_ bv3 32) ~m_run_pc~0)) (.cse19 (= ~c_empty_rsp~0 (_ bv1 32)))) (let ((.cse9 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (let ((.cse21 (= ~s_run_pc~0 (_ bv0 32)))) (or (and .cse21 .cse19 .cse20) (and .cse18 .cse21 .cse19)))) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.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))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (or (and .cse18 .cse19) (and .cse19 .cse20))) (.cse15 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse17 (= ~s_memory0~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 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse12 .cse13) (and .cse8 .cse14 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv1 32) ~a_t~0) .cse3 .cse4 .cse5 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse10 .cse11 (= (_ bv2 32) ~c_req_a~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse17) (and .cse8 .cse1 (not .cse16) (not .cse14) (= (_ 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 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse10 .cse11 .cse15 .cse12 .cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))))) [2021-10-13 07:17:47,594 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 131) no Hoare annotation was computed. [2021-10-13 07:17:47,594 INFO L857 garLoopResultBuilder]: For program point L1098(lines 1098 1102) no Hoare annotation was computed. [2021-10-13 07:17:47,595 INFO L853 garLoopResultBuilder]: At program point L108(lines 103 845) the Hoare annotation is: false [2021-10-13 07:17:47,595 INFO L853 garLoopResultBuilder]: At program point L439(lines 432 458) the Hoare annotation is: (let ((.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= (_ 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))) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse8 (= (_ bv2 32) ~c_req_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse14 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse15) (not .cse13) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse9) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse8) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse14) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (not .cse6) .cse12))) [2021-10-13 07:17:47,595 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1302) no Hoare annotation was computed. [2021-10-13 07:17:47,595 INFO L857 garLoopResultBuilder]: For program point L241(lines 241 245) no Hoare annotation was computed. [2021-10-13 07:17:47,596 INFO L857 garLoopResultBuilder]: For program point L968(lines 968 972) no Hoare annotation was computed. [2021-10-13 07:17:47,596 INFO L853 garLoopResultBuilder]: At program point L176(lines 146 177) the Hoare annotation is: (let ((.cse8 (= ~s_run_pc~0 (_ bv0 32))) (.cse17 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse12 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse14 (= (_ bv3 32) ~m_run_pc~0)) (.cse16 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse11 (= ~s_run_pc~0 (_ bv2 32))) (.cse19 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (not (= ~c_m_lock~0 (_ bv1 32)))) (.cse13 (= (_ 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)) (.cse21 (= (_ 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 .cse12 .cse1 (= ~s_memory1~0 (_ bv51 32)) .cse2 (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse13 (= (_ bv1 32) ~a_t~0) .cse14 .cse3 .cse15 .cse4 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse5 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse16 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse17 .cse18 .cse9) (and .cse19 .cse0 .cse20 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10) (and .cse11 .cse1 (not .cse17) (= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) .cse2 (not .cse12) .cse13 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse14 .cse3 .cse4 .cse5 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not (= (_ bv2 32) ~c_req_a~0)) .cse16 .cse21 (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse18 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) .cse9) (and .cse11 .cse19 .cse0 .cse1 .cse20 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse10))) [2021-10-13 07:17:47,596 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 130) no Hoare annotation was computed. [2021-10-13 07:17:47,596 INFO L857 garLoopResultBuilder]: For program point L1035(lines 1035 1088) no Hoare annotation was computed. [2021-10-13 07:17:47,597 INFO L853 garLoopResultBuilder]: At program point L573(lines 566 619) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse4 (= ~s_memory2~0 (_ bv52 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse15 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse6))) (.cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse3 (= (_ bv3 32) ~m_run_pc~0) .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 .cse9 .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12) (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse9 (= (_ bv0 32) ~a_t~0) .cse10 (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)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse11 .cse12) (and .cse0 .cse1 (= ~s_memory2~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse2 .cse3 .cse13 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse5 .cse14 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv2 32) ~c_req_a~0) .cse15 .cse8 .cse9 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse10 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse11 .cse12)))) [2021-10-13 07:17:47,597 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-10-13 07:17:47,597 INFO L853 garLoopResultBuilder]: At program point L111(lines 103 845) the Hoare annotation is: false [2021-10-13 07:17:47,597 INFO L857 garLoopResultBuilder]: For program point L1036(lines 1036 1040) no Hoare annotation was computed. [2021-10-13 07:17:47,597 INFO L853 garLoopResultBuilder]: At program point L640-2(lines 640 668) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse33 (not (= (_ bv4 32) ~m_run_pc~0))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse8 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse32 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse34 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse40 (bvadd ~req_tt_a~0 (_ bv50 32))) (.cse24 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i))) (let ((.cse28 (= (_ bv2 32) ~c_req_a~0)) (.cse30 (not .cse24)) (.cse37 (= .cse40 ~s_memory2~0)) (.cse29 (not .cse19)) (.cse6 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse25 (or .cse34 (= .cse40 ~s_memory1~0))) (.cse35 (= (_ bv0 32) ~a_t~0)) (.cse36 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse15 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32))) (.cse16 (= ~s_memory0~0 (_ bv50 32))) (.cse22 (or (and .cse0 .cse4 .cse8 .cse11 .cse20 .cse32 .cse33) (and .cse0 .cse4 .cse8 .cse10 .cse11 .cse32)))) (let ((.cse23 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32)))) (.cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse18 (let ((.cse38 (let ((.cse39 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0))) (or (and .cse2 .cse3 .cse5 .cse6 .cse25 .cse35 .cse36 .cse39 .cse15 .cse16 .cse22) (and .cse2 .cse3 .cse5 (= ~c_req_a~0 ~req_tt_a~0) .cse39 .cse15 .cse16 .cse22))))) (or (and .cse34 .cse38 .cse35 .cse36 (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0)) (and (= ~c_req_a~0 ~a_t~0) .cse6 .cse38)))) (.cse7 (= ~s_memory2~0 (_ bv52 32))) (.cse12 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse13 (or .cse37 .cse29)) (.cse14 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse27 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse31 (or .cse30 .cse37)) (.cse21 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32))) (.cse17 (or (not .cse28) .cse37)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse9 (= ~c_empty_req~0 (_ bv1 32)))) (or (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 .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_memory_read_~i ~a_t~0) .cse15 .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse17) (and (= (_ bv1 32) ~a_t~0) .cse7 .cse12 .cse14 .cse18) (and (= ~c_req_a~0 (_ bv0 32)) .cse2 .cse3 .cse7 .cse19 .cse20 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse14 .cse21 .cse16 .cse22) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse23 .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse24 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse26 .cse14 .cse27 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and (= ~s_memory2~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse23 .cse2 .cse3 .cse5 .cse7 .cse28 (or .cse26 .cse29) .cse12 .cse13 .cse14 (or .cse30 .cse26) .cse31 .cse16 .cse22) (and .cse7 .cse12 .cse13 .cse14 .cse31 .cse18) (and .cse0 .cse1 .cse4 .cse8 .cse11 .cse20 .cse32 .cse33) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .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 .cse20 .cse12 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse35 .cse13 .cse14 .cse27 .cse31 .cse36 .cse21 .cse16 .cse17 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse32) (and .cse0 .cse1 .cse4 .cse8 .cse9 .cse10 (= ~c_m_lock~0 (_ bv0 32)) .cse32))))) [2021-10-13 07:17:47,597 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,598 INFO L853 garLoopResultBuilder]: At program point L773(lines 766 810) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse19 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (= (_ 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) .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse19 .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (not .cse18) .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)))))) [2021-10-13 07:17:47,598 INFO L853 garLoopResultBuilder]: At program point L707(lines 700 726) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,598 INFO L857 garLoopResultBuilder]: For program point L641(lines 640 668) no Hoare annotation was computed. [2021-10-13 07:17:47,598 INFO L857 garLoopResultBuilder]: For program point L575(lines 575 579) no Hoare annotation was computed. [2021-10-13 07:17:47,598 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 129) no Hoare annotation was computed. [2021-10-13 07:17:47,599 INFO L853 garLoopResultBuilder]: At program point L906(lines 880 907) the Hoare annotation is: (let ((.cse20 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse26 (not .cse20))) (let ((.cse2 (= ~c_req_a~0 ~a_t~0)) (.cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse17 (= ~s_memory2~0 (_ bv52 32))) (.cse18 (= (_ bv6 32) ~m_run_pc~0)) (.cse21 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse14 (= ~s_memory1~0 (_ bv51 32))) (.cse16 (or .cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))))) (.cse19 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse26)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse22 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse25 (= ~c_req_d~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse9) .cse10 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse4 .cse17 .cse7 .cse18 .cse11 .cse19 .cse20 .cse21 .cse9 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) .cse12 .cse13 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse21 .cse9 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13) (and .cse0 .cse22 .cse1 .cse4 .cse6 .cse7 .cse10 .cse11 .cse23 .cse24 .cse25 .cse13) (and .cse0 .cse22 .cse1 .cse14 .cse15 .cse4 .cse17 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse18 .cse11 .cse23 .cse21 .cse24 .cse9 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13) (and .cse0 .cse3 .cse1 .cse14 .cse16 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse6 .cse7 .cse10 (= ~c_req_d~0 (_ bv52 32)) .cse11 .cse19 .cse20 .cse12 .cse13) (and .cse22 .cse1 .cse4 .cse6 .cse7 .cse10 .cse11 .cse23 (= ~s_run_pc~0 (_ bv0 32)) .cse24 .cse25 .cse13))))) [2021-10-13 07:17:47,599 INFO L857 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2021-10-13 07:17:47,599 INFO L853 garLoopResultBuilder]: At program point L114(lines 103 845) the Hoare annotation is: (let ((.cse28 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse27 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse21 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse23 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse32 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse31 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32))) (.cse29 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse24 (= ~c_req_d~0 (_ bv52 32))) (.cse26 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse10 (or .cse31 (not .cse29))) (.cse13 (not .cse32)) (.cse14 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse25 (= (_ bv2 32) ~c_req_a~0)) (.cse15 (or (not .cse21) .cse23)) (.cse19 (= (_ bv0 32) ~a_t~0)) (.cse20 (= ~c_req_d~0 (_ bv50 32))) (.cse18 (or (not .cse28) .cse27)) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse7 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse22 (= ~s_memory1~0 (_ bv51 32))) (.cse8 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse11 (= ~c_req_a~0 (_ bv1 32))) (.cse30 (= ~c_empty_req~0 (_ bv1 32))) (.cse12 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse16 (= ~c_m_lock~0 (_ bv1 32))) (.cse17 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= ~c_req_a~0 ~a_t~0) .cse8 .cse9 .cse2 .cse10 .cse3 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse16 .cse5 .cse19 .cse20 .cse6) (and .cse7 .cse21 .cse22 .cse23 .cse8 .cse2 .cse3 .cse4 .cse24 .cse16 .cse25 .cse26 .cse27 .cse28 .cse17 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse3 .cse4 .cse16 .cse19 .cse20 .cse6) (and .cse7 .cse1 .cse22 .cse8 .cse2 (= ~s_memory2~0 (_ bv52 32)) .cse3 .cse29 .cse30 .cse24 .cse16 .cse31 .cse25 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) .cse26 .cse32 .cse17) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse2 .cse10 .cse3 .cse30 .cse13 .cse14 (not .cse25) .cse15 .cse16 .cse19 (not .cse11) .cse20 .cse17 .cse18) (and .cse7 .cse2 .cse3 .cse30 .cse6) (and .cse7 .cse21 .cse1 .cse22 .cse23 .cse8 (= (_ bv1 32) ~a_t~0) .cse2 .cse3 .cse11 .cse30 .cse12 .cse16 .cse27 .cse28 .cse17)))) [2021-10-13 07:17:47,600 INFO L853 garLoopResultBuilder]: At program point L180-2(lines 180 208) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 (_ bv0 32))) (.cse10 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse11 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse9 (= ~m_run_pc~0 (_ bv0 32))) (.cse15 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse20 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse16 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse17 (= (_ bv3 32) ~m_run_pc~0)) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_req~0 (_ bv1 32))) (.cse4 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse13 (= ~c_m_lock~0 (_ bv1 32))) (.cse19 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse14 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~c_req_a~0 (_ bv1 32))) (.cse21 (= ~s_memory0~0 (_ bv50 32))) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse14 .cse8 .cse9) (and .cse15 .cse16 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse12 (= (_ bv1 32) ~a_t~0) .cse17 .cse2 .cse18 .cse3 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse4 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse13 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse20 .cse21 .cse8) (and .cse15 .cse10 .cse0 .cse1 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse14 .cse8 .cse9) (and .cse15 .cse1 (not .cse20) (not .cse16) .cse12 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse17 .cse2 .cse3 .cse4 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not (= (_ bv2 32) ~c_req_a~0)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse13 .cse19 .cse14 (not .cse18) (= ~c_req_d~0 (_ bv50 32)) .cse21 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) .cse8))) [2021-10-13 07:17:47,600 INFO L857 garLoopResultBuilder]: For program point L775(lines 775 779) no Hoare annotation was computed. [2021-10-13 07:17:47,600 INFO L857 garLoopResultBuilder]: For program point L709(lines 709 713) no Hoare annotation was computed. [2021-10-13 07:17:47,601 INFO L853 garLoopResultBuilder]: At program point L1304(lines 1297 1314) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,601 INFO L853 garLoopResultBuilder]: At program point L247(lines 240 266) the Hoare annotation is: (let ((.cse20 (= ~m_run_pc~0 (_ bv0 32))) (.cse18 (= (_ bv3 32) ~m_run_pc~0)) (.cse19 (= ~c_empty_rsp~0 (_ bv1 32)))) (let ((.cse9 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (let ((.cse21 (= ~s_run_pc~0 (_ bv0 32)))) (or (and .cse21 .cse19 .cse20) (and .cse18 .cse21 .cse19)))) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.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))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (or (and .cse18 .cse19) (and .cse19 .cse20))) (.cse15 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse17 (= ~s_memory0~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 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse12 .cse13) (and .cse8 .cse14 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv1 32) ~a_t~0) .cse3 .cse4 .cse5 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse10 .cse11 (= (_ bv2 32) ~c_req_a~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse17) (and .cse8 .cse1 (not .cse16) (not .cse14) (= (_ 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 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse10 .cse11 .cse15 .cse12 .cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))))) [2021-10-13 07:17:47,601 INFO L857 garLoopResultBuilder]: For program point L181(lines 180 208) no Hoare annotation was computed. [2021-10-13 07:17:47,602 INFO L853 garLoopResultBuilder]: At program point L974(lines 967 984) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ~a_t~0)) (.cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) (not .cse12))) (.cse13 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse7))) (.cse25 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= ~s_memory2~0 (_ bv52 32))) (.cse23 (= (_ bv6 32) ~m_run_pc~0)) (.cse24 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse26 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse30 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse31 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_req_d~0 (_ bv52 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse1) .cse4 .cse17 .cse5 .cse6 (= ~c_req_a~0 (_ bv1 32)) .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse18) .cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse10 .cse14 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse17 .cse22 .cse6 .cse8 .cse23 .cse10 .cse24 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse19 .cse18 (= ~c_req_a~0 ~req_tt_a~0) .cse25 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse18 .cse25 .cse15 .cse16 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse26 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse27 .cse8 .cse23 .cse10 .cse28 .cse24 .cse29 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 .cse14 .cse29 .cse31 .cse16) (and .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse29 .cse31 .cse16)))) [2021-10-13 07:17:47,602 INFO L857 garLoopResultBuilder]: For program point L1305(lines 1257 1346) no Hoare annotation was computed. [2021-10-13 07:17:47,602 INFO L857 garLoopResultBuilder]: For program point L1239(lines 1239 1243) no Hoare annotation was computed. [2021-10-13 07:17:47,602 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 186) no Hoare annotation was computed. [2021-10-13 07:17:47,602 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 128) no Hoare annotation was computed. [2021-10-13 07:17:47,602 INFO L857 garLoopResultBuilder]: For program point L975(lines 967 984) no Hoare annotation was computed. [2021-10-13 07:17:47,603 INFO L853 garLoopResultBuilder]: At program point L447(lines 440 457) the Hoare annotation is: (let ((.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= (_ 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))) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse8 (= (_ bv2 32) ~c_req_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse14 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse15) (not .cse13) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse9) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse8) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse14) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (not .cse6) .cse12))) [2021-10-13 07:17:47,603 INFO L857 garLoopResultBuilder]: For program point L381(lines 381 385) no Hoare annotation was computed. [2021-10-13 07:17:47,603 INFO L857 garLoopResultBuilder]: For program point L1306(lines 1306 1310) no Hoare annotation was computed. [2021-10-13 07:17:47,603 INFO L857 garLoopResultBuilder]: For program point L249(lines 249 253) no Hoare annotation was computed. [2021-10-13 07:17:47,603 INFO L857 garLoopResultBuilder]: For program point L1174(lines 1174 1178) no Hoare annotation was computed. [2021-10-13 07:17:47,603 INFO L853 garLoopResultBuilder]: At program point L117(lines 103 845) the Hoare annotation is: false [2021-10-13 07:17:47,604 INFO L857 garLoopResultBuilder]: For program point L1174-2(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 07:17:47,604 INFO L853 garLoopResultBuilder]: At program point L1042(lines 1035 1088) the Hoare annotation is: (let ((.cse33 (= (_ bv2 32) ~c_req_a~0)) (.cse31 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse37 (= ~c_req_a~0 (_ bv1 32))) (.cse27 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse17 (not .cse31)) (.cse38 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse32 (= ~c_req_d~0 (_ bv52 32))) (.cse30 (not .cse33)) (.cse28 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse36 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i))) (let ((.cse3 (not .cse36)) (.cse5 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse8 (not .cse28)) (.cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse14 (or .cse32 .cse30)) (.cse15 (= ~c_req_d~0 (_ bv50 32))) (.cse25 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse30)) (.cse22 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse1 (not .cse38)) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse23 (= ~s_memory2~0 (_ bv52 32))) (.cse24 (= (_ bv6 32) ~m_run_pc~0)) (.cse18 (or .cse27 .cse17)) (.cse26 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse29 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse13 (not .cse37)) (.cse34 (or .cse30 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse19 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_write_rsp_ev~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse35 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse6 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse16 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (not (= ~s_run_st~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 (= ~s_run_pc~0 (_ bv0 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse19 .cse20 .cse2 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse21 .cse22 .cse23 .cse7 .cse24 .cse10 .cse25 .cse26 .cse27 .cse28 .cse13 (or (= ~s_memory2~0 .cse29) .cse30) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse19 .cse2 .cse4 .cse6 .cse23 .cse31 .cse7 .cse32 .cse10 .cse25 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse33 .cse26 .cse27 .cse28 .cse16) (and .cse0 (not .cse22) .cse1 .cse19 .cse20 .cse2 .cse4 .cse21 .cse23 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse24 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse10 .cse11 .cse26 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse12 .cse28 .cse13 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse16 .cse17 .cse34 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse19 .cse20 .cse2 .cse4 .cse21 .cse23 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse7 (= ~c_rsp_d~0 (_ bv51 32)) .cse24 .cse10 .cse18 .cse26 .cse28 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse29) .cse13) .cse16 (or .cse35 .cse13) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse34) (and .cse0 .cse36 .cse19 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse35 (= (_ bv1 32) ~a_t~0) .cse6 .cse37 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse38 .cse16))))) [2021-10-13 07:17:47,604 INFO L857 garLoopResultBuilder]: For program point L976(lines 976 980) no Hoare annotation was computed. [2021-10-13 07:17:47,604 INFO L857 garLoopResultBuilder]: For program point L448(lines 136 482) no Hoare annotation was computed. [2021-10-13 07:17:47,605 INFO L853 garLoopResultBuilder]: At program point L581(lines 574 618) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse4 (= ~s_memory2~0 (_ bv52 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse14 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse15 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse6))) (.cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse3 (= (_ bv3 32) ~m_run_pc~0) .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 .cse9 .cse10 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse11 .cse12) (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse9 (= (_ bv0 32) ~a_t~0) .cse10 (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)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse11 .cse12) (and .cse0 .cse1 (= ~s_memory2~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse2 .cse3 .cse13 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse5 .cse14 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv2 32) ~c_req_a~0) .cse15 .cse8 .cse9 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse10 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse11 .cse12)))) [2021-10-13 07:17:47,605 INFO L857 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-10-13 07:17:47,605 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 127) no Hoare annotation was computed. [2021-10-13 07:17:47,605 INFO L857 garLoopResultBuilder]: For program point L1044(lines 1044 1048) no Hoare annotation was computed. [2021-10-13 07:17:47,606 INFO L853 garLoopResultBuilder]: At program point L120(lines 103 845) the Hoare annotation is: false [2021-10-13 07:17:47,606 INFO L857 garLoopResultBuilder]: For program point L913(lines 913 966) no Hoare annotation was computed. [2021-10-13 07:17:47,606 INFO L853 garLoopResultBuilder]: At program point L781(lines 774 809) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse19 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (= (_ 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) .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse19 .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (not .cse18) .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)))))) [2021-10-13 07:17:47,607 INFO L853 garLoopResultBuilder]: At program point L715(lines 708 725) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,607 INFO L857 garLoopResultBuilder]: For program point L583(lines 583 587) no Hoare annotation was computed. [2021-10-13 07:17:47,607 INFO L860 garLoopResultBuilder]: At program point L1376(lines 1353 1378) the Hoare annotation is: true [2021-10-13 07:17:47,607 INFO L853 garLoopResultBuilder]: At program point L319(lines 289 320) the Hoare annotation is: (let ((.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.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_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse13 (= (_ bv2 32) ~c_req_a~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse7 (= ~c_req_a~0 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse5 .cse6 .cse7 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse10 .cse11) (and .cse0 .cse2 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse3 .cse4 .cse5 (= ~s_memory2~0 (_ bv52 32)) .cse6 .cse12 .cse8 (= ~c_req_d~0 (_ bv52 32)) .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse14 .cse11) (and .cse0 .cse2 (not .cse10) (not .cse1) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse8 (not .cse14) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse13) .cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse7) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse12)))) [2021-10-13 07:17:47,608 INFO L857 garLoopResultBuilder]: For program point L914(lines 914 918) no Hoare annotation was computed. [2021-10-13 07:17:47,608 INFO L857 garLoopResultBuilder]: For program point L716(lines 487 839) no Hoare annotation was computed. [2021-10-13 07:17:47,608 INFO L853 garLoopResultBuilder]: At program point L1245(lines 1238 1255) 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:17:47,608 INFO L857 garLoopResultBuilder]: For program point L1179-1(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 07:17:47,609 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 126) no Hoare annotation was computed. [2021-10-13 07:17:47,609 INFO L857 garLoopResultBuilder]: For program point L783(lines 783 787) no Hoare annotation was computed. [2021-10-13 07:17:47,609 INFO L857 garLoopResultBuilder]: For program point L717(lines 717 721) no Hoare annotation was computed. [2021-10-13 07:17:47,609 INFO L853 garLoopResultBuilder]: At program point L387(lines 380 397) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,610 INFO L853 garLoopResultBuilder]: At program point L255(lines 248 265) the Hoare annotation is: (let ((.cse20 (= ~m_run_pc~0 (_ bv0 32))) (.cse18 (= (_ bv3 32) ~m_run_pc~0)) (.cse19 (= ~c_empty_rsp~0 (_ bv1 32)))) (let ((.cse9 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (let ((.cse21 (= ~s_run_pc~0 (_ bv0 32)))) (or (and .cse21 .cse19 .cse20) (and .cse18 .cse21 .cse19)))) (.cse6 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.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))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (or (and .cse18 .cse19) (and .cse19 .cse20))) (.cse15 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse17 (= ~s_memory0~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 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse12 .cse13) (and .cse8 .cse14 .cse1 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv1 32) ~a_t~0) .cse3 .cse4 .cse5 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse10 .cse11 (= (_ bv2 32) ~c_req_a~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse16 .cse17) (and .cse8 .cse1 (not .cse16) (not .cse14) (= (_ 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 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) .cse5 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse10 .cse11 .cse15 .cse12 .cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))))) [2021-10-13 07:17:47,610 INFO L853 garLoopResultBuilder]: At program point L123(lines 103 845) the Hoare annotation is: (let ((.cse20 (= (_ bv2 32) ~c_req_a~0)) (.cse26 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse7 (= ~c_req_a~0 (_ bv1 32)))) (let ((.cse18 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse16 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse15 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse23 (= (_ bv0 32) ~req_tt_a~0)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse19 (not .cse7)) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse5 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse25 (or .cse26 (not .cse22))) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse21 (or (not .cse20) .cse26)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse17 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv1 32) ~a_t~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~c_req_a~0 ~req_tt_a~0) .cse12 .cse13) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse14 .cse15 .cse1 .cse2 (= ~c_rsp_d~0 (_ bv52 32)) .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse8 .cse9 .cse10 .cse18 .cse11 .cse19 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse12 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse20 .cse10 .cse18 .cse11 .cse12 .cse13 .cse21) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse22 .cse23 .cse8 .cse9 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse10 .cse24 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse3 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse14 (not .cse16) .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse17 .cse8 (= |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)) .cse24 .cse25 .cse11 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse12 .cse21 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse14 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse17 (= ~c_rsp_d~0 (_ bv51 32)) .cse8 .cse9 .cse10 .cse25 .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse12 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse21) (and .cse0 .cse14 .cse3 .cse6 .cse17 .cse8 (= ~c_m_lock~0 (_ bv0 32)) .cse13)))) [2021-10-13 07:17:47,610 INFO L857 garLoopResultBuilder]: For program point L388(lines 380 397) no Hoare annotation was computed. [2021-10-13 07:17:47,611 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:17:47,611 INFO L857 garLoopResultBuilder]: For program point L256(lines 136 482) no Hoare annotation was computed. [2021-10-13 07:17:47,611 INFO L857 garLoopResultBuilder]: For program point L1247(lines 1247 1251) no Hoare annotation was computed. [2021-10-13 07:17:47,611 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 393) no Hoare annotation was computed. [2021-10-13 07:17:47,611 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 261) no Hoare annotation was computed. [2021-10-13 07:17:47,612 INFO L853 garLoopResultBuilder]: At program point L1050(lines 1043 1087) the Hoare annotation is: (let ((.cse33 (= (_ bv2 32) ~c_req_a~0)) (.cse31 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse37 (= ~c_req_a~0 (_ bv1 32))) (.cse27 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse17 (not .cse31)) (.cse38 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse32 (= ~c_req_d~0 (_ bv52 32))) (.cse30 (not .cse33)) (.cse28 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse36 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i))) (let ((.cse3 (not .cse36)) (.cse5 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse8 (not .cse28)) (.cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse14 (or .cse32 .cse30)) (.cse15 (= ~c_req_d~0 (_ bv50 32))) (.cse25 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse30)) (.cse22 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse1 (not .cse38)) (.cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse23 (= ~s_memory2~0 (_ bv52 32))) (.cse24 (= (_ bv6 32) ~m_run_pc~0)) (.cse18 (or .cse27 .cse17)) (.cse26 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse29 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse13 (not .cse37)) (.cse34 (or .cse30 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse19 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_write_rsp_ev~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse35 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse6 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse16 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (not (= ~s_run_st~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 (= ~s_run_pc~0 (_ bv0 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse19 .cse20 .cse2 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse21 .cse22 .cse23 .cse7 .cse24 .cse10 .cse25 .cse26 .cse27 .cse28 .cse13 (or (= ~s_memory2~0 .cse29) .cse30) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse16 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse19 .cse2 .cse4 .cse6 .cse23 .cse31 .cse7 .cse32 .cse10 .cse25 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse33 .cse26 .cse27 .cse28 .cse16) (and .cse0 (not .cse22) .cse1 .cse19 .cse20 .cse2 .cse4 .cse21 .cse23 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse24 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse10 .cse11 .cse26 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse12 .cse28 .cse13 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse16 .cse17 .cse34 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse19 .cse20 .cse2 .cse4 .cse21 .cse23 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse7 (= ~c_rsp_d~0 (_ bv51 32)) .cse24 .cse10 .cse18 .cse26 .cse28 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse29) .cse13) .cse16 (or .cse35 .cse13) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse34) (and .cse0 .cse36 .cse19 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse35 (= (_ bv1 32) ~a_t~0) .cse6 .cse37 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse10 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse38 .cse16))))) [2021-10-13 07:17:47,612 INFO L857 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2021-10-13 07:17:47,612 INFO L853 garLoopResultBuilder]: At program point L589(lines 582 617) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse5 (= ~s_memory2~0 (_ bv52 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= (_ bv6 32) ~m_run_pc~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (not .cse15)) (.cse14 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv0 32) ~a_t~0) .cse11 (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)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse12 .cse13 .cse14) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (or (and (= (_ bv3 32) ~m_run_pc~0) .cse14) (and .cse14 (= ~m_run_pc~0 (_ bv0 32)))) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12) (and .cse0 .cse1 (= ~s_memory2~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse2 .cse3 .cse4 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse8 (= (_ bv2 32) ~c_req_a~0) .cse9 .cse10 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse12 .cse13 .cse14)))) [2021-10-13 07:17:47,613 INFO L857 garLoopResultBuilder]: For program point L1052(lines 1052 1056) no Hoare annotation was computed. [2021-10-13 07:17:47,613 INFO L853 garLoopResultBuilder]: At program point L920(lines 913 966) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) (not .cse12))) (.cse13 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse7))) (.cse17 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ~a_t~0)) (.cse20 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse26 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse21 (= ~c_req_type~0 (_ bv0 32))) (.cse22 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse23 (= ~s_memory2~0 (_ bv52 32))) (.cse24 (= (_ bv6 32) ~m_run_pc~0)) (.cse25 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse27 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse31 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse29 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse30 (= (_ bv0 32) ~a_t~0)) (.cse32 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_req_d~0 (_ bv52 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse1) .cse4 .cse17 .cse5 .cse6 (= ~c_req_a~0 (_ bv1 32)) .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse18) .cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse10 .cse14 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse20 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse21 .cse4 .cse22 .cse23 .cse6 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse13 .cse25 .cse18 .cse26 .cse15 .cse16 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse2 .cse3 .cse21 .cse4 .cse22 .cse17 .cse23 .cse6 .cse8 .cse24 .cse10 .cse25 .cse19 .cse18 (= ~c_req_a~0 ~req_tt_a~0) .cse20 .cse26 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse27 .cse2 .cse3 .cse21 .cse4 .cse22 .cse23 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse28 .cse8 .cse24 .cse10 .cse29 .cse25 .cse30 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse27 .cse2 .cse4 .cse31 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse29 .cse14 .cse30 .cse32 .cse16) (and .cse27 .cse2 .cse4 .cse31 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse29 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse30 .cse32 .cse16)))) [2021-10-13 07:17:47,613 INFO L857 garLoopResultBuilder]: For program point L326(lines 326 379) no Hoare annotation was computed. [2021-10-13 07:17:47,613 INFO L857 garLoopResultBuilder]: For program point L1185(lines 1185 1189) no Hoare annotation was computed. [2021-10-13 07:17:47,614 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2021-10-13 07:17:47,614 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 1001) no Hoare annotation was computed. [2021-10-13 07:17:47,614 INFO L853 garLoopResultBuilder]: At program point L789(lines 782 808) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse19 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (= (_ 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) .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse19 .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (not .cse18) .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)))))) [2021-10-13 07:17:47,615 INFO L857 garLoopResultBuilder]: For program point L591(lines 591 595) no Hoare annotation was computed. [2021-10-13 07:17:47,615 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-10-13 07:17:47,615 INFO L857 garLoopResultBuilder]: For program point L922(lines 922 926) no Hoare annotation was computed. [2021-10-13 07:17:47,615 INFO L853 garLoopResultBuilder]: At program point L526(lines 496 527) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse20 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (not .cse20)) (.cse17 (not .cse19)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (not (= ~c_m_lock~0 (_ bv1 32)))) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (not (= ~m_run_pc~0 (_ bv1 32)))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv0 32) ~a_t~0) .cse15 (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv1 32) ~a_t~0) .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 .cse12 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse13 .cse14 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (= (_ bv3 32) ~m_run_pc~0) .cse8 .cse9 .cse19 .cse10 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse20 .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse16 .cse18)))) [2021-10-13 07:17:47,615 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 67) no Hoare annotation was computed. [2021-10-13 07:17:47,616 INFO L857 garLoopResultBuilder]: For program point L791(lines 791 795) no Hoare annotation was computed. [2021-10-13 07:17:47,616 INFO L857 garLoopResultBuilder]: For program point L1320(lines 1320 1324) no Hoare annotation was computed. [2021-10-13 07:17:47,616 INFO L857 garLoopResultBuilder]: For program point L1122(lines 1121 1162) no Hoare annotation was computed. [2021-10-13 07:17:47,616 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 07:17:47,616 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,617 INFO L857 garLoopResultBuilder]: For program point L463(lines 463 467) no Hoare annotation was computed. [2021-10-13 07:17:47,617 INFO L853 garLoopResultBuilder]: At program point L133(lines 103 845) 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:17:47,617 INFO L853 garLoopResultBuilder]: At program point L1058(lines 1051 1086) the Hoare annotation is: (let ((.cse19 (not (= (_ bv2 32) ~c_req_a~0))) (.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse16 (or .cse19 .cse20)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse18 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= ~c_write_rsp_ev~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse14 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse15 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse7 (= ~c_rsp_d~0 (_ bv51 32)) .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse13) .cse14) .cse15 (or (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse14) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and .cse0 (not .cse17) .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse8 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse14 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse18 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse19) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse14 (or (= ~s_memory2~0 .cse13) .cse19) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0))))) [2021-10-13 07:17:47,618 INFO L853 garLoopResultBuilder]: At program point L530-2(lines 530 558) the Hoare annotation is: (let ((.cse18 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse19 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (not .cse19)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse13 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse14 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse16 (not .cse18)) (.cse17 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (_ bv0 32) ~a_t~0) .cse14 (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 (= (_ bv3 32) ~m_run_pc~0) .cse6 .cse7 .cse18 .cse8 (= ~c_req_d~0 (_ bv52 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse19 .cse12 .cse13 .cse14 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse11 .cse12 .cse13 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse14 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse15 .cse16 .cse17)))) [2021-10-13 07:17:47,618 INFO L853 garLoopResultBuilder]: At program point L1191(lines 1184 1237) 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:17:47,618 INFO L857 garLoopResultBuilder]: For program point L993(lines 993 1000) no Hoare annotation was computed. [2021-10-13 07:17:47,618 INFO L853 garLoopResultBuilder]: At program point L597(lines 590 616) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse5 (= ~s_memory2~0 (_ bv52 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= (_ bv6 32) ~m_run_pc~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (not .cse15)) (.cse14 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv0 32) ~a_t~0) .cse11 (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)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse12 .cse13 .cse14) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (or (and (= (_ bv3 32) ~m_run_pc~0) .cse14) (and .cse14 (= ~m_run_pc~0 (_ bv0 32)))) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12) (and .cse0 .cse1 (= ~s_memory2~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse2 .cse3 .cse4 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse8 (= (_ bv2 32) ~c_req_a~0) .cse9 .cse10 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse12 .cse13 .cse14)))) [2021-10-13 07:17:47,618 INFO L857 garLoopResultBuilder]: For program point L531(lines 530 558) no Hoare annotation was computed. [2021-10-13 07:17:47,619 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2021-10-13 07:17:47,619 INFO L853 garLoopResultBuilder]: At program point L399-1(lines 399 405) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,619 INFO L853 garLoopResultBuilder]: At program point L333(lines 326 379) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,620 INFO L857 garLoopResultBuilder]: For program point L1258(line 1258) no Hoare annotation was computed. [2021-10-13 07:17:47,620 INFO L857 garLoopResultBuilder]: For program point L1126(lines 1126 1130) no Hoare annotation was computed. [2021-10-13 07:17:47,620 INFO L857 garLoopResultBuilder]: For program point L1126-1(lines 1121 1162) no Hoare annotation was computed. [2021-10-13 07:17:47,620 INFO L853 garLoopResultBuilder]: At program point L69(lines 56 70) the Hoare annotation is: (let ((.cse19 (not (= (_ bv2 32) ~c_req_a~0))) (.cse21 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse2 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse1 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse7 (= ~s_memory2~0 (_ bv52 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 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse13 (or .cse21 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse14 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse20 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse16 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse17 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse18 (or .cse19 .cse21))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~req_tt_a~0) .cse9 .cse10 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) .cse11 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse12 (= (_ bv0 32) ~a_t~0) .cse13 .cse14 .cse15 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse16 .cse17 .cse18 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse19) .cse12 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse14 .cse15 (or (= ~s_memory2~0 .cse20) .cse19) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse16 .cse17 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= (_ bv1 32) ~req_tt_a~0) .cse3 .cse4 .cse5 .cse6 (= (_ bv1 32) ~a_t~0) .cse7 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse20) .cse15) .cse16 (or (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse15) .cse17 .cse18)))) [2021-10-13 07:17:47,621 INFO L857 garLoopResultBuilder]: For program point L1060(lines 1060 1064) no Hoare annotation was computed. [2021-10-13 07:17:47,621 INFO L853 garLoopResultBuilder]: At program point L928(lines 921 965) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ~a_t~0)) (.cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) (not .cse12))) (.cse13 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse7))) (.cse25 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= ~s_memory2~0 (_ bv52 32))) (.cse23 (= (_ bv6 32) ~m_run_pc~0)) (.cse24 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse26 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse30 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse31 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_req_d~0 (_ bv52 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse1) .cse4 .cse17 .cse5 .cse6 (= ~c_req_a~0 (_ bv1 32)) .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse18) .cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse10 .cse14 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse17 .cse22 .cse6 .cse8 .cse23 .cse10 .cse24 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse19 .cse18 (= ~c_req_a~0 ~req_tt_a~0) .cse25 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse18 .cse25 .cse15 .cse16 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse26 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse27 .cse8 .cse23 .cse10 .cse28 .cse24 .cse29 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 .cse14 .cse29 .cse31 .cse16) (and .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse29 .cse31 .cse16)))) [2021-10-13 07:17:47,621 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 536) no Hoare annotation was computed. [2021-10-13 07:17:47,621 INFO L857 garLoopResultBuilder]: For program point L1193(lines 1193 1197) no Hoare annotation was computed. [2021-10-13 07:17:47,622 INFO L853 garLoopResultBuilder]: At program point L136-2(lines 136 482) the Hoare annotation is: (let ((.cse14 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse8 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse11 (= ~c_req_a~0 (_ bv1 32))) (.cse2 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= ~s_memory0~0 (_ bv50 32))) (.cse20 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse17 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse12 (= ~c_m_lock~0 (_ bv0 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse21 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 (not .cse2) (not .cse3) .cse4 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse5 .cse6 .cse7 (not .cse8) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse10 (not .cse11) (= ~c_req_d~0 (_ bv50 32)) .cse12 .cse13 (not .cse14) .cse15) (and .cse0 .cse1 (not (bvslt ULTIMATE.start_m_run_~a~0 (_ bv3 32))) .cse16 .cse4 .cse5 (= ~s_memory2~0 (_ bv52 32)) .cse6 .cse14 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse8 .cse12 .cse13 .cse15) (and .cse0 .cse3 .cse1 .cse16 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 (= (_ bv1 32) ~a_t~0) .cse5 .cse6 .cse11 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse2 .cse12 .cse13 .cse15) (and .cse17 .cse18 .cse4 .cse6 .cse7 .cse19 .cse20 .cse10 .cse12 .cse15 .cse21) (and .cse17 .cse1 .cse6 .cse7 .cse19 .cse20 .cse12 .cse15 .cse21) (and .cse0 .cse17 .cse1 .cse18 .cse4 .cse6 .cse7 .cse19 .cse10 .cse12 .cse15 .cse21))) [2021-10-13 07:17:47,622 INFO L857 garLoopResultBuilder]: For program point L863(lines 863 875) no Hoare annotation was computed. [2021-10-13 07:17:47,622 INFO L853 garLoopResultBuilder]: At program point L797(lines 790 807) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse19 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (= (_ 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) .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse19 .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (not .cse18) .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)))))) [2021-10-13 07:17:47,623 INFO L857 garLoopResultBuilder]: For program point L731(lines 731 735) no Hoare annotation was computed. [2021-10-13 07:17:47,623 INFO L857 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-10-13 07:17:47,623 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2021-10-13 07:17:47,623 INFO L853 garLoopResultBuilder]: At program point L1326(lines 1319 1336) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,624 INFO L857 garLoopResultBuilder]: For program point L137(lines 136 482) no Hoare annotation was computed. [2021-10-13 07:17:47,624 INFO L857 garLoopResultBuilder]: For program point L930(lines 930 934) no Hoare annotation was computed. [2021-10-13 07:17:47,624 INFO L857 garLoopResultBuilder]: For program point L798(lines 487 839) no Hoare annotation was computed. [2021-10-13 07:17:47,624 INFO L857 garLoopResultBuilder]: For program point L1327(lines 1257 1346) no Hoare annotation was computed. [2021-10-13 07:17:47,624 INFO L857 garLoopResultBuilder]: For program point L138(lines 138 142) no Hoare annotation was computed. [2021-10-13 07:17:47,625 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 803) no Hoare annotation was computed. [2021-10-13 07:17:47,625 INFO L853 garLoopResultBuilder]: At program point L469(lines 462 479) the Hoare annotation is: (let ((.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= (_ 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))) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse8 (= (_ bv2 32) ~c_req_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse14 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse15) (not .cse13) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse9) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse8) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse14) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (not .cse6) .cse12))) [2021-10-13 07:17:47,625 INFO L857 garLoopResultBuilder]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2021-10-13 07:17:47,625 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 275) no Hoare annotation was computed. [2021-10-13 07:17:47,626 INFO L857 garLoopResultBuilder]: For program point L866(lines 866 874) no Hoare annotation was computed. [2021-10-13 07:17:47,626 INFO L857 garLoopResultBuilder]: For program point L470(lines 462 479) no Hoare annotation was computed. [2021-10-13 07:17:47,626 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 81) no Hoare annotation was computed. [2021-10-13 07:17:47,626 INFO L853 garLoopResultBuilder]: At program point L867(lines 862 1113) the Hoare annotation is: false [2021-10-13 07:17:47,627 INFO L853 garLoopResultBuilder]: At program point L669(lines 639 670) the Hoare annotation is: (let ((.cse19 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse12 (or .cse19 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse19)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse16 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse6 (= ~s_memory2~0 (_ bv52 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 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse13 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse18 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse14 (= ~s_memory0~0 (_ bv50 32)))) (or (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 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse14 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse15) (and .cse0 .cse1 (not .cse16) .cse17 .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 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse12 .cse13 .cse18 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse16 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse13 .cse18 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0))))) [2021-10-13 07:17:47,627 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 475) no Hoare annotation was computed. [2021-10-13 07:17:47,628 INFO L853 garLoopResultBuilder]: At program point L1132(lines 1121 1162) the Hoare annotation is: (let ((.cse31 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse39 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse34 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse54 (= ~c_req_a~0 (_ bv1 32))) (.cse57 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0)) (.cse25 (not .cse34)) (.cse21 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse8 (not .cse39)) (.cse38 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse35 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse37 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse22 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse20 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse33 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32))) (.cse58 (not .cse31))) (let ((.cse32 (= ~c_req_d~0 (_ bv52 32))) (.cse13 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse41 (or .cse33 .cse58)) (.cse42 (or (not .cse22) .cse20)) (.cse43 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse44 (or (not .cse35) .cse37)) (.cse45 (or .cse8 .cse38)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse30 (= ~c_req_d~0 (_ bv50 32))) (.cse46 (= (_ bv0 32) ~req_tt_a~0)) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse48 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32))) (.cse36 (or .cse25 .cse21)) (.cse19 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse25)) (.cse27 (= (_ bv2 32) ~req_tt_a~0)) (.cse56 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse14 (= ~s_memory2~0 (_ bv52 32))) (.cse47 (or .cse57 .cse58)) (.cse24 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse23 (not .cse54)) (.cse49 (or .cse25 .cse57)) (.cse9 (= ~s_memory1~0 (_ bv51 32))) (.cse52 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse53 (= (_ bv1 32) ~a_t~0)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse55 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse18 (= ~c_m_lock~0 (_ bv1 32))) (.cse26 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse10 (= ~c_req_type~0 (_ bv0 32))) (.cse15 (= ~m_run_st~0 (_ bv0 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse51 (= ~m_run_pc~0 (_ bv0 32))) (.cse7 (= ~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)) (.cse16 (= ~c_empty_req~0 (_ bv1 32))) (.cse17 (= (_ bv6 32) ~m_run_pc~0)) (.cse50 (= ~c_m_lock~0 (_ bv0 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse7 .cse1 .cse8 .cse9 .cse10 (= ~c_rsp_d~0 (_ bv52 32)) .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (= ~s_memory2~0 .cse24) .cse25) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse26 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) .cse27) (and .cse7 .cse0 .cse11 .cse2 .cse3 .cse4 .cse18 .cse28 .cse29 .cse30 .cse6) (and .cse7 .cse1 .cse9 .cse11 .cse2 .cse14 .cse3 .cse31 .cse15 .cse16 .cse32 .cse18 .cse19 .cse33 .cse34 .cse20 .cse21 .cse22 .cse26) (and .cse7 .cse35 .cse9 .cse36 .cse37 .cse11 .cse2 .cse3 .cse4 .cse32 .cse18 .cse19 .cse34 .cse38 .cse39 .cse26 .cse6) (and .cse7 .cse1 .cse11 .cse40 .cse2 .cse41 .cse3 .cse15 .cse16 .cse42 .cse43 .cse25 .cse44 .cse18 .cse28 .cse29 .cse23 .cse30 .cse26 .cse45) (and .cse7 .cse1 (not .cse13) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 .cse46 .cse15 .cse16 .cse17 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse18 .cse28 .cse20 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse29 .cse47 .cse22 .cse23 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse48 .cse26 .cse49 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse1 .cse3 .cse15 .cse16 .cse5 .cse50 .cse6 .cse51) (and .cse7 .cse11 .cse52 .cse40 .cse53 .cse2 .cse41 .cse3 .cse54 .cse55 .cse4 .cse42 .cse43 .cse44 .cse18 .cse26 .cse6 .cse45) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse18 .cse28 .cse5 .cse29 .cse30 .cse6) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse14 .cse3 .cse31 .cse46 .cse17 .cse18 .cse28 .cse33 .cse20 .cse29 .cse22 .cse48 .cse26 .cse6) (and .cse7 .cse9 .cse10 .cse36 .cse11 .cse12 .cse14 .cse3 .cse17 .cse18 .cse19 .cse34 .cse20 .cse22 .cse56 .cse26 .cse6 .cse27) (and .cse7 .cse1 .cse11 .cse3 .cse17 .cse18 .cse6) (and .cse7 .cse9 .cse10 (= ~c_req_a~0 ~a_t~0) .cse11 .cse12 .cse52 .cse14 .cse3 .cse17 .cse18 .cse20 .cse22 (= ~c_req_a~0 ~req_tt_a~0) .cse56 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse26 .cse6) (and .cse0 .cse10 .cse11 .cse3 .cse16 .cse5 .cse29 .cse50 .cse6 .cse51) (and .cse7 .cse1 .cse11 .cse2 .cse3 .cse6) (and .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) .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse15 .cse16 (= ~c_rsp_d~0 (_ bv51 32)) .cse17 .cse18 .cse20 .cse47 .cse22 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse24) .cse23) .cse26 (or .cse52 .cse23) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse49) (and .cse7 .cse2 .cse3 .cse16 .cse6) (and .cse7 .cse35 .cse1 .cse9 .cse37 .cse11 .cse52 .cse53 .cse2 .cse3 .cse54 .cse15 .cse16 .cse55 .cse18 .cse38 .cse39 .cse26) (and .cse7 .cse0 .cse1 .cse10 .cse11 .cse3 .cse15 .cse16 .cse29 .cse50 .cse6 .cse51) (and .cse7 .cse1 .cse11 .cse3 .cse16 .cse17 .cse50 .cse6))))) [2021-10-13 07:17:47,628 INFO L853 garLoopResultBuilder]: At program point L1066(lines 1059 1085) the Hoare annotation is: (let ((.cse19 (not (= (_ bv2 32) ~c_req_a~0))) (.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse16 (or .cse19 .cse20)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse18 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= ~c_write_rsp_ev~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse14 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse15 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse7 (= ~c_rsp_d~0 (_ bv51 32)) .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse13) .cse14) .cse15 (or (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse14) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and .cse0 (not .cse17) .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse8 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse14 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse18 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse19) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse14 (or (= ~s_memory2~0 .cse13) .cse19) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0))))) [2021-10-13 07:17:47,628 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,629 INFO L857 garLoopResultBuilder]: For program point L1265(lines 1265 1318) no Hoare annotation was computed. [2021-10-13 07:17:47,629 INFO L853 garLoopResultBuilder]: At program point L1199(lines 1192 1236) 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:17:47,629 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 81) no Hoare annotation was computed. [2021-10-13 07:17:47,629 INFO L857 garLoopResultBuilder]: For program point L869(lines 869 873) no Hoare annotation was computed. [2021-10-13 07:17:47,630 INFO L853 garLoopResultBuilder]: At program point L737(lines 730 747) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,630 INFO L853 garLoopResultBuilder]: At program point L605(lines 598 615) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (let ((.cse5 (= ~s_memory2~0 (_ bv52 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= (_ bv6 32) ~m_run_pc~0)) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (not .cse15)) (.cse14 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv0 32) ~a_t~0) .cse11 (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)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse12 .cse13 .cse14) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (or (and (= (_ bv3 32) ~m_run_pc~0) .cse14) (and .cse14 (= ~m_run_pc~0 (_ bv0 32)))) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12) (and .cse0 .cse1 (= ~s_memory2~0 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) .cse2 .cse3 .cse4 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse8 (= (_ bv2 32) ~c_req_a~0) .cse9 .cse10 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse12 .cse13 .cse14)))) [2021-10-13 07:17:47,631 INFO L853 garLoopResultBuilder]: At program point L341(lines 334 378) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,631 INFO L857 garLoopResultBuilder]: For program point L1266(lines 1266 1270) no Hoare annotation was computed. [2021-10-13 07:17:47,631 INFO L853 garLoopResultBuilder]: At program point L209(lines 179 210) 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)))) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse15 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse16 (= (_ bv3 32) ~m_run_pc~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))) (.cse18 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse11 (= (_ bv0 32) ~a_t~0)) (.cse17 (= ~c_req_a~0 (_ bv1 32))) (.cse20 (= ~s_memory0~0 (_ bv50 32))) (.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 .cse15 .cse3 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse5 (= (_ bv1 32) ~a_t~0) .cse16 .cse6 .cse17 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse7 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse9 .cse18 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse19 .cse20 .cse12) (and .cse0 .cse3 (not .cse19) (not .cse15) .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse16 .cse6 .cse7 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not (= (_ bv2 32) ~c_req_a~0)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse9 .cse18 .cse11 (not .cse17) (= ~c_req_d~0 (_ bv50 32)) .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) .cse12))) [2021-10-13 07:17:47,631 INFO L857 garLoopResultBuilder]: For program point L1068(lines 1068 1072) no Hoare annotation was computed. [2021-10-13 07:17:47,632 INFO L853 garLoopResultBuilder]: At program point L936(lines 929 964) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ~a_t~0)) (.cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) (not .cse12))) (.cse13 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse7))) (.cse25 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= ~s_memory2~0 (_ bv52 32))) (.cse23 (= (_ bv6 32) ~m_run_pc~0)) (.cse24 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse26 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse30 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse31 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_req_d~0 (_ bv52 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse1) .cse4 .cse17 .cse5 .cse6 (= ~c_req_a~0 (_ bv1 32)) .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse18) .cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse10 .cse14 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse17 .cse22 .cse6 .cse8 .cse23 .cse10 .cse24 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse19 .cse18 (= ~c_req_a~0 ~req_tt_a~0) .cse25 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse18 .cse25 .cse15 .cse16 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse26 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse27 .cse8 .cse23 .cse10 .cse28 .cse24 .cse29 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 .cse14 .cse29 .cse31 .cse16) (and .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse29 .cse31 .cse16)))) [2021-10-13 07:17:47,632 INFO L853 garLoopResultBuilder]: At program point L870(lines 862 1113) the Hoare annotation is: (let ((.cse20 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse25 (not .cse20))) (let ((.cse2 (= ~c_req_a~0 ~a_t~0)) (.cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse22 (= ~c_req_a~0 (_ bv0 32))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse17 (= ~s_memory2~0 (_ bv52 32))) (.cse18 (= (_ bv6 32) ~m_run_pc~0)) (.cse23 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse21 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse24 (= (_ bv0 32) ~a_t~0)) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse14 (= ~s_memory1~0 (_ bv51 32))) (.cse16 (or .cse25 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv3 32) ~m_run_pc~0)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse19 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse25)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse9) .cse10 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse4 .cse17 .cse7 .cse18 .cse11 .cse19 .cse20 .cse21 .cse9 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0) .cse12 .cse13 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse21 .cse9 (= ~c_req_a~0 ~req_tt_a~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 .cse13) (and .cse0 .cse22 .cse1 .cse4 .cse6 .cse7 .cse10 .cse11 .cse23 .cse24 (= ~c_req_d~0 (_ bv50 32)) .cse13) (and .cse0 .cse22 .cse1 .cse14 .cse15 .cse4 .cse17 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse18 .cse11 .cse23 .cse21 .cse24 .cse9 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13) (and .cse0 .cse1 .cse6 .cse7 (= ~c_empty_req~0 (_ bv1 32)) .cse13) (and .cse0 .cse3 .cse1 .cse14 .cse16 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse6 .cse7 .cse10 (= ~c_req_d~0 (_ bv52 32)) .cse11 .cse19 .cse20 .cse12 .cse13))))) [2021-10-13 07:17:47,633 INFO L857 garLoopResultBuilder]: For program point L738(lines 730 747) no Hoare annotation was computed. [2021-10-13 07:17:47,633 INFO L857 garLoopResultBuilder]: For program point L606(lines 487 839) no Hoare annotation was computed. [2021-10-13 07:17:47,633 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,633 INFO L857 garLoopResultBuilder]: For program point L408(lines 408 461) no Hoare annotation was computed. [2021-10-13 07:17:47,633 INFO L857 garLoopResultBuilder]: For program point L1201(lines 1201 1205) no Hoare annotation was computed. [2021-10-13 07:17:47,634 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 81) no Hoare annotation was computed. [2021-10-13 07:17:47,634 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,634 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,634 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,634 INFO L857 garLoopResultBuilder]: For program point L1003-1(lines 878 1108) no Hoare annotation was computed. [2021-10-13 07:17:47,634 INFO L857 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,635 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-10-13 07:17:47,635 INFO L857 garLoopResultBuilder]: For program point L739(lines 739 743) no Hoare annotation was computed. [2021-10-13 07:17:47,635 INFO L857 garLoopResultBuilder]: For program point L607(lines 607 611) no Hoare annotation was computed. [2021-10-13 07:17:47,635 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-10-13 07:17:47,635 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-10-13 07:17:47,636 INFO L853 garLoopResultBuilder]: At program point L277(lines 270 287) 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:17:47,636 INFO L857 garLoopResultBuilder]: For program point L1136(lines 1136 1143) no Hoare annotation was computed. [2021-10-13 07:17:47,636 INFO L857 garLoopResultBuilder]: For program point L1004(lines 1003 1027) no Hoare annotation was computed. [2021-10-13 07:17:47,636 INFO L857 garLoopResultBuilder]: For program point L938(lines 938 942) no Hoare annotation was computed. [2021-10-13 07:17:47,637 INFO L853 garLoopResultBuilder]: At program point L13-3(lines 1 1378) the Hoare annotation is: (let ((.cse20 (not (= (_ bv2 32) ~c_req_a~0)))) (let ((.cse15 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)))) (.cse17 (or .cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse19 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse5 (= ~s_memory2~0 (_ bv52 32))) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse13 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse12 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse12) .cse13) .cse14 (or (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse13) .cse15 .cse16 .cse17) (and .cse0 (not .cse18) .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse8 .cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= (_ bv0 32) ~a_t~0) .cse11 .cse13 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse20) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse11 .cse13 (or (= ~s_memory2~0 .cse12) .cse20) .cse14 .cse16 (= (_ bv2 32) ~req_tt_a~0))))) [2021-10-13 07:17:47,637 INFO L853 garLoopResultBuilder]: At program point L13-4(lines 72 84) the Hoare annotation is: (let ((.cse26 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse10 (not .cse26)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse23 (= ~c_req_a~0 (_ bv1 32))) (.cse27 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse21 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse1 (not .cse24)) (.cse2 (not .cse21)) (.cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse8 (not .cse27)) (.cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= (_ bv0 32) ~a_t~0)) (.cse15 (not .cse23)) (.cse16 (= ~c_req_d~0 (_ bv50 32))) (.cse18 (not .cse25)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse22 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse20 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse10)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse19 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (not (= ~s_run_st~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse20 (= ~s_run_pc~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse21 .cse22 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse5 .cse6 .cse23 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse11 .cse13 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse24 (= ~a_t~0 ULTIMATE.start_s_memory_write_~i) .cse17 .cse19) (and .cse0 .cse22 .cse3 .cse5 (= ~s_memory2~0 (_ bv52 32)) .cse6 .cse25 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse11 .cse20 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse26 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse27 .cse17 .cse19))))) [2021-10-13 07:17:47,637 INFO L857 garLoopResultBuilder]: For program point L278(lines 270 287) no Hoare annotation was computed. [2021-10-13 07:17:47,638 INFO L857 garLoopResultBuilder]: For program point L1005(lines 1005 1009) no Hoare annotation was computed. [2021-10-13 07:17:47,638 INFO L857 garLoopResultBuilder]: For program point L279(lines 279 283) no Hoare annotation was computed. [2021-10-13 07:17:47,638 INFO L853 garLoopResultBuilder]: At program point L147-2(lines 147 175) the Hoare annotation is: (let ((.cse9 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse1 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~m_run_pc~0 (_ bv0 32))) (.cse15 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse20 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse16 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse17 (= (_ bv3 32) ~m_run_pc~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)) (.cse19 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~c_req_a~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv0 32))) (.cse21 (= ~s_memory0~0 (_ bv50 32))) (.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 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse14 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 .cse17 .cse4 .cse18 .cse5 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse6 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse20 .cse11 (= ~a_t~0 ULTIMATE.start_s_memory_write_~i) .cse21 .cse12) (and .cse15 .cse14 (not .cse20) (not .cse16) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse17 .cse4 .cse5 .cse6 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not (= (_ bv2 32) ~c_req_a~0)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse19 .cse10 (not .cse18) (= ~c_req_d~0 (_ bv50 32)) .cse11 .cse21 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) .cse12))) [2021-10-13 07:17:47,638 INFO L857 garLoopResultBuilder]: For program point L676(lines 676 729) no Hoare annotation was computed. [2021-10-13 07:17:47,638 INFO L857 garLoopResultBuilder]: For program point L148(lines 147 175) no Hoare annotation was computed. [2021-10-13 07:17:47,639 INFO L857 garLoopResultBuilder]: For program point L677(lines 677 681) no Hoare annotation was computed. [2021-10-13 07:17:47,639 INFO L853 garLoopResultBuilder]: At program point L1272(lines 1265 1318) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,639 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 153) no Hoare annotation was computed. [2021-10-13 07:17:47,640 INFO L853 garLoopResultBuilder]: At program point L1074(lines 1067 1084) the Hoare annotation is: (let ((.cse19 (not (= (_ bv2 32) ~c_req_a~0))) (.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse16 (or .cse19 .cse20)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse18 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= ~c_write_rsp_ev~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse17 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse14 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse15 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse7 (= ~c_rsp_d~0 (_ bv51 32)) .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse13) .cse14) .cse15 (or (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse14) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and .cse0 (not .cse17) .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse8 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse9 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse14 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse18 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse19) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse14 (or (= ~s_memory2~0 .cse13) .cse19) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0))))) [2021-10-13 07:17:47,640 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 269) no Hoare annotation was computed. [2021-10-13 07:17:47,640 INFO L853 garLoopResultBuilder]: At program point L1207(lines 1200 1235) 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:17:47,640 INFO L857 garLoopResultBuilder]: For program point L1075(lines 878 1108) no Hoare annotation was computed. [2021-10-13 07:17:47,641 INFO L853 garLoopResultBuilder]: At program point L415(lines 408 461) the Hoare annotation is: (let ((.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= (_ 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))) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse8 (= (_ bv2 32) ~c_req_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse14 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse15) (not .cse13) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse9) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse8) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse14) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (not .cse6) .cse12))) [2021-10-13 07:17:47,641 INFO L853 garLoopResultBuilder]: At program point L349(lines 342 377) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,641 INFO L857 garLoopResultBuilder]: For program point L1340(lines 1340 1344) no Hoare annotation was computed. [2021-10-13 07:17:47,641 INFO L857 garLoopResultBuilder]: For program point L1340-1(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 07:17:47,641 INFO L857 garLoopResultBuilder]: For program point L1274(lines 1274 1278) no Hoare annotation was computed. [2021-10-13 07:17:47,642 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 221) no Hoare annotation was computed. [2021-10-13 07:17:47,642 INFO L857 garLoopResultBuilder]: For program point L1076(lines 1076 1080) no Hoare annotation was computed. [2021-10-13 07:17:47,642 INFO L853 garLoopResultBuilder]: At program point L944(lines 937 963) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ~a_t~0)) (.cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) (not .cse12))) (.cse13 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse7))) (.cse25 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= ~s_memory2~0 (_ bv52 32))) (.cse23 (= (_ bv6 32) ~m_run_pc~0)) (.cse24 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse26 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse30 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse31 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_req_d~0 (_ bv52 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse1) .cse4 .cse17 .cse5 .cse6 (= ~c_req_a~0 (_ bv1 32)) .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse18) .cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse10 .cse14 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse17 .cse22 .cse6 .cse8 .cse23 .cse10 .cse24 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse19 .cse18 (= ~c_req_a~0 ~req_tt_a~0) .cse25 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse18 .cse25 .cse15 .cse16 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse26 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse27 .cse8 .cse23 .cse10 .cse28 .cse24 .cse29 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 .cse14 .cse29 .cse31 .cse16) (and .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse29 .cse31 .cse16)))) [2021-10-13 07:17:47,643 INFO L853 garLoopResultBuilder]: At program point L878-1(lines 862 1113) the Hoare annotation is: (let ((.cse25 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse23 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse34 (= ~c_req_a~0 (_ bv1 32))) (.cse14 (not .cse25)) (.cse35 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (let ((.cse0 (not (= ~s_run_pc~0 (_ bv1 32)))) (.cse10 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse11 (= (_ bv3 32) ~m_run_pc~0)) (.cse16 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse7 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse9 (not .cse35)) (.cse29 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse24 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse14)) (.cse27 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse28 (= ~s_run_pc~0 (_ bv2 32))) (.cse21 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse30 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= ~s_memory2~0 (_ bv52 32))) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_st~0 (_ bv0 32))) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse31 (= (_ bv6 32) ~m_run_pc~0)) (.cse15 (= ~c_m_lock~0 (_ bv1 32))) (.cse26 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse13 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse36 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse19 (= ~s_memory0~0 (_ bv50 32))) (.cse33 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse17 (not .cse34)) (.cse20 (not .cse23)) (.cse32 (or .cse14 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_m_lock~0 (_ bv0 32)) .cse8 (= ~m_run_pc~0 (_ bv0 32))) (and .cse0 .cse9 (not .cse10) .cse4 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse11 .cse5 .cse12 .cse6 (not .cse13) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse14 .cse15 .cse16 .cse7 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse21 .cse4 .cse11 .cse22 .cse5 .cse23 .cse12 .cse6 (= ~c_req_d~0 (_ bv52 32)) .cse15 .cse24 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse25 .cse26 .cse27 .cse13 .cse19) (and .cse28 (not .cse29) .cse9 .cse21 .cse3 .cse4 .cse30 .cse22 .cse5 (= (_ bv0 32) ~req_tt_a~0) .cse12 .cse6 .cse31 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse15 .cse16 .cse26 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse7 .cse13 .cse17 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse19 .cse20 .cse32 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse0 .cse10 .cse21 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse33 (= (_ bv1 32) ~a_t~0) .cse11 .cse5 .cse34 .cse12 .cse6 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse35 .cse19) (and .cse1 .cse2 .cse4 .cse11 .cse5 (= ~c_req_type~0 (_ bv1 32)) .cse15 .cse16 (= ~s_run_pc~0 (_ bv0 32)) .cse7 .cse18 .cse8) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse28 .cse9 .cse21 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse30 .cse29 .cse22 .cse5 .cse12 .cse6 .cse31 .cse15 .cse24 .cse26 .cse27 .cse13 .cse17 (or (= ~s_memory2~0 .cse36) .cse14) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse19 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse28 (= |ULTIMATE.start_s_memory_read_#res| (_ bv51 32)) (= ULTIMATE.start_s_memory_read_~i ~req_tt_a~0) (= (_ bv1 32) ~req_tt_a~0) .cse21 .cse3 .cse4 .cse30 .cse22 .cse5 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse12 .cse6 (= ~c_rsp_d~0 (_ bv51 32)) .cse31 .cse15 .cse26 .cse13 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse36) .cse17) .cse19 (or .cse33 .cse17) .cse20 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse32))))) [2021-10-13 07:17:47,643 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 07:17:47,643 INFO L857 garLoopResultBuilder]: For program point L1209(lines 1209 1213) no Hoare annotation was computed. [2021-10-13 07:17:47,643 INFO L857 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-10-13 07:17:47,644 INFO L853 garLoopResultBuilder]: At program point L483(lines 135 484) the Hoare annotation is: (and (= ~s_run_pc~0 (_ bv2 32)) (not (= ~s_run_st~0 (_ bv0 32))) (not (bvslt ULTIMATE.start_m_run_~a~0 (_ bv3 32))) (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ~c_write_req_ev~0) (= (_ bv3 32) ~m_run_pc~0) (= ~s_memory2~0 (_ bv52 32)) (= (_ bv2 32) ~c_write_rsp_ev~0) (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32)) (= ~c_empty_req~0 (_ bv1 32)) (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) (= (_ bv2 32) ~c_req_a~0) (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i) (= ~c_m_lock~0 (_ bv0 32)) (= ~s_memory0~0 (_ bv50 32)) (= ~c_empty_rsp~0 (_ bv1 32))) [2021-10-13 07:17:47,644 INFO L857 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-10-13 07:17:47,644 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2021-10-13 07:17:47,644 INFO L857 garLoopResultBuilder]: For program point L946(lines 946 950) no Hoare annotation was computed. [2021-10-13 07:17:47,645 INFO L857 garLoopResultBuilder]: For program point L881-1(lines 878 1108) no Hoare annotation was computed. [2021-10-13 07:17:47,645 INFO L857 garLoopResultBuilder]: For program point L749(lines 749 755) no Hoare annotation was computed. [2021-10-13 07:17:47,645 INFO L853 garLoopResultBuilder]: At program point L749-1(lines 749 755) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,645 INFO L853 garLoopResultBuilder]: At program point L683(lines 676 729) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,645 INFO L857 garLoopResultBuilder]: For program point L882(lines 881 905) no Hoare annotation was computed. [2021-10-13 07:17:47,646 INFO L853 garLoopResultBuilder]: At program point L1147(lines 1121 1162) the Hoare annotation is: (let ((.cse31 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse39 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse34 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse52 (= ~c_req_a~0 (_ bv1 32))) (.cse57 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0)) (.cse25 (not .cse34)) (.cse21 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32)))) (.cse8 (not .cse39)) (.cse38 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse35 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse37 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse22 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse20 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse33 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32))) (.cse58 (not .cse31))) (let ((.cse32 (= ~c_req_d~0 (_ bv52 32))) (.cse13 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse41 (or .cse33 .cse58)) (.cse42 (or (not .cse22) .cse20)) (.cse43 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse44 (or (not .cse35) .cse37)) (.cse45 (or .cse8 .cse38)) (.cse4 (= ~c_req_type~0 (_ bv1 32))) (.cse30 (= ~c_req_d~0 (_ bv50 32))) (.cse46 (= (_ bv0 32) ~req_tt_a~0)) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse48 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32))) (.cse36 (or .cse25 .cse21)) (.cse19 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse25)) (.cse27 (= (_ bv2 32) ~req_tt_a~0)) (.cse56 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse14 (= ~s_memory2~0 (_ bv52 32))) (.cse47 (or .cse57 .cse58)) (.cse24 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse23 (not .cse52)) (.cse49 (or .cse25 .cse57)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse10 (= ~c_req_type~0 (_ bv0 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse55 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_memory1~0 (_ bv51 32))) (.cse50 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse51 (= (_ bv1 32) ~a_t~0)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse15 (= ~m_run_st~0 (_ bv0 32))) (.cse53 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse18 (= ~c_m_lock~0 (_ bv1 32))) (.cse26 (= ~s_memory0~0 (_ bv50 32))) (.cse7 (= ~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)) (.cse16 (= ~c_empty_req~0 (_ bv1 32))) (.cse17 (= (_ bv6 32) ~m_run_pc~0)) (.cse54 (= ~c_m_lock~0 (_ bv0 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse7 .cse1 .cse8 .cse9 .cse10 (= ~c_rsp_d~0 (_ bv52 32)) .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (= ~s_memory2~0 .cse24) .cse25) (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse26 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) .cse27) (and .cse7 .cse0 .cse11 .cse2 .cse3 .cse4 .cse18 .cse28 .cse29 .cse30 .cse6) (and .cse7 .cse1 .cse9 .cse11 .cse2 .cse14 .cse3 .cse31 .cse15 .cse16 .cse32 .cse18 .cse19 .cse33 .cse34 .cse20 .cse21 .cse22 .cse26) (and .cse7 .cse35 .cse9 .cse36 .cse37 .cse11 .cse2 .cse3 .cse4 .cse32 .cse18 .cse19 .cse34 .cse38 .cse39 .cse26 .cse6) (and .cse7 .cse1 .cse11 .cse40 .cse2 .cse41 .cse3 .cse15 .cse16 .cse42 .cse43 .cse25 .cse44 .cse18 .cse28 .cse29 .cse23 .cse30 .cse26 .cse45) (and .cse7 .cse1 (not .cse13) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 .cse46 .cse15 .cse16 .cse17 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse18 .cse28 .cse20 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) .cse29 .cse47 .cse22 .cse23 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) .cse48 .cse26 .cse49 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and .cse7 .cse11 .cse50 .cse40 .cse51 .cse2 .cse41 .cse3 .cse52 .cse53 .cse4 .cse42 .cse43 .cse44 .cse18 .cse26 .cse6 .cse45) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse18 .cse28 .cse5 .cse29 .cse30 .cse6) (and .cse0 .cse1 .cse3 .cse16 .cse5 .cse54 .cse6 .cse55) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse14 .cse3 .cse31 .cse46 .cse17 .cse18 .cse28 .cse33 .cse20 .cse29 .cse22 .cse48 .cse26 .cse6) (and .cse7 .cse9 .cse10 .cse36 .cse11 .cse12 .cse14 .cse3 .cse17 .cse18 .cse19 .cse34 .cse20 .cse22 .cse56 .cse26 .cse6 .cse27) (and .cse7 .cse1 .cse11 .cse3 .cse17 .cse18 .cse6) (and .cse7 .cse9 .cse10 (= ~c_req_a~0 ~a_t~0) .cse11 .cse12 .cse50 .cse14 .cse3 .cse17 .cse18 .cse20 .cse22 (= ~c_req_a~0 ~req_tt_a~0) .cse56 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse26 .cse6) (and .cse0 .cse10 .cse11 .cse3 .cse16 .cse5 .cse29 .cse54 .cse6 .cse55) (and .cse7 .cse1 .cse11 .cse2 .cse3 .cse6) (and .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) .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse15 .cse16 (= ~c_rsp_d~0 (_ bv51 32)) .cse17 .cse18 .cse20 .cse47 .cse22 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (or (= ~s_memory1~0 .cse24) .cse23) .cse26 (or .cse50 .cse23) (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse49) (and .cse7 .cse2 .cse3 .cse16 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse11 .cse3 .cse16 .cse29 .cse54 .cse6 .cse55) (and .cse7 .cse35 .cse1 .cse9 .cse37 .cse11 .cse50 .cse51 .cse2 .cse3 .cse52 .cse15 .cse16 .cse53 .cse18 .cse38 .cse39 .cse26) (and .cse7 .cse1 .cse11 .cse3 .cse16 .cse17 .cse54 .cse6))))) [2021-10-13 07:17:47,646 INFO L857 garLoopResultBuilder]: For program point L883(lines 883 887) no Hoare annotation was computed. [2021-10-13 07:17:47,646 INFO L857 garLoopResultBuilder]: For program point L685(lines 685 689) no Hoare annotation was computed. [2021-10-13 07:17:47,646 INFO L853 garLoopResultBuilder]: At program point L487-2(lines 487 839) the Hoare annotation is: (let ((.cse31 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse34 (bvadd ~req_tt_a~0 (_ bv50 32))) (.cse32 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse12 (not .cse32)) (.cse27 (bvadd ULTIMATE.start_m_run_~req_a___0~0 (_ bv50 32))) (.cse15 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse26 (= .cse34 ~s_memory2~0)) (.cse19 (not .cse31)) (.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse33 (= .cse34 ~s_memory1~0)) (.cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))))) (let ((.cse2 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse22 (or .cse33 .cse16)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse23 (or .cse3 .cse33)) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse24 (or (not (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse25 (or .cse26 .cse19)) (.cse14 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~c_m_lock~0 (_ bv0 32))) (.cse28 (or .cse33 .cse15)) (.cse29 (or (= ~s_memory1~0 .cse27) .cse15)) (.cse18 (= ~s_memory0~0 (_ bv50 32))) (.cse20 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse21 (= ULTIMATE.start_m_run_~rsp_d___0~0 .cse27)) (.cse30 (or .cse12 .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse3 (not (bvslt ULTIMATE.start_m_run_~a~0 (_ bv3 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse23 .cse11 .cse24 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse25 .cse14 .cse15 (or .cse2 .cse26) (or (= ~s_memory2~0 .cse27) .cse12) .cse16 .cse17 .cse28 .cse29 .cse18 .cse20 .cse21 .cse30) (and .cse0 .cse1 .cse4 .cse6 (= (_ bv3 32) ~m_run_pc~0) .cse8 .cse9 .cse31 .cse10 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse32 .cse13 .cse14 .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ~a_t~0) .cse8 .cse9 .cse22 .cse10 .cse23 .cse11 .cse24 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse13 .cse25 .cse14 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse17 .cse28 .cse29 .cse18 .cse20 .cse21 .cse30))))) [2021-10-13 07:17:47,647 INFO L853 garLoopResultBuilder]: At program point L1280(lines 1273 1317) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,647 INFO L853 garLoopResultBuilder]: At program point L223(lines 216 269) the Hoare annotation is: (let ((.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv3 32) ~m_run_pc~0)) (.cse8 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse18 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse12 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse6 (= ~c_req_type~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse14 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse17 (= (_ bv0 32) ~a_t~0)) (.cse19 (= ~c_req_d~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv1 32) ~a_t~0) .cse3 .cse4 .cse5 .cse6 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv2 32) ~c_req_a~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse4 .cse5 .cse6 .cse13 .cse14 .cse15 .cse11 .cse16) (and .cse0 .cse2 (not .cse9) (not .cse1) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse3 .cse4 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse5 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) .cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse7 .cse8 .cse17 .cse10 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) .cse11) (and .cse18 .cse12 .cse4 .cse5 .cse6 .cse13 .cse7 .cse14 .cse15 .cse17 .cse19 .cse11 .cse16) (and .cse0 .cse18 .cse12 .cse2 .cse4 .cse5 .cse6 .cse13 .cse7 .cse14 .cse17 .cse19 .cse11 .cse16))) [2021-10-13 07:17:47,647 INFO L857 garLoopResultBuilder]: For program point L488(lines 487 839) no Hoare annotation was computed. [2021-10-13 07:17:47,647 INFO L860 garLoopResultBuilder]: At program point L1347(lines 1169 1352) the Hoare annotation is: true [2021-10-13 07:17:47,648 INFO L853 garLoopResultBuilder]: At program point L290-2(lines 290 318) the Hoare annotation is: (let ((.cse16 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse15 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32))) (.cse5 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse7 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v)) (.cse32 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse31 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse29 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32))) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse22 (= (_ bv0 32) ~a_t~0))) (let ((.cse26 (= ~s_memory2~0 (_ bv52 32))) (.cse21 (= ~s_run_pc~0 (_ bv0 32))) (.cse18 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse33 (not .cse22)) (.cse13 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0)) (.cse25 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32)))) (.cse6 (= ~s_memory1~0 (_ bv51 32))) (.cse9 (= (_ bv1 32) ~a_t~0)) (.cse19 (= ~c_req_type~0 (_ bv1 32))) (.cse28 (= ~c_req_d~0 (_ bv52 32))) (.cse40 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse24 (not (= (_ bv4 32) ~m_run_pc~0))) (.cse4 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse36 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse10 (= (_ bv3 32) ~m_run_pc~0)) (.cse34 (or .cse29 (not .cse27))) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_req~0 (_ bv1 32))) (.cse42 (or (not .cse32) .cse31)) (.cse37 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32))) (.cse30 (= (_ bv2 32) ~c_req_a~0)) (.cse39 (or (not .cse5) .cse7)) (.cse14 (= ~c_m_lock~0 (_ bv1 32))) (.cse20 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse11 (= ~c_req_a~0 (_ bv1 32))) (.cse23 (= ~c_req_d~0 (_ bv50 32))) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse41 (or (not .cse16) .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse3 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse2 .cse3 .cse19 .cse14 .cse20 .cse21 .cse22 .cse23 .cse4 .cse24) (and .cse0 .cse1 .cse25 .cse6 .cse2 .cse10 .cse26 .cse3 .cse27 .cse12 .cse28 .cse14 .cse29 .cse30 .cse31 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse32 .cse17) (and .cse0 .cse5 .cse25 .cse6 .cse7 .cse2 .cse3 .cse19 (or .cse26 (not .cse9)) .cse28 .cse14 .cse30 .cse15 .cse16 (or .cse26 .cse33) .cse17 .cse4 .cse24) (and .cse18 .cse1 .cse3 .cse19 .cse21 .cse4) (and .cse0 .cse18 .cse2 .cse3 .cse19 .cse14 .cse20 .cse22 .cse23 .cse4 .cse24) (and .cse8 .cse34 (let ((.cse35 (let ((.cse38 (or (and .cse0 (= ~c_req_a~0 ~a_t~0) .cse2 .cse3 .cse11 .cse19 .cse14 .cse4) (and .cse0 (= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) .cse2 (= ~c_req_a~0 ULTIMATE.start_m_run_~a~0) .cse3 .cse11 .cse19 .cse14 .cse4)))) (or (and .cse36 .cse13 .cse37 .cse38 .cse39 .cse40 .cse22 .cse17 .cse24 .cse41) (and (or .cse6 .cse33) .cse36 .cse13 .cse37 .cse38 .cse39 (or .cse6 (not .cse20)) .cse17 .cse24 .cse41))))) (or (and .cse9 .cse35) (and .cse22 .cse35))) .cse42) (and .cse0 .cse5 .cse25 .cse6 (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) .cse7 .cse2 .cse9 .cse3 .cse19 .cse28 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse14 .cse30 .cse40 .cse15 .cse16 .cse17 .cse4 .cse24) (and .cse0 .cse10 .cse3 .cse12 .cse4) (and .cse0 .cse1 .cse2 .cse36 .cse10 .cse34 .cse3 .cse12 .cse42 .cse37 (not .cse30) .cse39 .cse14 .cse20 .cse22 (not .cse11) .cse23 .cse17 .cse41)))) [2021-10-13 07:17:47,648 INFO L853 garLoopResultBuilder]: At program point L1215(lines 1208 1234) 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:17:47,649 INFO L853 garLoopResultBuilder]: At program point L819(lines 812 829) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse17 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= ~c_req_type~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse6 (= ~s_memory2~0 (_ bv52 32))) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse11 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse12 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse19 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse13 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (= (_ 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) .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse8 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse16) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse17 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 (= ~c_rsp_d~0 (_ bv52 32)) .cse4 .cse5 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse12 .cse19 .cse13 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse14 .cse15 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (not .cse18) .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse9 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse11 .cse12 .cse19 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32)))))) [2021-10-13 07:17:47,649 INFO L857 garLoopResultBuilder]: For program point L621(lines 621 625) no Hoare annotation was computed. [2021-10-13 07:17:47,649 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-13 07:17:47,649 INFO L853 garLoopResultBuilder]: At program point L423(lines 416 460) the Hoare annotation is: (let ((.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= (_ 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))) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse8 (= (_ bv2 32) ~c_req_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse14 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse15) (not .cse13) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse9) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse8) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse14) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (not .cse6) .cse12))) [2021-10-13 07:17:47,650 INFO L853 garLoopResultBuilder]: At program point L357(lines 350 376) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,650 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 318) no Hoare annotation was computed. [2021-10-13 07:17:47,650 INFO L857 garLoopResultBuilder]: For program point L1282(lines 1282 1286) no Hoare annotation was computed. [2021-10-13 07:17:47,650 INFO L857 garLoopResultBuilder]: For program point L225(lines 225 229) no Hoare annotation was computed. [2021-10-13 07:17:47,651 INFO L853 garLoopResultBuilder]: At program point L952(lines 945 962) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ~a_t~0)) (.cse11 (or (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) (not .cse12))) (.cse13 (or (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) (not .cse7))) (.cse25 (= ULTIMATE.start_m_run_~req_a___0~0 ~c_req_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse20 (= ~c_req_type~0 (_ bv0 32))) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse22 (= ~s_memory2~0 (_ bv52 32))) (.cse23 (= (_ bv6 32) ~m_run_pc~0)) (.cse24 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse18 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse26 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse30 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32))) (.cse5 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 (_ bv0 32))) (.cse8 (= ~c_empty_req~0 (_ bv1 32))) (.cse9 (= ~c_req_type~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse28 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 (_ bv1 32))) (.cse29 (= (_ bv0 32) ~a_t~0)) (.cse31 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_req_d~0 (_ bv52 32)) .cse10 .cse11 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse1) .cse4 .cse17 .cse5 .cse6 (= ~c_req_a~0 (_ bv1 32)) .cse8 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (not .cse18) .cse9 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) .cse10 .cse14 .cse19 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse17 .cse22 .cse6 .cse8 .cse23 .cse10 .cse24 (= ULTIMATE.start_s_run_~req_a~1 ~req_tt_a~0) .cse19 .cse18 (= ~c_req_a~0 ~req_tt_a~0) .cse25 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse18 .cse25 .cse15 .cse16 (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse26 .cse2 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse27 .cse8 .cse23 .cse10 .cse28 .cse24 .cse29 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 .cse14 .cse29 .cse31 .cse16) (and .cse26 .cse2 .cse4 .cse30 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse28 (= ~s_run_pc~0 (_ bv0 32)) .cse14 .cse29 .cse31 .cse16)))) [2021-10-13 07:17:47,651 INFO L857 garLoopResultBuilder]: For program point L820(lines 812 829) no Hoare annotation was computed. [2021-10-13 07:17:47,651 INFO L857 garLoopResultBuilder]: For program point L292(lines 292 296) no Hoare annotation was computed. [2021-10-13 07:17:47,651 INFO L857 garLoopResultBuilder]: For program point L1217(lines 1217 1221) no Hoare annotation was computed. [2021-10-13 07:17:47,652 INFO L857 garLoopResultBuilder]: For program point L1151(lines 1151 1158) no Hoare annotation was computed. [2021-10-13 07:17:47,652 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 07:17:47,652 INFO L857 garLoopResultBuilder]: For program point L953(lines 878 1108) no Hoare annotation was computed. [2021-10-13 07:17:47,652 INFO L857 garLoopResultBuilder]: For program point L821(lines 821 825) no Hoare annotation was computed. [2021-10-13 07:17:47,652 INFO L857 garLoopResultBuilder]: For program point L425(lines 425 429) no Hoare annotation was computed. [2021-10-13 07:17:47,653 INFO L857 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2021-10-13 07:17:47,653 INFO L857 garLoopResultBuilder]: For program point L954(lines 954 958) no Hoare annotation was computed. [2021-10-13 07:17:47,653 INFO L853 garLoopResultBuilder]: At program point L691(lines 684 728) the Hoare annotation is: (let ((.cse20 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory2~0))) (let ((.cse3 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (.cse16 (not (= ~c_req_a~0 (_ bv1 32)))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= ~s_memory1~0 (_ bv51 32))) (.cse5 (= ~c_req_type~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse8 (= ~s_memory2~0 (_ bv52 32))) (.cse9 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse14 (or .cse20 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))))) (.cse15 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (or (not (= (_ bv2 32) ~c_req_a~0)) .cse20))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~req_tt_a~0) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 (_ bv50 32)) .cse11 (= |ULTIMATE.start_s_memory_read_#res| (_ bv50 32)) (= ~c_rsp_d~0 (_ bv50 32)) .cse12 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) .cse13 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse14 .cse15 .cse16 (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv50 32))) (and (= ULTIMATE.start_s_memory_read_~x~0 (_ bv52 32)) .cse0 .cse1 .cse3 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv52 32)) .cse6 .cse7 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse8 .cse9 .cse10 .cse11 (= (_ bv52 32) ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 .cse13 (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse15 .cse16 (= |ULTIMATE.start_s_memory_read_#res| (_ bv52 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv52 32)) (= (_ bv2 32) ~req_tt_a~0)) (and .cse0 .cse1 (= (_ 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) .cse4 .cse5 .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~x~0 (_ bv51 32)) .cse10 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse17 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 (_ bv51 32)) .cse19)))) [2021-10-13 07:17:47,653 INFO L853 garLoopResultBuilder]: At program point L559(lines 529 560) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse8 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse14 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse4 (= ~s_memory2~0 (_ bv52 32))) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse16 (= (_ bv6 32) ~m_run_pc~0)) (.cse17 (not .cse8)) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse18 (not .cse6)) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv3 32) ~m_run_pc~0) .cse4 .cse5 .cse6 (= ~c_req_d~0 (_ bv52 32)) .cse7 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse4 .cse5 .cse16 .cse17 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse7 .cse9 .cse10 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse12 .cse18 .cse13) (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse14 .cse3 .cse15 .cse4 .cse5 .cse16 .cse17 .cse7 .cse9 .cse10 (= (_ bv0 32) ~a_t~0) .cse11 (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse12 .cse18 .cse13)))) [2021-10-13 07:17:47,654 INFO L857 garLoopResultBuilder]: For program point L758(lines 758 811) no Hoare annotation was computed. [2021-10-13 07:17:47,654 INFO L857 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-10-13 07:17:47,654 INFO L857 garLoopResultBuilder]: For program point L693(lines 693 697) no Hoare annotation was computed. [2021-10-13 07:17:47,654 INFO L853 garLoopResultBuilder]: At program point L627(lines 620 637) 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:17:47,655 INFO L853 garLoopResultBuilder]: At program point L1288(lines 1281 1316) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 (_ bv0 32))) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse8 (= ~m_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse7 (= ~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 .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11 (= ~c_m_lock~0 (_ bv1 32)) .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse10 .cse3 .cse6 (= (_ bv0 32) ~a_t~0) .cse7 .cse5 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse6 .cse11 .cse7 .cse5))) [2021-10-13 07:17:47,655 INFO L853 garLoopResultBuilder]: At program point L231(lines 224 268) the Hoare annotation is: (let ((.cse9 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse1 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse3 (= (_ bv3 32) ~m_run_pc~0)) (.cse8 (= (bvadd ULTIMATE.start_m_run_~req_a~0 (_ bv50 32)) ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse18 (= ULTIMATE.start_m_run_~req_d~0 (_ bv50 32))) (.cse12 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse4 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse5 (= (_ bv1 32) ULTIMATE.start_m_run_~req_type~0)) (.cse6 (= ~c_req_type~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ULTIMATE.start_m_run_~req_a~0)) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse14 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0)) (.cse17 (= (_ bv0 32) ~a_t~0)) (.cse19 (= ~c_req_d~0 (_ bv50 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse16 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 (_ bv51 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~req_a~0) (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) (= (_ bv1 32) ~a_t~0) .cse3 .cse4 .cse5 .cse6 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse7 (= (_ bv2 32) ~c_req_a~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse4 .cse5 .cse6 .cse13 .cse14 .cse15 .cse11 .cse16) (and .cse0 .cse2 (not .cse9) (not .cse1) (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse3 .cse4 (= ~c_req_a~0 (_ bv1 32)) (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse5 (not (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) .cse6 (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (= (_ bv1 32) ULTIMATE.start_m_run_~req_a~0) .cse7 .cse8 .cse17 .cse10 (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) .cse11) (and .cse18 .cse12 .cse4 .cse5 .cse6 .cse13 .cse7 .cse14 .cse15 .cse17 .cse19 .cse11 .cse16) (and .cse0 .cse18 .cse12 .cse2 .cse4 .cse5 .cse6 .cse13 .cse7 .cse14 .cse17 .cse19 .cse11 .cse16))) [2021-10-13 07:17:47,655 INFO L857 garLoopResultBuilder]: For program point L1090(lines 1090 1094) no Hoare annotation was computed. [2021-10-13 07:17:47,655 INFO L857 garLoopResultBuilder]: For program point L628(lines 620 637) no Hoare annotation was computed. [2021-10-13 07:17:47,656 INFO L853 garLoopResultBuilder]: At program point L1223(lines 1216 1233) 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:17:47,656 INFO L857 garLoopResultBuilder]: For program point L629(lines 629 633) no Hoare annotation was computed. [2021-10-13 07:17:47,656 INFO L853 garLoopResultBuilder]: At program point L431(lines 424 459) the Hoare annotation is: (let ((.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse13 (= (_ 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))) (.cse9 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse8 (= (_ bv2 32) ~c_req_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv0 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse14 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse15) (not .cse13) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse9) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse8) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse14) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (not .cse6) .cse12))) [2021-10-13 07:17:47,657 INFO L853 garLoopResultBuilder]: At program point L497-2(lines 497 525) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse8 (= (_ bv2 32) ~c_req_a~0))) (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse15 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 (_ bv0 32))) (.cse4 (= ~s_memory2~0 (_ bv52 32))) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse17 (= (_ bv6 32) ~m_run_pc~0)) (.cse18 (not .cse8)) (.cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v)) (.cse10 (= (_ bv0 32) ULTIMATE.start_m_run_~req_type___0~0)) (.cse11 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse12 (= ~c_m_lock~0 (_ bv0 32))) (.cse13 (= ~s_memory0~0 (_ bv50 32))) (.cse19 (not .cse6)) (.cse14 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv3 32) ~m_run_pc~0) .cse4 .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv0 32)) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse16 (= (_ bv1 32) ~a_t~0) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv2 32)) .cse4 .cse5 .cse7 .cse17 .cse18 (= (_ bv2 32) ULTIMATE.start_m_run_~a~0) .cse9 .cse10 (= (bvadd ~req_tt_a~0 (_ bv50 32)) ~s_memory1~0) .cse11 (= ULTIMATE.start_s_memory_read_~i ~a_t~0) .cse12 .cse13 .cse19 .cse14) (and .cse0 .cse1 (not (= (_ bv2 32) ULTIMATE.start_s_memory_read_~i)) (not (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) .cse2 .cse15 .cse3 .cse16 .cse4 .cse5 .cse7 .cse17 .cse18 .cse9 .cse10 (= (_ bv0 32) ~a_t~0) .cse11 (not (= ~c_req_a~0 (_ bv1 32))) (not (= ULTIMATE.start_s_memory_read_~i (_ bv1 32))) (= ULTIMATE.start_m_run_~req_a___0~0 (_ bv1 32)) .cse12 (= ULTIMATE.start_m_run_~req_a___0~0 ULTIMATE.start_m_run_~a~0) .cse13 .cse19 .cse14)))) [2021-10-13 07:17:47,657 INFO L853 garLoopResultBuilder]: At program point L365(lines 358 375) the Hoare annotation is: (let ((.cse10 (= (_ bv2 32) ULTIMATE.start_s_memory_write_~i)) (.cse9 (= (_ bv2 32) ~c_req_a~0)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse14 (= (_ bv1 32) ULTIMATE.start_s_memory_write_~i)) (.cse1 (not (= ~s_run_st~0 (_ bv0 32)))) (.cse2 (= ~s_memory1~0 (_ bv51 32))) (.cse3 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse15 (= ~c_req_a~0 (_ bv1 32))) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 (_ bv1 32))) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 (not (bvslt (bvadd (_ bv1 32) ULTIMATE.start_m_run_~a~0) (_ bv3 32))) .cse2 .cse3 .cse4 (= ~s_memory2~0 (_ bv52 32)) .cse5 .cse6 .cse7 (= ~c_req_d~0 (_ bv52 32)) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv52 32)) .cse9 (= (_ bv52 32) ULTIMATE.start_s_memory_write_~v) (not (bvslt (bvadd (_ bv1 32) ~a_t~0) (_ bv3 32))) .cse10 .cse11 .cse12) (and .cse0 .cse1 (not .cse13) (not .cse14) .cse3 (= ULTIMATE.start_s_run_~req_d~1 (_ bv50 32)) .cse4 .cse5 .cse7 (not .cse10) (= ULTIMATE.start_s_memory_write_~v (_ bv50 32)) (not .cse9) .cse8 (= (_ bv0 32) ULTIMATE.start_m_run_~a~0) (= (_ bv0 32) ~a_t~0) (not .cse15) (= ~c_req_d~0 (_ bv50 32)) .cse11 (not .cse6) .cse12) (and .cse0 .cse14 .cse1 .cse2 (= (_ bv51 32) ULTIMATE.start_s_memory_write_~v) .cse3 (= (_ bv1 32) ULTIMATE.start_m_run_~a~0) (= (_ bv1 32) ~a_t~0) .cse4 .cse5 .cse15 .cse7 (= (bvadd ~c_req_a~0 (_ bv50 32)) ~c_req_d~0) .cse8 (= ULTIMATE.start_s_run_~req_d~1 (_ bv51 32)) .cse13 .cse11 .cse12))) [2021-10-13 07:17:47,657 INFO L857 garLoopResultBuilder]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2021-10-13 07:17:47,657 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 237) no Hoare annotation was computed. [2021-10-13 07:17:47,658 INFO L857 garLoopResultBuilder]: For program point L1224(lines 1172 1351) no Hoare annotation was computed. [2021-10-13 07:17:47,663 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:17:47,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:17:47 BoogieIcfgContainer [2021-10-13 07:17:47,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:17:47,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:17:47,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:17:47,877 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:17:47,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:08:40" (3/4) ... [2021-10-13 07:17:47,880 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:17:47,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-13 07:17:47,910 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 07:17:47,912 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:17:47,913 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:17:47,950 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) || (((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((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 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 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) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && !(2bv32 == c_req_a)) && (!(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 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 1bv32 == a_t) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(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) && 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) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((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_memory1 == 51bv32) && c_req_type == 0bv32) && c_req_a == a_t) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && 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 && 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 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || ((((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 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && 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:17:47,950 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) || (((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((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 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 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) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && !(2bv32 == c_req_a)) && (!(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 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && 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 && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 1bv32 == a_t) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(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) && 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) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((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_memory1 == 51bv32) && c_req_type == 0bv32) && c_req_a == a_t) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && 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 && 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 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || ((((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) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && s_memory0 == 50bv32)) || (((((((((((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:17:47,953 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 == 1bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32))) || (((((((((((((((((!(s_run_pc == 1bv32) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((!(s_run_pc == 1bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && 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)) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && !(req_a == 2bv32)) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,954 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((s_run_pc == 2bv32 && !(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) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((((((!(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) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) [2021-10-13 07:17:47,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && c_req_a == req_tt_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && 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) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((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:17:47,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) || ((((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && s_run_pc == 0bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && s_memory0 == 50bv32) [2021-10-13 07:17:47,963 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) || ((((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && s_run_pc == 0bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && s_memory0 == 50bv32) [2021-10-13 07:17:47,966 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) [2021-10-13 07:17:47,968 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((s_memory1 == 51bv32 && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && req_a == 2bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && (((((!(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))) && 2bv32 == i) && s_memory0 == 50bv32) || ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((!(req_a == 1bv32) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 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_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32))) || (((((((((((((1bv32 == i && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 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) && req_a == 1bv32) && a_t == i) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32)))) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) [2021-10-13 07:17:47,968 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) [2021-10-13 07:17:47,968 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) [2021-10-13 07:17:47,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((1bv32 == a_t && s_memory2 == 52bv32) && 52bv32 == v) && 2bv32 == i) && (((((!(req_a == 1bv32) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))))) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == a) || ((c_req_a == a_t && 1bv32 == a) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 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 && s_memory1 == 51bv32) && c_req_type == 0bv32) && s_memory2 == 52bv32) && req_a == 2bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)))) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((s_memory2 == ~bvadd64(req_a___0, 50bv32) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && (!(2bv32 == i) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)))) || (((((s_memory2 == 52bv32 && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && (((((!(req_a == 1bv32) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))))) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == a) || ((c_req_a == a_t && 1bv32 == a) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 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_m_lock == 1bv32) && 0bv32 == a) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((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:17:47,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) [2021-10-13 07:17:47,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,971 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,971 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,971 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) [2021-10-13 07:17:47,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) [2021-10-13 07:17:47,973 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) [2021-10-13 07:17:47,973 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) [2021-10-13 07:17:47,973 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) [2021-10-13 07:17:47,974 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) [2021-10-13 07:17:47,974 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) [2021-10-13 07:17:48,177 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:17:48,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:17:48,179 INFO L168 Benchmark]: Toolchain (without parser) took 549580.81 ms. Allocated memory was 60.8 MB in the beginning and 5.3 GB in the end (delta: 5.3 GB). Free memory was 39.6 MB in the beginning and 3.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,179 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 60.8 MB. Free memory is still 41.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:17:48,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.32 ms. Allocated memory is still 60.8 MB. Free memory was 39.3 MB in the beginning and 36.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.56 ms. Allocated memory is still 60.8 MB. Free memory was 36.1 MB in the beginning and 32.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,181 INFO L168 Benchmark]: Boogie Preprocessor took 74.36 ms. Allocated memory is still 60.8 MB. Free memory was 32.7 MB in the beginning and 29.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,181 INFO L168 Benchmark]: RCFGBuilder took 1086.37 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 29.2 MB in the beginning and 46.7 MB in the end (delta: -17.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,182 INFO L168 Benchmark]: TraceAbstraction took 547492.95 ms. Allocated memory was 77.6 MB in the beginning and 5.3 GB in the end (delta: 5.3 GB). Free memory was 46.3 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,182 INFO L168 Benchmark]: Witness Printer took 301.83 ms. Allocated memory is still 5.3 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 34.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:17:48,186 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 60.8 MB. Free memory is still 41.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 538.32 ms. Allocated memory is still 60.8 MB. Free memory was 39.3 MB in the beginning and 36.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.56 ms. Allocated memory is still 60.8 MB. Free memory was 36.1 MB in the beginning and 32.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.36 ms. Allocated memory is still 60.8 MB. Free memory was 32.7 MB in the beginning and 29.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1086.37 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 29.2 MB in the beginning and 46.7 MB in the end (delta: -17.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 547492.95 ms. Allocated memory was 77.6 MB in the beginning and 5.3 GB in the end (delta: 5.3 GB). Free memory was 46.3 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 16.1 GB. * Witness Printer took 301.83 ms. Allocated memory is still 5.3 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 34.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 274 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 547215.0ms, OverallIterations: 28, TraceHistogramMax: 13, EmptinessCheckTime: 103.1ms, AutomataDifference: 46413.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 282237.8ms, InitialAbstractionConstructionTime: 17.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17361 SDtfs, 59006 SDslu, 102880 SDs, 0 SdLazy, 10792 SolverSat, 1721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9682.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29863 GetRequests, 29096 SyntacticMatches, 0 SemanticMatches, 767 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23691 ImplicationChecksByTransitivity, 21784.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11287occurred in iteration=10, InterpolantAutomatonStates: 627, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 9794.4ms AutomataMinimizationTime, 28 MinimizatonAttempts, 101365 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 814 NumberOfFragments, 27450 HoareAnnotationTreeSize, 98 FomulaSimplifications, 148322739539 FormulaSimplificationTreeSizeReduction, 40960.0ms HoareSimplificationTime, 98 FomulaSimplificationsInter, 23921087875 FormulaSimplificationTreeSizeReductionInter, 241163.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1419.3ms SsaConstructionTime, 6006.4ms SatisfiabilityAnalysisTime, 84601.5ms InterpolantComputationTime, 14576 NumberOfCodeBlocks, 14576 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 29060 ConstructedInterpolants, 0 QuantifiedInterpolants, 84194 SizeOfPredicates, 374 NumberOfNonLiveVariables, 26201 ConjunctsInSsa, 512 ConjunctsInUnsatCore, 92 InterpolantComputations, 40 PerfectInterpolantSequences, 23057/38636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 1238]: Loop Invariant Derived loop invariant: (((((((c_req_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: 530]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 2bv32 == a) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 937]: 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) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && req_type == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && req_a == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && req_a == req_tt_a) && req_a == a_t) && 2bv32 == i) && 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)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && 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) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((((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 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a_t) && 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) && 1bv32 == req_type) && 2bv32 == a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((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)) || ((((((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 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) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1281]: 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) || (((((((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 && !(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)) && 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: 582]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory2 == ~bvadd64(req_a___0, 50bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 462]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) || ((((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && s_run_pc == 0bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 248]: 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)) || ((((((((((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)) || ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 1bv32 == a_t) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && c_req_d == 52bv32) && 2bv32 == a) && c_m_lock == 1bv32) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 2bv32 == c_req_a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 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) && !(2bv32 == i)) && 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_a == 2bv32)) - InvariantResult [Line: 1121]: 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) || (((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((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 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 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) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && !(2bv32 == c_req_a)) && (!(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 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 1bv32 == a_t) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(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) && 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) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((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_memory1 == 51bv32) && c_req_type == 0bv32) && c_req_a == a_t) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && 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 && 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 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || ((((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 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && 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: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && c_req_a == req_tt_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && 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) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((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: 730]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 232]: 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)) || ((((((((((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)) || ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 1bv32 == a_t) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && c_req_d == 52bv32) && 2bv32 == a) && c_m_lock == 1bv32) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 2bv32 == c_req_a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 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) && !(2bv32 == i)) && 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_a == 2bv32)) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1200]: 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: 1051]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) - InvariantResult [Line: 497]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && 0bv32 == a) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 2bv32 == a) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 136]: 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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || ((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(a, 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a_t) && 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) && 2bv32 == a) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && 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) && 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 && 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: 640]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((1bv32 == a_t && s_memory2 == 52bv32) && 52bv32 == v) && 2bv32 == i) && (((((!(req_a == 1bv32) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))))) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == a) || ((c_req_a == a_t && 1bv32 == a) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 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 && s_memory1 == 51bv32) && c_req_type == 0bv32) && s_memory2 == 52bv32) && req_a == 2bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)))) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((s_memory2 == ~bvadd64(req_a___0, 50bv32) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && (!(2bv32 == i) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32)))) || (((((s_memory2 == 52bv32 && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && (((((!(req_a == 1bv32) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))))) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == a) || ((c_req_a == a_t && 1bv32 == a) && (((((((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a) && (!(req_a == 1bv32) || ~bvadd64(req_tt_a, 50bv32) == s_memory1)) && 0bv32 == a_t) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) || (((((((s_memory1 == 51bv32 && c_req_type == 0bv32) && req_type == 0bv32) && c_req_a == req_tt_a) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && (((((((s_run_pc == 2bv32 && 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 && 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_m_lock == 1bv32) && 0bv32 == a) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((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: 1067]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) - InvariantResult [Line: 831]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && 1bv32 == a_t) && s_memory2 == 52bv32) && 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) && (!(1bv32 == i) || 51bv32 == v)) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && 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) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || (((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 0bv32 == a) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32))) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && (!(1bv32 == i) || 51bv32 == v)) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && !(i == 1bv32)) && 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) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 929]: 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) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && req_type == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && req_a == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && req_a == req_tt_a) && req_a == a_t) && 2bv32 == i) && 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)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && 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) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 146]: 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 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && !(c_m_lock == 1bv32)) && 2bv32 == req_a) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a_t) && 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) && 1bv32 == req_type) && 2bv32 == a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && 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 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && req_a == a) && !(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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || ((((((((((((((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: 529]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 2bv32 == a) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 967]: 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) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && req_type == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && req_a == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && req_a == req_tt_a) && req_a == a_t) && 2bv32 == i) && 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)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && 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) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) - InvariantResult [Line: 812]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) - InvariantResult [Line: 1265]: 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) || (((((((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 && !(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)) && 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: 749]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 1184]: 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: 566]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory2 == ~bvadd64(req_a___0, 50bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 103]: 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 == a_t) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(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_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && 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_t) && c_req_d == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || (((((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 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && (!(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))) || ((((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) && 1bv32 == a_t) && 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) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 620]: 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: 1216]: 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: 350]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory2 == ~bvadd64(req_a___0, 50bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1121]: 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) || (((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((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 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 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) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && !(2bv32 == c_req_a)) && (!(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 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && 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 && 2bv32 == c_write_req_ev) && 1bv32 == a) && req_d == 50bv32) && 1bv32 == a_t) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && c_req_type == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && (!(1bv32 == i) || 51bv32 == v)) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(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) && 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) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_req_type == 0bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((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_memory1 == 51bv32) && c_req_type == 0bv32) && c_req_a == a_t) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && 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 && 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 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || ((((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) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && s_memory0 == 50bv32)) || (((((((((((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: 326]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 921]: 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) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && req_type == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && req_a == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && req_a == req_tt_a) && req_a == a_t) && 2bv32 == i) && 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)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && 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) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 1bv32 == a_t) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && c_req_d == 52bv32) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && 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)) || ((((((((((((((((((((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) && !(2bv32 == i)) && 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) && !(req_a == 2bv32)) && 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) && 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: 782]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) - InvariantResult [Line: 1273]: 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) || (((((((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 && !(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)) && 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: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 1208]: 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: 862]: 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 == 1bv32) && !(req_a == 1bv32)) && !(1bv32 == i)) && 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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32))) || (((((((((((((((((!(s_run_pc == 1bv32) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((!(s_run_pc == 1bv32) && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && 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)) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && !(req_a == 2bv32)) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 1bv32 == a_t) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && c_req_d == 52bv32) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && 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)) || ((((((((((((((((((((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) && !(2bv32 == i)) && 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) && !(req_a == 2bv32)) && 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) && 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: 862]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && c_req_a == a_t) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_req_a == a_t) && 2bv32 == c_write_req_ev) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && c_req_a == req_tt_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 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && 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)) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1192]: 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: 1169]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) - InvariantResult [Line: 147]: 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) || ((((((((((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)) || ((((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 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) && 1bv32 == req_type) && 2bv32 == a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && c_m_lock == 0bv32) && a_t == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 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) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && !(c_m_lock == 1bv32)) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && !(m_run_pc == 1bv32)) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || (((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && !(c_m_lock == 1bv32)) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && !(m_run_pc == 1bv32)) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 2bv32 == a) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && !(c_m_lock == 1bv32)) && 2bv32 == c_write_req_ev) && !(m_run_pc == 1bv32)) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && 0bv32 == a) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(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) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && 52bv32 == rsp_d___0) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && c_m_lock == 0bv32) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) - InvariantResult [Line: 1353]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1043]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) || ((((((((((((((((((!(s_run_st == 0bv32) && !(req_a == 1bv32)) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && c_empty_req == 1bv32) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && s_run_pc == 0bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) && req_a == 1bv32) && s_memory0 == 50bv32) - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && !(2bv32 == c_req_a)) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) || (((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(a, 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && (!(1bv32 == i) || 51bv32 == v)) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && (!(2bv32 == i) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && !(i == 1bv32)) && 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) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && 0bv32 == a) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a_t) && s_memory2 == 52bv32) && 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) && (!(1bv32 == i) || 51bv32 == v)) && 2bv32 == a) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && 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) && rsp_d___0 == ~bvadd64(req_a___0, 50bv32)) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && c_req_a == a_t) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_req_a == a_t) && 2bv32 == c_write_req_ev) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 2bv32 == i) && c_req_a == req_tt_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 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 0bv32 == req_tt_a) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && (!(2bv32 == c_req_a) || !~bvslt32(~bvadd64(1bv32, a_t), 3bv32))) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && 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: 1115]: 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) || (((((((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 && !(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)) && 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: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(a, 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 2bv32 == i) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32 - InvariantResult [Line: 290]: 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) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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_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))) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && (s_memory2 == 52bv32 || !(1bv32 == a_t))) && c_req_d == 52bv32) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && req_d == 51bv32) && req_a == 1bv32) && (s_memory2 == 52bv32 || !(0bv32 == a_t))) && s_memory0 == 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 && 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))) || (((1bv32 == a && (req_d == 52bv32 || !(req_a == 2bv32))) && ((1bv32 == a_t && ((((((((((req_d == 50bv32 && ~bvadd64(c_req_a, 50bv32) == c_req_d) && v == 50bv32) && ((((((((s_run_pc == 2bv32 && c_req_a == a_t) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32) || ((((((((s_run_pc == 2bv32 && req_a == a) && 2bv32 == c_write_req_ev) && c_req_a == a) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) && (!(1bv32 == i) || 51bv32 == v)) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32) && !(4bv32 == m_run_pc)) && (!(req_a == 1bv32) || req_d == 51bv32)) || ((((((((((s_memory1 == 51bv32 || !(0bv32 == a_t)) && req_d == 50bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && v == 50bv32) && ((((((((s_run_pc == 2bv32 && c_req_a == a_t) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32) || ((((((((s_run_pc == 2bv32 && req_a == a) && 2bv32 == c_write_req_ev) && c_req_a == a) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) && (!(1bv32 == i) || 51bv32 == v)) && (s_memory1 == 51bv32 || !(0bv32 == a))) && s_memory0 == 50bv32) && !(4bv32 == m_run_pc)) && (!(req_a == 1bv32) || req_d == 51bv32)))) || (0bv32 == a_t && ((((((((((req_d == 50bv32 && ~bvadd64(c_req_a, 50bv32) == c_req_d) && v == 50bv32) && ((((((((s_run_pc == 2bv32 && c_req_a == a_t) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32) || ((((((((s_run_pc == 2bv32 && req_a == a) && 2bv32 == c_write_req_ev) && c_req_a == a) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) && (!(1bv32 == i) || 51bv32 == v)) && ~bvadd64(req_a, 50bv32) == req_d) && 0bv32 == a_t) && s_memory0 == 50bv32) && !(4bv32 == m_run_pc)) && (!(req_a == 1bv32) || req_d == 51bv32)) || ((((((((((s_memory1 == 51bv32 || !(0bv32 == a_t)) && req_d == 50bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && v == 50bv32) && ((((((((s_run_pc == 2bv32 && c_req_a == a_t) && 2bv32 == c_write_req_ev) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32) || ((((((((s_run_pc == 2bv32 && req_a == a) && 2bv32 == c_write_req_ev) && c_req_a == a) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && c_req_type == 1bv32) && c_m_lock == 1bv32) && c_empty_rsp == 1bv32))) && (!(1bv32 == i) || 51bv32 == v)) && (s_memory1 == 51bv32 || !(0bv32 == a))) && s_memory0 == 50bv32) && !(4bv32 == m_run_pc)) && (!(req_a == 1bv32) || req_d == 51bv32)))))) && (!(2bv32 == i) || 52bv32 == v))) || (((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a_t) && 2bv32 == c_write_rsp_ev) && c_req_type == 1bv32) && c_req_d == 52bv32) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && !(4bv32 == m_run_pc))) || ((((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 && !(s_run_st == 0bv32)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && 3bv32 == m_run_pc) && (req_d == 52bv32 || !(req_a == 2bv32))) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && (!(2bv32 == i) || 52bv32 == v)) && v == 50bv32) && !(2bv32 == c_req_a)) && (!(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)) - InvariantResult [Line: 240]: 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)) || ((((((((((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)) || ((((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 1bv32 == a_t) && 2bv32 == c_write_rsp_ev) && 1bv32 == req_type) && c_req_type == 1bv32) && c_req_d == 52bv32) && 2bv32 == a) && c_m_lock == 1bv32) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && 2bv32 == c_req_a) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 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) && !(2bv32 == i)) && 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_a == 2bv32)) - InvariantResult [Line: 179]: 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 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 2bv32 == req_a) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a_t) && 3bv32 == m_run_pc) && 2bv32 == c_write_rsp_ev) && c_req_a == 1bv32) && ~bvadd64(c_req_a, 50bv32) == c_req_d) && 1bv32 == req_type) && 2bv32 == a) && c_m_lock == 1bv32) && ~bvadd64(req_a, 50bv32) == req_d) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 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) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: 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: 408]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && req_a___0 == 1bv32) && s_memory0 == 50bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(s_run_st == 0bv32)) && !(req_a == 1bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && req_a___0 == 2bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) - InvariantResult [Line: 590]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || ((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_m_lock == 1bv32) && 0bv32 == a) && ((3bv32 == m_run_pc && c_empty_rsp == 1bv32) || (c_empty_rsp == 1bv32 && m_run_pc == 0bv32))) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory2 == ~bvadd64(req_a___0, 50bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1297]: 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) || (((((((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 && !(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)) && 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: 399]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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) - InvariantResult [Line: 913]: 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) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && req_type == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && req_a == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && req_a == a_t) && 2bv32 == i) && c_req_a == req_tt_a) && req_a == 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) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && 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) - InvariantResult [Line: 1319]: 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) || (((((((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 && !(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)) && 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: 1289]: 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) || (((((((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 && !(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)) && 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: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && 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) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && c_m_lock == 0bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) - InvariantResult [Line: 270]: 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: 1089]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51bv32 && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && s_memory2 == 52bv32) && req_a == 2bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && (((((!(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))) && 2bv32 == i) && s_memory0 == 50bv32) || ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((!(req_a == 1bv32) && c_write_rsp_ev == 1bv32) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && req_d == 50bv32) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && 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_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32))) || (((((((((((((1bv32 == i && s_memory1 == 51bv32) && c_write_rsp_ev == 1bv32) && 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) && req_a == 1bv32) && a_t == i) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32)))) || (((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || ((((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && m_run_st == 0bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32) || ((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 1bv32 == a_t) && 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)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((s_run_pc == 2bv32 && !(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) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && x == 51bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && c_empty_rsp == 1bv32) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2))) || (((((((((((((((((((!(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) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && s_run_pc == 0bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && (c_req_d == 52bv32 || !(2bv32 == c_req_a))) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 945]: 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) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_type == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && req_type == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(1bv32 == i)) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && !(2bv32 == i)) && c_req_type == 1bv32) && v == 50bv32) && c_m_lock == 1bv32) && req_type == 1bv32) && req_a == a_t) && req_d == 51bv32) && req_a == 1bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 1bv32 == a) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && req_a == req_tt_a) && req_a == a_t) && 2bv32 == i) && 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)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 2bv32 == i) && req_a___0 == c_req_a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) && 2bv32 == req_tt_a)) || ((((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 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) && 52bv32 == v) && 0bv32 == a_t) && 2bv32 == i) && req_a___0 == 0bv32) && 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) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2bv32 && c_req_a == 0bv32) && !(s_run_st == 0bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_m_lock == 1bv32) && 0bv32 == a) && req_d == 52bv32) && 52bv32 == v) && 0bv32 == req_type___0) && 2bv32 == i) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) || (((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 0bv32 == req_type___0) && 0bv32 == a_t) && 2bv32 == i) && !(i == 1bv32)) && req_a___0 == c_req_a) && req_a___0 == 1bv32) && req_a___0 == a) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && s_memory2 == ~bvadd64(req_a___0, 50bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && req_type == 0bv32) && 1bv32 == a_t) && req_a___0 == 2bv32) && 2bv32 == c_write_rsp_ev) && 6bv32 == m_run_pc) && 2bv32 == a) && c_m_lock == 1bv32) && 2bv32 == c_req_a) && (!~bvslt32(~bvadd64(1bv32, a_t), 3bv32) || !(req_a == 2bv32))) && 52bv32 == v) && 0bv32 == req_type___0) && ~bvadd64(req_tt_a, 50bv32) == s_memory1) && 2bv32 == i) && i == a_t) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2bv32 && !(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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && req_type == 1bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32) || ((((((((((((((((((((!(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) && !(2bv32 == i)) && v == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && s_run_pc == 0bv32) && req_type == 1bv32) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) && c_empty_rsp == 1bv32)) || (((((((((((((((((s_run_pc == 2bv32 && 1bv32 == i) && s_memory1 == 51bv32) && 51bv32 == v) && 2bv32 == c_write_req_ev) && 1bv32 == a) && 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) && a_t == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32)) || ((((((((((((((((((s_run_pc == 2bv32 && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && req_type == 1bv32) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32) && c_empty_rsp == 1bv32) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_run_pc == 2bv32 && \result == 51bv32) && i == req_tt_a) && 1bv32 == req_tt_a) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && x == 51bv32) && c_empty_req == 1bv32) && c_rsp_d == 51bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && 52bv32 == v) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && i == a_t) && (s_memory1 == ~bvadd64(req_a___0, 50bv32) || !(c_req_a == 1bv32))) && s_memory0 == 50bv32) && (1bv32 == a || !(c_req_a == 1bv32))) && rsp_d == 51bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) || ((((((((((((((((((((((((((s_run_pc == 2bv32 && !(2bv32 == i)) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && s_memory2 == 52bv32) && 0bv32 == req_tt_a) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && \result == 50bv32) && c_rsp_d == 50bv32) && c_m_lock == 1bv32) && 0bv32 == a) && 52bv32 == v) && rsp_d == 50bv32) && 0bv32 == a_t) && (~bvadd64(req_tt_a, 50bv32) == s_memory2 || !(req_a == 2bv32))) && 2bv32 == i) && !(c_req_a == 1bv32)) && !(i == 1bv32)) && req_a___0 == 0bv32) && s_memory0 == 50bv32) && (!(2bv32 == c_req_a) || ~bvadd64(req_tt_a, 50bv32) == s_memory2)) && x == 50bv32)) || (((((((((((((((((((((((x == 52bv32 && s_run_pc == 2bv32) && !(req_a == 1bv32)) && s_memory1 == 51bv32) && c_req_type == 0bv32) && c_write_rsp_ev == 1bv32) && c_rsp_d == 52bv32) && 2bv32 == c_write_req_ev) && req_type == 0bv32) && 2bv32 == i) && s_memory2 == 52bv32) && c_empty_req == 1bv32) && 6bv32 == m_run_pc) && c_m_lock == 1bv32) && (!~bvslt32(~bvadd64(1bv32, a), 3bv32) || !(2bv32 == c_req_a))) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && !(c_req_a == 1bv32)) && (s_memory2 == ~bvadd64(req_a___0, 50bv32) || !(2bv32 == c_req_a))) && \result == 52bv32) && s_memory0 == 50bv32) && rsp_d == 52bv32) && 2bv32 == req_tt_a) - InvariantResult [Line: 289]: 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) && 1bv32 == a) && 1bv32 == a_t) && 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) || (((((((((((((((((s_run_pc == 2bv32 && !(s_run_st == 0bv32)) && !~bvslt32(~bvadd64(1bv32, a), 3bv32)) && s_memory1 == 51bv32) && 2bv32 == c_write_req_ev) && 3bv32 == m_run_pc) && s_memory2 == 52bv32) && 2bv32 == c_write_rsp_ev) && req_a == 2bv32) && c_empty_req == 1bv32) && c_req_d == 52bv32) && c_m_lock == 1bv32) && req_d == 52bv32) && 2bv32 == c_req_a) && 52bv32 == v) && !~bvslt32(~bvadd64(1bv32, a_t), 3bv32)) && 2bv32 == i) && s_memory0 == 50bv32)) || ((((((((((((((((((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) && !(2bv32 == i)) && v == 50bv32) && !(2bv32 == c_req_a)) && c_m_lock == 1bv32) && 0bv32 == a) && 0bv32 == a_t) && !(c_req_a == 1bv32)) && c_req_d == 50bv32) && s_memory0 == 50bv32) && !(req_a == 2bv32)) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:17:48,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca26a6-1d4e-4afa-b4e2-a7c79d1fd4b0/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...